heap-typed 1.53.9 → 1.54.1

package/dist/data-structures/binary-tree/binary-tree.d.ts

@@ -5,26 +5,43 @@
  * @copyright Copyright (c) 2022 Pablo Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-import { BinaryTreeDeleteResult, BinaryTreeNodeNested, BinaryTreeOptions, BinaryTreePrintOptions, BTNEntry, BTNRep, DFSOrderPattern, EntryCallback, FamilyPosition, IterationType, NodeCallback, NodeDisplayLayout, NodePredicate, OptNodeOrNull, ToEntryFn } from '../../types';
+import type { BinaryTreeDeleteResult, BinaryTreeOptions, BinaryTreePrintOptions, BTNEntry, BTNRep, DFSOrderPattern, EntryCallback, FamilyPosition, IterationType, NodeCallback, NodeDisplayLayout, NodePredicate, OptNodeOrNull, RBTNColor, ToEntryFn } from '../../types';
 import { IBinaryTree } from '../../interfaces';
 import { IterableEntryBase } from '../base';
 import { Range } from '../../common';
 /**
  * Represents a node in a binary tree.
  * @template V - The type of data stored in the node.
- * @template NODE - The type of the family relationship in the binary tree.
+ * @template BinaryTreeNode<K, V> - The type of the family relationship in the binary tree.
  */
-export declare class BinaryTreeNode<K = any, V = any, NODE extends BinaryTreeNode<K, V, NODE> = BinaryTreeNode<K, V, BinaryTreeNodeNested<K, V>>> {
+export declare class BinaryTreeNode<K = any, V = any> {
+    /**
+     * The constructor function initializes an object with a key and an optional value in TypeScript.
+     * @param {K} key - The `key` parameter in the constructor function is used to store the key value
+     * for the key-value pair.
+     * @param {V} [value] - The `value` parameter in the constructor is optional, meaning it does not
+     * have to be provided when creating an instance of the class. If a `value` is not provided, it will
+     * default to `undefined`.
+     */
+    constructor(key: K, value?: V);
     key: K;
     value?: V;
-    parent?: NODE;
-    constructor(key: K, value?: V);
-    protected _left?: OptNodeOrNull<NODE>;
-    get left(): OptNodeOrNull<NODE>;
-    set left(v: OptNodeOrNull<NODE>);
-    protected _right?: OptNodeOrNull<NODE>;
-    get right(): OptNodeOrNull<NODE>;
-    set right(v: OptNodeOrNull<NODE>);
+    parent?: BinaryTreeNode<K, V>;
+    _left?: OptNodeOrNull<BinaryTreeNode<K, V>>;
+    get left(): OptNodeOrNull<BinaryTreeNode<K, V>>;
+    set left(v: OptNodeOrNull<BinaryTreeNode<K, V>>);
+    _right?: OptNodeOrNull<BinaryTreeNode<K, V>>;
+    get right(): OptNodeOrNull<BinaryTreeNode<K, V>>;
+    set right(v: OptNodeOrNull<BinaryTreeNode<K, V>>);
+    _height: number;
+    get height(): number;
+    set height(value: number);
+    _color: RBTNColor;
+    get color(): RBTNColor;
+    set color(value: RBTNColor);
+    _count: number;
+    get count(): number;
+    set count(value: number);
     get familyPosition(): FamilyPosition;
 }
 /**
@@ -34,28 +51,28 @@ export declare class BinaryTreeNode<K = any, V = any, NODE extends BinaryTreeNod
  * 4. Subtrees: Each child of a node forms the root of a subtree.
  * 5. Leaf Nodes: Nodes without children are leaves.
  */
-export declare class BinaryTree<K = any, V = any, R = object, NODE extends BinaryTreeNode<K, V, NODE> = BinaryTreeNode<K, V, BinaryTreeNodeNested<K, V>>> extends IterableEntryBase<K, V | undefined> implements IBinaryTree<K, V, R, NODE> {
-    iterationType: IterationType;
+export declare class BinaryTree<K = any, V = any, R = object, MK = any, MV = any, MR = object> extends IterableEntryBase<K, V | undefined> implements IBinaryTree<K, V, R, MK, MV, MR> {
     /**
-     * The constructor initializes a binary tree with optional options and adds keys, nodes, entries, or
-     * raw data if provided.
-     * @param keysNodesEntriesOrRaws - The `keysNodesEntriesOrRaws` parameter in the constructor
-     * is an iterable that can contain elements of type `BTNRep<K, V, NODE>` or `R`. It is
-     * initialized with an empty array `[]` by default.
-     * @param [options] - The `options` parameter in the constructor is an object that can contain the
-     * following properties:
+     * This TypeScript constructor function initializes a binary tree with optional options and adds
+     * elements based on the provided input.
+     * @param keysNodesEntriesOrRaws - The `keysNodesEntriesOrRaws` parameter in the constructor is an
+     * iterable that can contain either objects of type `BTNRep<K, V, BinaryTreeNode<K, V>>` or `R`. It
+     * is used to initialize the binary tree with keys, nodes, entries, or raw data.
+     * @param [options] - The `options` parameter in the constructor is an optional object that can
+     * contain the following properties:
      */
-    constructor(keysNodesEntriesOrRaws?: Iterable<BTNRep<K, V, NODE> | R>, options?: BinaryTreeOptions<K, V, R>);
+    constructor(keysNodesEntriesOrRaws?: Iterable<BTNRep<K, V, BinaryTreeNode<K, V>> | R>, options?: BinaryTreeOptions<K, V, R>);
+    iterationType: IterationType;
     protected _isMapMode: boolean;
     get isMapMode(): boolean;
     protected _store: Map<K, V | undefined>;
     get store(): Map<K, V | undefined>;
-    protected _root?: OptNodeOrNull<NODE>;
-    get root(): OptNodeOrNull<NODE>;
+    protected _root?: OptNodeOrNull<BinaryTreeNode<K, V>>;
+    get root(): OptNodeOrNull<BinaryTreeNode<K, V>>;
     protected _size: number;
     get size(): number;
-    protected _NIL: NODE;
-    get NIL(): NODE;
+    protected _NIL: BinaryTreeNode<K, V>;
+    get NIL(): BinaryTreeNode<K, V>;
     protected _toEntryFn?: ToEntryFn<K, V, R>;
     get toEntryFn(): ToEntryFn<K, V, R> | undefined;
     /**
@@ -68,32 +85,29 @@ export declare class BinaryTree<K = any, V = any, R = object, NODE extends Binar
      * not required to be provided when calling the function. If a `value` is provided, it should be of
      * type `V`, which is the type of the value associated with the node.
      * @returns A new BinaryTreeNode instance with the provided key and value is being returned, casted
-     * as NODE.
+     * as BinaryTreeNode<K, V>.
      */
-    createNode(key: K, value?: V): NODE;
+    createNode(key: K, value?: V): BinaryTreeNode<K, V>;
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
      *
-     * The `createTree` function creates a new binary tree based on the provided options.
-     * @param [options] - The `options` parameter in the `createTree` method is of type
-     * `BinaryTreeOptions<K, V, R>`. This type likely contains configuration options for creating a
-     * binary tree, such as the iteration type, whether the tree is in map mode, and functions for
-     * converting entries.
-     * @returns The `createTree` method is returning an instance of the `BinaryTree` class with the
-     * provided options. The method is creating a new `BinaryTree` object with an empty array as the
-     * initial data, and then setting various options such as `iterationType`, `isMapMode`, and
-     * `toEntryFn` based on the current object's properties and the provided `options`. Finally, it
+     * The function creates a binary tree with the specified options.
+     * @param [options] - The `options` parameter in the `createTree` function is an optional parameter
+     * that allows you to provide partial configuration options for creating a binary tree. It is of type
+     * `Partial<BinaryTreeOptions<K, V, R>>`, which means you can pass in an object containing a subset
+     * of properties
+     * @returns A new instance of a binary tree with the specified options is being returned.
      */
-    createTree(options?: BinaryTreeOptions<K, V, R>): typeof this;
+    createTree(options?: BinaryTreeOptions<K, V, R>): BinaryTree<K, V, R, MK, MV, MR>;
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(log n)
      *
      * The function `ensureNode` in TypeScript checks if a given input is a node, entry, key, or raw
      * value and returns the corresponding node or null.
-     * @param {BTNRep<K, V, NODE> | R} keyNodeEntryOrRaw - The `keyNodeEntryOrRaw`
-     * parameter in the `ensureNode` function can be of type `BTNRep<K, V, NODE>` or `R`. It
+     * @param {BTNRep<K, V, BinaryTreeNode<K, V>>} keyNodeOrEntry - The `keyNodeOrEntry`
+     * parameter in the `ensureNode` function can be of type `BTNRep<K, V, BinaryTreeNode<K, V>>` or `R`. It
      * is used to determine whether the input is a key, node, entry, or raw data. The
      * @param {IterationType} iterationType - The `iterationType` parameter in the `ensureNode` function
      * is used to specify the type of iteration to be performed. It has a default value of
@@ -101,99 +115,134 @@ export declare class BinaryTree<K = any, V = any, R = object, NODE extends Binar
      * @returns The `ensureNode` function returns either a node, `null`, or `undefined` based on the
      * conditions specified in the code snippet.
      */
-    ensureNode(keyNodeEntryOrRaw: BTNRep<K, V, NODE> | R, iterationType?: IterationType): OptNodeOrNull<NODE>;
+    ensureNode(keyNodeOrEntry: BTNRep<K, V, BinaryTreeNode<K, V>>, iterationType?: IterationType): OptNodeOrNull<BinaryTreeNode<K, V>>;
     /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     *
      * The function isNode checks if the input is an instance of BinaryTreeNode.
-     * @param {BTNRep<K, V, NODE> | R} keyNodeEntryOrRaw - The parameter
-     * `keyNodeEntryOrRaw` can be either a key, a node, an entry, or raw data. The function is
+     * @param {BTNRep<K, V, BinaryTreeNode<K, V>>} keyNodeOrEntry - The parameter
+     * `keyNodeOrEntry` can be either a key, a node, an entry, or raw data. The function is
      * checking if the input is an instance of a `BinaryTreeNode` and returning a boolean value
      * accordingly.
-     * @returns The function `isNode` is checking if the input `keyNodeEntryOrRaw` is an instance of
+     * @returns The function `isNode` is checking if the input `keyNodeOrEntry` is an instance of
      * `BinaryTreeNode`. If it is, the function returns `true`, indicating that the input is a node. If
      * it is not an instance of `BinaryTreeNode`, the function returns `false`, indicating that the input
      * is not a node.
      */
-    isNode(keyNodeEntryOrRaw: BTNRep<K, V, NODE> | R): keyNodeEntryOrRaw is NODE;
+    isNode(keyNodeOrEntry: BTNRep<K, V, BinaryTreeNode<K, V>>): keyNodeOrEntry is BinaryTreeNode<K, V>;
     /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     *
      * The function `isRaw` checks if the input parameter is of type `R` by verifying if it is an object.
-     * @param {BTNRep<K, V, NODE> | R} keyNodeEntryOrRaw - BTNRep<K, V, NODE> | R
+     * @param {BTNRep<K, V, BinaryTreeNode<K, V>> | R} keyNodeEntryOrRaw - BTNRep<K, V, BinaryTreeNode<K, V>>
      * @returns The function `isRaw` is checking if the `keyNodeEntryOrRaw` parameter is of type `R` by
      * checking if it is an object. If the parameter is an object, the function will return `true`,
      * indicating that it is of type `R`.
      */
-    isRaw(keyNodeEntryOrRaw: BTNRep<K, V, NODE> | R): keyNodeEntryOrRaw is R;
+    isRaw(keyNodeEntryOrRaw: BTNRep<K, V, BinaryTreeNode<K, V>> | R): keyNodeEntryOrRaw is R;
     /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     *
      * The function `isRealNode` checks if a given input is a valid node in a binary tree.
-     * @param {BTNRep<K, V, NODE> | R} keyNodeEntryOrRaw - The `keyNodeEntryOrRaw`
-     * parameter in the `isRealNode` function can be of type `BTNRep<K, V, NODE>` or `R`.
-     * The function checks if the input parameter is a `NODE` type by verifying if it is not equal
-     * @returns The function `isRealNode` is checking if the input `keyNodeEntryOrRaw` is a valid
+     * @param {BTNRep<K, V, BinaryTreeNode<K, V>>} keyNodeOrEntry - The `keyNodeOrEntry`
+     * parameter in the `isRealNode` function can be of type `BTNRep<K, V, BinaryTreeNode<K, V>>` or `R`.
+     * The function checks if the input parameter is a `BinaryTreeNode<K, V>` type by verifying if it is not equal
+     * @returns The function `isRealNode` is checking if the input `keyNodeOrEntry` is a valid
      * node by comparing it to `this._NIL`, `null`, and `undefined`. If the input is not one of these
      * values, it then calls the `isNode` method to further determine if the input is a node. The
      * function will return a boolean value indicating whether the
      */
-    isRealNode(keyNodeEntryOrRaw: BTNRep<K, V, NODE> | R): keyNodeEntryOrRaw is NODE;
+    isRealNode(keyNodeOrEntry: BTNRep<K, V, BinaryTreeNode<K, V>>): keyNodeOrEntry is BinaryTreeNode<K, V>;
     /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     *
      * The function checks if a given input is a valid node or null.
-     * @param {BTNRep<K, V, NODE> | R} keyNodeEntryOrRaw - The parameter
-     * `keyNodeEntryOrRaw` in the `isRealNodeOrNull` function can be of type `BTNRep<K,
-     * V, NODE>` or `R`. It is a union type that can either be a key, a node, an entry, or
+     * @param {BTNRep<K, V, BinaryTreeNode<K, V>>} keyNodeOrEntry - The parameter
+     * `keyNodeOrEntry` in the `isRealNodeOrNull` function can be of type `BTNRep<K,
+     * V, BinaryTreeNode<K, V>>` or `R`. It is a union type that can either be a key, a node, an entry, or
      * @returns The function `isRealNodeOrNull` is returning a boolean value. It checks if the input
-     * `keyNodeEntryOrRaw` is either `null` or a real node, and returns `true` if it is a node or
+     * `keyNodeOrEntry` is either `null` or a real node, and returns `true` if it is a node or
      * `null`, and `false` otherwise.
      */
-    isRealNodeOrNull(keyNodeEntryOrRaw: BTNRep<K, V, NODE> | R): keyNodeEntryOrRaw is NODE | null;
+    isRealNodeOrNull(keyNodeOrEntry: BTNRep<K, V, BinaryTreeNode<K, V>>): keyNodeOrEntry is BinaryTreeNode<K, V> | null;
     /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     *
      * The function isNIL checks if a given key, node, entry, or raw value is equal to the _NIL value.
-     * @param {BTNRep<K, V, NODE> | R} keyNodeEntryOrRaw - BTNRep<K, V,
-     * NODE> | R
-     * @returns The function is checking if the `keyNodeEntryOrRaw` parameter is equal to the `_NIL`
+     * @param {BTNRep<K, V, BinaryTreeNode<K, V>>} keyNodeOrEntry - BTNRep<K, V,
+     * BinaryTreeNode<K, V>>
+     * @returns The function is checking if the `keyNodeOrEntry` parameter is equal to the `_NIL`
      * property of the current object and returning a boolean value based on that comparison.
      */
-    isNIL(keyNodeEntryOrRaw: BTNRep<K, V, NODE> | R): boolean;
-    isRange(keyNodeEntryRawOrPredicate: BTNRep<K, V, NODE> | R | NodePredicate<NODE> | Range<K>): keyNodeEntryRawOrPredicate is Range<K>;
+    isNIL(keyNodeOrEntry: BTNRep<K, V, BinaryTreeNode<K, V>>): boolean;
+    /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     *
+     * The function `isRange` checks if the input parameter is an instance of the `Range` class.
+     * @param {BTNRep<K, V, BinaryTreeNode<K, V>> | NodePredicate<BinaryTreeNode<K, V>> | Range<K>}
+     * keyNodeEntryOrPredicate - The `keyNodeEntryOrPredicate` parameter in the `isRange` function can be
+     * of type `BTNRep<K, V, BinaryTreeNode<K, V>>`, `NodePredicate<BinaryTreeNode<K, V>>`, or
+     * `Range<K>`. The function checks if the `keyNodeEntry
+     * @returns The `isRange` function is checking if the `keyNodeEntryOrPredicate` parameter is an
+     * instance of the `Range` class. If it is an instance of `Range`, the function will return `true`,
+     * indicating that the parameter is a `Range<K>`. If it is not an instance of `Range`, the function
+     * will return `false`.
+     */
+    isRange(keyNodeEntryOrPredicate: BTNRep<K, V, BinaryTreeNode<K, V>> | NodePredicate<BinaryTreeNode<K, V>> | Range<K>): keyNodeEntryOrPredicate is Range<K>;
     /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     *
      * The function determines whether a given key, node, entry, or raw data is a leaf node in a binary
      * tree.
-     * @param {BTNRep<K, V, NODE> | R} keyNodeEntryOrRaw - The parameter
-     * `keyNodeEntryOrRaw` can be of type `BTNRep<K, V, NODE>` or `R`. It represents a
+     * @param {BTNRep<K, V, BinaryTreeNode<K, V>>} keyNodeOrEntry - The parameter
+     * `keyNodeOrEntry` can be of type `BTNRep<K, V, BinaryTreeNode<K, V>>` or `R`. It represents a
      * key, node, entry, or raw data in a binary tree structure. The function `isLeaf` checks whether the
      * provided
      * @returns The function `isLeaf` returns a boolean value indicating whether the input
-     * `keyNodeEntryOrRaw` is a leaf node in a binary tree.
+     * `keyNodeOrEntry` is a leaf node in a binary tree.
      */
-    isLeaf(keyNodeEntryOrRaw: BTNRep<K, V, NODE> | R): boolean;
+    isLeaf(keyNodeOrEntry: BTNRep<K, V, BinaryTreeNode<K, V>>): boolean;
     /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     *
      * The function `isEntry` checks if the input is a BTNEntry object by verifying if it is an array
      * with a length of 2.
-     * @param {BTNRep<K, V, NODE> | R} keyNodeEntryOrRaw - The `keyNodeEntryOrRaw`
-     * parameter in the `isEntry` function can be of type `BTNRep<K, V, NODE>` or type `R`.
-     * The function checks if the provided `keyNodeEntryOrRaw` is of type `BTN
-     * @returns The `isEntry` function is checking if the `keyNodeEntryOrRaw` parameter is an array
+     * @param {BTNRep<K, V, BinaryTreeNode<K, V>>} keyNodeOrEntry - The `keyNodeOrEntry`
+     * parameter in the `isEntry` function can be of type `BTNRep<K, V, BinaryTreeNode<K, V>>` or type `R`.
+     * The function checks if the provided `keyNodeOrEntry` is of type `BTN
+     * @returns The `isEntry` function is checking if the `keyNodeOrEntry` parameter is an array
      * with a length of 2. If it is, then it returns `true`, indicating that the parameter is of type
      * `BTNEntry<K, V>`. If the condition is not met, it returns `false`.
      */
-    isEntry(keyNodeEntryOrRaw: BTNRep<K, V, NODE> | R): keyNodeEntryOrRaw is BTNEntry<K, V>;
+    isEntry(keyNodeOrEntry: BTNRep<K, V, BinaryTreeNode<K, V>>): keyNodeOrEntry is BTNEntry<K, V>;
     /**
      * Time Complexity O(1)
      * Space Complexity O(1)
      *
-     * The function `isKey` checks if a given key is comparable.
+     * The function `isValidKey` checks if a given key is comparable.
      * @param {any} key - The `key` parameter is of type `any`, which means it can be any data type in
      * TypeScript.
-     * @returns The function `isKey` is checking if the `key` parameter is `null` or if it is comparable.
+     * @returns The function `isValidKey` is checking if the `key` parameter is `null` or if it is comparable.
      * If the `key` is `null`, the function returns `true`. Otherwise, it returns the result of the
      * `isComparable` function, which is not provided in the code snippet.
      */
-    isKey(key: any): key is K;
+    isValidKey(key: any): key is K;
     /**
      * Time Complexity O(n)
      * Space Complexity O(1)
      *
      * The `add` function in TypeScript adds a new node to a binary tree while handling duplicate keys
      * and finding the correct insertion position.
-     * @param {BTNRep<K, V, NODE> | R} keyNodeEntryOrRaw - The `add` method you provided
-     * seems to be for adding a new node to a binary tree structure. The `keyNodeEntryOrRaw`
+     * @param {BTNRep<K, V, BinaryTreeNode<K, V>>} keyNodeOrEntry - The `add` method you provided
+     * seems to be for adding a new node to a binary tree structure. The `keyNodeOrEntry`
      * parameter in the method can accept different types of values:
      * @param {V} [value] - The `value` parameter in the `add` method represents the value associated
      * with the key that you want to add to the binary tree. When adding a key-value pair to the binary
@@ -203,17 +252,17 @@ export declare class BinaryTree<K = any, V = any, R = object, NODE extends Binar
      * node was successful, and `false` if the insertion position could not be found or if a duplicate
      * key was found and the node was replaced instead of inserted.
      */
-    add(keyNodeEntryOrRaw: BTNRep<K, V, NODE> | R, value?: V): boolean;
+    add(keyNodeOrEntry: BTNRep<K, V, BinaryTreeNode<K, V>>, value?: V): boolean;
     /**
      * Time Complexity: O(k * n)
-     * Space Complexity: O(1)
+     * Space Complexity: O(k)
      *
      * The `addMany` function takes in multiple keys or nodes or entries or raw values along with
      * optional values, and adds them to a data structure while returning an array indicating whether
      * each insertion was successful.
      * @param keysNodesEntriesOrRaws - `keysNodesEntriesOrRaws` is an iterable that can contain a
      * mix of keys, nodes, entries, or raw values. Each element in this iterable can be of type
-     * `BTNRep<K, V, NODE>` or `R`.
+     * `BTNRep<K, V, BinaryTreeNode<K, V>>` or `R`.
      * @param [values] - The `values` parameter in the `addMany` function is an optional parameter that
      * accepts an iterable of values. These values correspond to the keys or nodes being added in the
      * `keysNodesEntriesOrRaws` parameter. If provided, the function will iterate over the values and
@@ -222,16 +271,16 @@ export declare class BinaryTree<K = any, V = any, R = object, NODE extends Binar
      * node, entry, or raw value was successfully added to the data structure. Each boolean value
      * corresponds to the success of adding the corresponding key or value in the input iterable.
      */
-    addMany(keysNodesEntriesOrRaws: Iterable<BTNRep<K, V, NODE> | R>, values?: Iterable<V | undefined>): boolean[];
+    addMany(keysNodesEntriesOrRaws: Iterable<BTNRep<K, V, BinaryTreeNode<K, V>> | R>, values?: Iterable<V | undefined>): boolean[];
     /**
      * Time Complexity: O(k * n)
      * Space Complexity: O(1)
      *
      * The `merge` function in TypeScript merges another binary tree into the current tree by adding all
      * elements from the other tree.
-     * @param anotherTree - `BinaryTree<K, V, R, NODE, TREE>`
+     * @param anotherTree - BinaryTree<K, V, R, MK, MV, MR>
      */
-    merge(anotherTree: this): void;
+    merge(anotherTree: BinaryTree<K, V, R, MK, MV, MR>): void;
     /**
      * Time Complexity: O(k * n)
      * Space Complexity: O(1)
@@ -239,19 +288,19 @@ export declare class BinaryTree<K = any, V = any, R = object, NODE extends Binar
      * The `refill` function clears the existing data structure and then adds new key-value pairs based
      * on the provided input.
      * @param keysNodesEntriesOrRaws - The `keysNodesEntriesOrRaws` parameter in the `refill`
-     * method can accept an iterable containing a mix of `BTNRep<K, V, NODE>` objects or `R`
+     * method can accept an iterable containing a mix of `BTNRep<K, V, BinaryTreeNode<K, V>>` objects or `R`
      * objects.
      * @param [values] - The `values` parameter in the `refill` method is an optional parameter that
      * accepts an iterable of values of type `V` or `undefined`.
      */
-    refill(keysNodesEntriesOrRaws: Iterable<BTNRep<K, V, NODE> | R>, values?: Iterable<V | undefined>): void;
+    refill(keysNodesEntriesOrRaws: Iterable<BTNRep<K, V, BinaryTreeNode<K, V>> | R>, values?: Iterable<V | undefined>): void;
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
      *
      * The function `delete` in TypeScript implements the deletion of a node in a binary tree and returns
      * the deleted node along with information for tree balancing.
-     * @param {BTNRep<K, V, NODE> | R} keyNodeEntryOrRaw
+     * @param {BTNRep<K, V, BinaryTreeNode<K, V>>} keyNodeOrEntry
      * - The `delete` method you provided is used to delete a node from a binary tree based on the key,
      * node, entry or raw data. The method returns an array of
      * `BinaryTreeDeleteResult` objects containing information about the deleted node and whether
@@ -260,22 +309,22 @@ export declare class BinaryTree<K = any, V = any, R = object, NODE extends Binar
      * the array contains information about the node that was deleted (`deleted`) and the node that may
      * need to be balanced (`needBalanced`).
      */
-    delete(keyNodeEntryOrRaw: BTNRep<K, V, NODE> | R): BinaryTreeDeleteResult<NODE>[];
+    delete(keyNodeOrEntry: BTNRep<K, V, BinaryTreeNode<K, V>>): BinaryTreeDeleteResult<BinaryTreeNode<K, V>>[];
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(k + log n)
      *
      * The `search` function in TypeScript performs a depth-first or breadth-first search on a tree
      * structure based on a given predicate or key, with options to return multiple results or just one.
-     * @param {BTNRep<K, V, NODE> | R | NodePredicate<NODE>} keyNodeEntryRawOrPredicate - The
-     * `keyNodeEntryRawOrPredicate` parameter in the `search` function can accept three types of values:
+     * @param {BTNRep<K, V, BinaryTreeNode<K, V>> | NodePredicate<BinaryTreeNode<K, V>>} keyNodeEntryOrPredicate - The
+     * `keyNodeEntryOrPredicate` parameter in the `search` function can accept three types of values:
      * @param [onlyOne=false] - The `onlyOne` parameter in the `search` function is a boolean flag that
      * determines whether the search should stop after finding the first matching node. If `onlyOne` is
      * set to `true`, the search will return as soon as a matching node is found. If `onlyOne` is
      * @param {C} callback - The `callback` parameter in the `search` function is a callback function
      * that will be called on each node that matches the search criteria. It is of type `C`, which
-     * extends `NodeCallback<NODE>`. The default value for `callback` is `this._DEFAULT_NODE_CALLBACK` if
-     * @param {BTNRep<K, V, NODE> | R} startNode - The `startNode` parameter in the `search` function is
+     * extends `NodeCallback<BinaryTreeNode<K, V>>`. The default value for `callback` is `this._DEFAULT_NODE_CALLBACK` if
+     * @param {BTNRep<K, V, BinaryTreeNode<K, V>>} startNode - The `startNode` parameter in the `search` function is
      * used to specify the node from which the search operation should begin. It represents the starting
      * point in the binary tree where the search will be performed. If no specific `startNode` is
      * provided, the search operation will start from the root
@@ -285,19 +334,19 @@ export declare class BinaryTree<K = any, V = any, R = object, NODE extends Binar
      * @returns The `search` function returns an array of values that match the provided criteria based
      * on the search algorithm implemented within the function.
      */
-    search<C extends NodeCallback<NODE>>(keyNodeEntryRawOrPredicate: BTNRep<K, V, NODE> | R | NodePredicate<NODE>, onlyOne?: boolean, callback?: C, startNode?: BTNRep<K, V, NODE> | R, iterationType?: IterationType): ReturnType<C>[];
+    search<C extends NodeCallback<BinaryTreeNode<K, V>>>(keyNodeEntryOrPredicate: BTNRep<K, V, BinaryTreeNode<K, V>> | NodePredicate<BinaryTreeNode<K, V>>, onlyOne?: boolean, callback?: C, startNode?: BTNRep<K, V, BinaryTreeNode<K, V>>, iterationType?: IterationType): ReturnType<C>[];
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(k + log n)
      *
      * The function `getNodes` retrieves nodes from a binary tree based on a key, node, entry, raw data,
      * or predicate, with options for recursive or iterative traversal.
-     * @param {BTNRep<K, V, NODE> | R | NodePredicate<NODE>} keyNodeEntryRawOrPredicate
+     * @param {BTNRep<K, V, BinaryTreeNode<K, V>> | NodePredicate<BinaryTreeNode<K, V>>} keyNodeEntryOrPredicate
      * - The `getNodes` function you provided takes several parameters:
      * @param [onlyOne=false] - The `onlyOne` parameter in the `getNodes` function is a boolean flag that
      * determines whether to return only the first node that matches the criteria specified by the
-     * `keyNodeEntryRawOrPredicate` parameter. If `onlyOne` is set to `true`, the function will
-     * @param {BTNRep<K, V, NODE> | R} startNode - The `startNode` parameter in the
+     * `keyNodeEntryOrPredicate` parameter. If `onlyOne` is set to `true`, the function will
+     * @param {BTNRep<K, V, BinaryTreeNode<K, V>>} startNode - The `startNode` parameter in the
      * `getNodes` function is used to specify the starting point for traversing the binary tree. It
      * represents the root node of the binary tree or the node from which the traversal should begin. If
      * not provided, the default value is set to `this._root
@@ -307,17 +356,17 @@ export declare class BinaryTree<K = any, V = any, R = object, NODE extends Binar
      * @returns The `getNodes` function returns an array of nodes that satisfy the provided condition
      * based on the input parameters and the iteration type specified.
      */
-    getNodes(keyNodeEntryRawOrPredicate: BTNRep<K, V, NODE> | R | NodePredicate<NODE>, onlyOne?: boolean, startNode?: BTNRep<K, V, NODE> | R, iterationType?: IterationType): NODE[];
+    getNodes(keyNodeEntryOrPredicate: BTNRep<K, V, BinaryTreeNode<K, V>> | NodePredicate<BinaryTreeNode<K, V>>, onlyOne?: boolean, startNode?: BTNRep<K, V, BinaryTreeNode<K, V>>, iterationType?: IterationType): BinaryTreeNode<K, V>[];
     /**
      * Time Complexity: O(n)
-     * Space Complexity: O(log n).
+     * Space Complexity: O(log n)
      *
      * The `getNode` function retrieves a node based on the provided key, node, entry, raw data, or
      * predicate.
-     * @param {BTNRep<K, V, NODE> | R | NodePredicate<NODE>} keyNodeEntryRawOrPredicate
-     * - The `keyNodeEntryRawOrPredicate` parameter in the `getNode` function can accept a key,
+     * @param {BTNRep<K, V, BinaryTreeNode<K, V>> | NodePredicate<BinaryTreeNode<K, V>>} keyNodeEntryOrPredicate
+     * - The `keyNodeEntryOrPredicate` parameter in the `getNode` function can accept a key,
      * node, entry, raw data, or a predicate function.
-     * @param {BTNRep<K, V, NODE> | R} startNode - The `startNode` parameter in the
+     * @param {BTNRep<K, V, BinaryTreeNode<K, V>>} startNode - The `startNode` parameter in the
      * `getNode` function is used to specify the starting point for searching for a node in a binary
      * tree. If no specific starting point is provided, the default value is set to `this._root`, which
      * is typically the root node of the binary tree.
@@ -328,17 +377,17 @@ export declare class BinaryTree<K = any, V = any, R = object, NODE extends Binar
      * @returns The `getNode` function is returning the first node that matches the specified criteria,
      * or `null` if no matching node is found.
      */
-    getNode(keyNodeEntryRawOrPredicate: BTNRep<K, V, NODE> | R | NodePredicate<NODE>, startNode?: BTNRep<K, V, NODE> | R, iterationType?: IterationType): OptNodeOrNull<NODE>;
+    getNode(keyNodeEntryOrPredicate: BTNRep<K, V, BinaryTreeNode<K, V>> | NodePredicate<BinaryTreeNode<K, V>>, startNode?: BTNRep<K, V, BinaryTreeNode<K, V>>, iterationType?: IterationType): OptNodeOrNull<BinaryTreeNode<K, V>>;
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(log n)
      *
      * This function overrides the `get` method to retrieve the value associated with a specified key,
      * node, entry, raw data, or predicate in a data structure.
-     * @param {BTNRep<K, V, NODE> | R | NodePredicate<NODE>} keyNodeEntryRawOrPredicate
-     * - The `keyNodeEntryRawOrPredicate` parameter in the `get` method can accept one of the
+     * @param {BTNRep<K, V, BinaryTreeNode<K, V>> | NodePredicate<BinaryTreeNode<K, V>>} keyNodeEntryOrPredicate
+     * - The `keyNodeEntryOrPredicate` parameter in the `get` method can accept one of the
      * following types:
-     * @param {BTNRep<K, V, NODE> | R} startNode - The `startNode` parameter in the `get`
+     * @param {BTNRep<K, V, BinaryTreeNode<K, V>>} startNode - The `startNode` parameter in the `get`
      * method is used to specify the starting point for searching for a key or node in the binary tree.
      * If no specific starting point is provided, the default starting point is the root of the binary
      * tree (`this._root`).
@@ -351,17 +400,17 @@ export declare class BinaryTree<K = any, V = any, R = object, NODE extends Binar
      * the method returns the corresponding value. If the key or node is not found, it returns
      * `undefined`.
      */
-    get(keyNodeEntryRawOrPredicate: BTNRep<K, V, NODE> | R, startNode?: BTNRep<K, V, NODE> | R, iterationType?: IterationType): V | undefined;
+    get(keyNodeEntryOrPredicate: BTNRep<K, V, BinaryTreeNode<K, V>>, startNode?: BTNRep<K, V, BinaryTreeNode<K, V>>, iterationType?: IterationType): V | undefined;
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(log n)
      *
      * The `has` function in TypeScript checks if a specified key, node, entry, raw data, or predicate
      * exists in the data structure.
-     * @param {BTNRep<K, V, NODE> | R | NodePredicate<NODE>} keyNodeEntryRawOrPredicate
-     * - The `keyNodeEntryRawOrPredicate` parameter in the `override has` method can accept one of
+     * @param {BTNRep<K, V, BinaryTreeNode<K, V>> | NodePredicate<BinaryTreeNode<K, V>>} keyNodeEntryOrPredicate
+     * - The `keyNodeEntryOrPredicate` parameter in the `override has` method can accept one of
      * the following types:
-     * @param {BTNRep<K, V, NODE> | R} startNode - The `startNode` parameter in the
+     * @param {BTNRep<K, V, BinaryTreeNode<K, V>>} startNode - The `startNode` parameter in the
      * `override` method is used to specify the starting point for the search operation within the data
      * structure. It defaults to `this._root` if not provided explicitly.
      * @param {IterationType} iterationType - The `iterationType` parameter in the `override has` method
@@ -373,12 +422,12 @@ export declare class BinaryTree<K = any, V = any, R = object, NODE extends Binar
      * are matching nodes, it returns `true`, indicating that the tree contains the specified element.
      * Otherwise, it returns `false`.
      */
-    has(keyNodeEntryRawOrPredicate: BTNRep<K, V, NODE> | R | NodePredicate<NODE>, startNode?: BTNRep<K, V, NODE> | R, iterationType?: IterationType): boolean;
+    has(keyNodeEntryOrPredicate: BTNRep<K, V, BinaryTreeNode<K, V>> | NodePredicate<BinaryTreeNode<K, V>>, startNode?: BTNRep<K, V, BinaryTreeNode<K, V>>, iterationType?: IterationType): boolean;
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
      *
-     * The `clear` function resets the root node and size of a data structure to empty.
+     * The clear function removes nodes and values in map mode.
      */
     clear(): void;
     /**
@@ -397,7 +446,7 @@ export declare class BinaryTree<K = any, V = any, R = object, NODE extends Binar
      *
      * The function checks if a binary tree is perfectly balanced by comparing its minimum height with
      * its height.
-     * @param {BTNRep<K, V, NODE> | R} startNode - The `startNode` parameter is the starting
+     * @param {BTNRep<K, V, BinaryTreeNode<K, V>>} startNode - The `startNode` parameter is the starting
      * point for checking if the binary tree is perfectly balanced. It represents the root node of the
      * binary tree or a specific node from which the balance check should begin.
      * @returns The method `isPerfectlyBalanced` is returning a boolean value, which indicates whether
@@ -406,14 +455,14 @@ export declare class BinaryTree<K = any, V = any, R = object, NODE extends Binar
      * height plus 1 is greater than or equal to the height of the tree, then it is considered perfectly
      * balanced and
      */
-    isPerfectlyBalanced(startNode?: BTNRep<K, V, NODE> | R): boolean;
+    isPerfectlyBalanced(startNode?: BTNRep<K, V, BinaryTreeNode<K, V>>): boolean;
     /**
      * Time Complexity: O(n)
-     * Space Complexity: O(1)
+     * Space Complexity: O(log n)
      *
      * The function `isBST` in TypeScript checks if a binary search tree is valid using either recursive
      * or iterative methods.
-     * @param {BTNRep<K, V, NODE> | R} startNode - The `startNode` parameter in the `isBST`
+     * @param {BTNRep<K, V, BinaryTreeNode<K, V>>} startNode - The `startNode` parameter in the `isBST`
      * function represents the starting point for checking whether a binary search tree (BST) is valid.
      * It can be a node in the BST or a reference to the root of the BST. If no specific node is
      * provided, the function will default to
@@ -425,16 +474,16 @@ export declare class BinaryTree<K = any, V = any, R = object, NODE extends Binar
      * the tree satisfies the BST property, where for every node, all nodes in its left subtree have keys
      * less than the node's key, and all nodes in its right subtree have keys greater than the node's
      */
-    isBST(startNode?: BTNRep<K, V, NODE> | R, iterationType?: IterationType): boolean;
+    isBST(startNode?: BTNRep<K, V, BinaryTreeNode<K, V>>, iterationType?: IterationType): boolean;
     /**
      * Time Complexity: O(n)
-     * Space Complexity: O(1)
+     * Space Complexity: O(log n)
      *
      * The `getDepth` function calculates the depth between two nodes in a binary tree.
-     * @param {BTNRep<K, V, NODE> | R} dist - The `dist` parameter in the `getDepth`
+     * @param {BTNRep<K, V, BinaryTreeNode<K, V>>} dist - The `dist` parameter in the `getDepth`
      * function represents the node or entry in a binary tree map, or a reference to a node in the tree.
      * It is the target node for which you want to calculate the depth from the `startNode` node.
-     * @param {BTNRep<K, V, NODE> | R} startNode - The `startNode` parameter in the
+     * @param {BTNRep<K, V, BinaryTreeNode<K, V>>} startNode - The `startNode` parameter in the
      * `getDepth` function represents the starting point from which you want to calculate the depth of a
      * given node or entry in a binary tree. If no specific starting point is provided, the default value
      * for `startNode` is set to the root of the binary
@@ -442,14 +491,14 @@ export declare class BinaryTree<K = any, V = any, R = object, NODE extends Binar
      * `startNode` node in a binary tree. If the `dist` node is not found in the path to the `startNode`
      * node, it returns the depth of the `dist` node from the root of the tree.
      */
-    getDepth(dist: BTNRep<K, V, NODE> | R, startNode?: BTNRep<K, V, NODE> | R): number;
+    getDepth(dist: BTNRep<K, V, BinaryTreeNode<K, V>>, startNode?: BTNRep<K, V, BinaryTreeNode<K, V>>): number;
     /**
      * Time Complexity: O(n)
-     * Space Complexity: O(1)
+     * Space Complexity: O(log n)
      *
      * The `getHeight` function calculates the maximum height of a binary tree using either a recursive
      * or iterative approach in TypeScript.
-     * @param {BTNRep<K, V, NODE> | R} startNode - The `startNode` parameter is the starting
+     * @param {BTNRep<K, V, BinaryTreeNode<K, V>>} startNode - The `startNode` parameter is the starting
      * point from which the height of the binary tree will be calculated. It can be a node in the binary
      * tree or a reference to the root of the tree. If not provided, it defaults to the root of the
      * binary tree data structure.
@@ -460,14 +509,14 @@ export declare class BinaryTree<K = any, V = any, R = object, NODE extends Binar
      * root node. The height is calculated based on the maximum depth of the tree, considering either a
      * recursive approach or an iterative approach depending on the `iterationType` parameter.
      */
-    getHeight(startNode?: BTNRep<K, V, NODE> | R, iterationType?: IterationType): number;
+    getHeight(startNode?: BTNRep<K, V, BinaryTreeNode<K, V>>, iterationType?: IterationType): number;
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(log n)
      *
      * The `getMinHeight` function calculates the minimum height of a binary tree using either a
      * recursive or iterative approach in TypeScript.
-     * @param {BTNRep<K, V, NODE> | R} startNode - The `startNode` parameter in the
+     * @param {BTNRep<K, V, BinaryTreeNode<K, V>>} startNode - The `startNode` parameter in the
      * `getMinHeight` function represents the starting node from which the minimum height of the binary
      * tree will be calculated. It is either a node in the binary tree or a reference to the root of the
      * tree. If not provided, the default value is the root
@@ -479,7 +528,7 @@ export declare class BinaryTree<K = any, V = any, R = object, NODE extends Binar
      * leaf node in the tree. The method uses either a recursive approach or an iterative approach (using
      * a stack) based on the `iterationType` parameter.
      */
-    getMinHeight(startNode?: BTNRep<K, V, NODE> | R, iterationType?: IterationType): number;
+    getMinHeight(startNode?: BTNRep<K, V, BinaryTreeNode<K, V>>, iterationType?: IterationType): number;
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(log n)
@@ -490,7 +539,7 @@ export declare class BinaryTree<K = any, V = any, R = object, NODE extends Binar
      * the path to the root. It is expected to be a function that takes a node as an argument and returns
      * a value based on that node. The return type of the callback function is determined by the generic
      * type `C
-     * @param {BTNRep<K, V, NODE> | R} beginNode - The `beginNode` parameter in the
+     * @param {BTNRep<K, V, BinaryTreeNode<K, V>>} beginNode - The `beginNode` parameter in the
      * `getPathToRoot` function can be either a key, a node, an entry, or any other value of type `R`.
      * @param [isReverse=true] - The `isReverse` parameter in the `getPathToRoot` function determines
      * whether the resulting path from the given `beginNode` to the root should be in reverse order or
@@ -500,17 +549,17 @@ export declare class BinaryTree<K = any, V = any, R = object, NODE extends Binar
      * array is either in reverse order or in the original order based on the value of the `isReverse`
      * parameter.
      */
-    getPathToRoot<C extends NodeCallback<OptNodeOrNull<NODE>>>(beginNode: BTNRep<K, V, NODE> | R, callback?: C, isReverse?: boolean): ReturnType<C>[];
+    getPathToRoot<C extends NodeCallback<OptNodeOrNull<BinaryTreeNode<K, V>>>>(beginNode: BTNRep<K, V, BinaryTreeNode<K, V>>, callback?: C, isReverse?: boolean): ReturnType<C>[];
     /**
      * Time Complexity: O(log n)
-     * Space Complexity: O(1)
+     * Space Complexity: O(log n)
      *
      * The function `getLeftMost` retrieves the leftmost node in a binary tree using either recursive or
      * tail-recursive iteration.
      * @param {C} callback - The `callback` parameter is a function that will be called with the leftmost
      * node of a binary tree or with `undefined` if the tree is empty. It is provided with a default
      * value of `_DEFAULT_NODE_CALLBACK` if not specified.
-     * @param {BTNRep<K, V, NODE> | R} startNode - The `startNode` parameter in the
+     * @param {BTNRep<K, V, BinaryTreeNode<K, V>>} startNode - The `startNode` parameter in the
      * `getLeftMost` function represents the starting point for finding the leftmost node in a binary
      * tree. It can be either a key, a node, or an entry in the binary tree structure. If no specific
      * starting point is provided, the function will default
@@ -522,18 +571,18 @@ export declare class BinaryTree<K = any, V = any, R = object, NODE extends Binar
      * `NIL`, it returns the result of the callback function applied to `undefined`. If the `startNode`
      * node is not a real node, it returns the result of the callback
      */
-    getLeftMost<C extends NodeCallback<OptNodeOrNull<NODE>>>(callback?: C, startNode?: BTNRep<K, V, NODE> | R, iterationType?: IterationType): ReturnType<C>;
+    getLeftMost<C extends NodeCallback<OptNodeOrNull<BinaryTreeNode<K, V>>>>(callback?: C, startNode?: BTNRep<K, V, BinaryTreeNode<K, V>>, iterationType?: IterationType): ReturnType<C>;
     /**
      * Time Complexity: O(log n)
-     * Space Complexity: O(1)
+     * Space Complexity: O(log n)
      *
      * The function `getRightMost` retrieves the rightmost node in a binary tree using either recursive
      * or iterative traversal methods.
      * @param {C} callback - The `callback` parameter is a function that will be called with the result
-     * of finding the rightmost node in a binary tree. It is of type `NodeCallback<OptNodeOrNull<NODE>>`,
+     * of finding the rightmost node in a binary tree. It is of type `NodeCallback<OptNodeOrNull<BinaryTreeNode<K, V>>>`,
      * which means it is a callback function that can accept either an optional binary tree node or null
      * as
-     * @param {BTNRep<K, V, NODE> | R} startNode - The `startNode` parameter in the
+     * @param {BTNRep<K, V, BinaryTreeNode<K, V>>} startNode - The `startNode` parameter in the
      * `getRightMost` function represents the starting point for finding the rightmost node in a binary
      * tree. It can be either a key, a node, or an entry in the binary tree structure. If no specific
      * starting point is provided, the function will default
@@ -545,39 +594,39 @@ export declare class BinaryTree<K = any, V = any, R = object, NODE extends Binar
      * the binary tree structure, determined based on the specified iteration type ('RECURSIVE' or
      * other).
      */
-    getRightMost<C extends NodeCallback<OptNodeOrNull<NODE>>>(callback?: C, startNode?: BTNRep<K, V, NODE> | R, iterationType?: IterationType): ReturnType<C>;
+    getRightMost<C extends NodeCallback<OptNodeOrNull<BinaryTreeNode<K, V>>>>(callback?: C, startNode?: BTNRep<K, V, BinaryTreeNode<K, V>>, iterationType?: IterationType): ReturnType<C>;
     /**
      * Time Complexity: O(log n)
-     * Space Complexity: O(1)
+     * Space Complexity: O(log n)
      *
      * The function `getPredecessor` in TypeScript returns the predecessor node of a given node in a
      * binary tree.
-     * @param {NODE} node - The `getPredecessor` function you provided seems to be attempting to find the
+     * @param {BinaryTreeNode<K, V>} node - The `getPredecessor` function you provided seems to be attempting to find the
      * predecessor of a given node in a binary tree. However, there seems to be a logical issue in the
      * while loop condition that might cause an infinite loop.
-     * @returns The `getPredecessor` function returns the predecessor node of the input `NODE` parameter.
+     * @returns The `getPredecessor` function returns the predecessor node of the input `BinaryTreeNode<K, V>` parameter.
      * If the left child of the input node exists, it traverses to the rightmost node of the left subtree
      * to find the predecessor. If the left child does not exist, it returns the input node itself.
      */
-    getPredecessor(node: NODE): NODE;
+    getPredecessor(node: BinaryTreeNode<K, V>): BinaryTreeNode<K, V>;
     /**
      * Time Complexity: O(log n)
-     * Space Complexity: O(1)
+     * Space Complexity: O(log n)
      *
      * The function `getSuccessor` in TypeScript returns the next node in an in-order traversal of a
      * binary tree.
-     * @param {K | NODE | null} [x] - The `getSuccessor` function takes a parameter `x`, which can be of
-     * type `K`, `NODE`, or `null`.
+     * @param {K | BinaryTreeNode<K, V> | null} [x] - The `getSuccessor` function takes a parameter `x`, which can be of
+     * type `K`, `BinaryTreeNode<K, V>`, or `null`.
      * @returns The `getSuccessor` function returns the successor node of the input node `x`. If `x` has
      * a right child, the function returns the leftmost node in the right subtree of `x`. If `x` does not
      * have a right child, the function traverses up the parent nodes until it finds a node that is not
      * the right child of its parent, and returns that node
      */
-    getSuccessor(x?: K | NODE | null): OptNodeOrNull<NODE>;
-    dfs<C extends NodeCallback<NODE>>(callback?: C, pattern?: DFSOrderPattern, startNode?: BTNRep<K, V, NODE> | R, iterationType?: IterationType): ReturnType<C>[];
-    dfs<C extends NodeCallback<NODE | null>>(callback?: C, pattern?: DFSOrderPattern, startNode?: BTNRep<K, V, NODE> | R, iterationType?: IterationType, includeNull?: boolean): ReturnType<C>[];
-    bfs<C extends NodeCallback<NODE>>(callback?: C, startNode?: BTNRep<K, V, NODE> | R, iterationType?: IterationType, includeNull?: false): ReturnType<C>[];
-    bfs<C extends NodeCallback<NODE | null>>(callback?: C, startNode?: BTNRep<K, V, NODE> | R, iterationType?: IterationType, includeNull?: true): ReturnType<C>[];
+    getSuccessor(x?: K | BinaryTreeNode<K, V> | null): OptNodeOrNull<BinaryTreeNode<K, V>>;
+    dfs<C extends NodeCallback<BinaryTreeNode<K, V>>>(callback?: C, pattern?: DFSOrderPattern, startNode?: BTNRep<K, V, BinaryTreeNode<K, V>>, iterationType?: IterationType): ReturnType<C>[];
+    dfs<C extends NodeCallback<BinaryTreeNode<K, V> | null>>(callback?: C, pattern?: DFSOrderPattern, startNode?: BTNRep<K, V, BinaryTreeNode<K, V>>, iterationType?: IterationType, includeNull?: boolean): ReturnType<C>[];
+    bfs<C extends NodeCallback<BinaryTreeNode<K, V>>>(callback?: C, startNode?: BTNRep<K, V, BinaryTreeNode<K, V>>, iterationType?: IterationType, includeNull?: false): ReturnType<C>[];
+    bfs<C extends NodeCallback<BinaryTreeNode<K, V> | null>>(callback?: C, startNode?: BTNRep<K, V, BinaryTreeNode<K, V>>, iterationType?: IterationType, includeNull?: true): ReturnType<C>[];
     /**
      * Time complexity: O(n)
      * Space complexity: O(n)
@@ -586,7 +635,7 @@ export declare class BinaryTree<K = any, V = any, R = object, NODE extends Binar
      * structure based on a specified callback and iteration type.
      * @param {C} callback - The `callback` parameter is a function that will be called on each leaf node
      * in the binary tree. It is optional and defaults to a default callback function if not provided.
-     * @param {BTNRep<K, V, NODE> | R} startNode - The `startNode` parameter in the `leaves`
+     * @param {BTNRep<K, V, BinaryTreeNode<K, V>>} startNode - The `startNode` parameter in the `leaves`
      * method is used to specify the starting point for finding and processing the leaves of a binary
      * tree. It can be provided as either a key, a node, or an entry in the binary tree structure. If not
      * explicitly provided, the default value
@@ -596,9 +645,9 @@ export declare class BinaryTree<K = any, V = any, R = object, NODE extends Binar
      * @returns The `leaves` method returns an array of values that are the result of applying the
      * provided callback function to each leaf node in the binary tree.
      */
-    leaves<C extends NodeCallback<NODE | null>>(callback?: C, startNode?: BTNRep<K, V, NODE> | R, iterationType?: IterationType): ReturnType<C>[];
-    listLevels<C extends NodeCallback<NODE>>(callback?: C, startNode?: BTNRep<K, V, NODE> | R, iterationType?: IterationType, includeNull?: false): ReturnType<C>[][];
-    listLevels<C extends NodeCallback<NODE | null>>(callback?: C, startNode?: BTNRep<K, V, NODE> | R, iterationType?: IterationType, includeNull?: true): ReturnType<C>[][];
+    leaves<C extends NodeCallback<BinaryTreeNode<K, V> | null>>(callback?: C, startNode?: BTNRep<K, V, BinaryTreeNode<K, V>>, iterationType?: IterationType): ReturnType<C>[];
+    listLevels<C extends NodeCallback<BinaryTreeNode<K, V>>>(callback?: C, startNode?: BTNRep<K, V, BinaryTreeNode<K, V>>, iterationType?: IterationType, includeNull?: false): ReturnType<C>[][];
+    listLevels<C extends NodeCallback<BinaryTreeNode<K, V> | null>>(callback?: C, startNode?: BTNRep<K, V, BinaryTreeNode<K, V>>, iterationType?: IterationType, includeNull?: true): ReturnType<C>[][];
     /**
      * Time complexity: O(n)
      * Space complexity: O(n)
@@ -607,11 +656,11 @@ export declare class BinaryTree<K = any, V = any, R = object, NODE extends Binar
      * Morris Traversal algorithm with different order patterns.
      * @param {C} callback - The `callback` parameter in the `morris` function is a function that will be
      * called on each node in the binary tree during the traversal. It is of type `C`, which extends the
-     * `NodeCallback<NODE>` type. The default value for `callback` is `this._DEFAULT
+     * `NodeCallback<BinaryTreeNode<K, V>>` type. The default value for `callback` is `this._DEFAULT
      * @param {DFSOrderPattern} [pattern=IN] - The `pattern` parameter in the `morris` function specifies
      * the type of Depth-First Search (DFS) order pattern to traverse the binary tree. The possible
      * values for the `pattern` parameter are:
-     * @param {BTNRep<K, V, NODE> | R} startNode - The `startNode` parameter in the `morris`
+     * @param {BTNRep<K, V, BinaryTreeNode<K, V>>} startNode - The `startNode` parameter in the `morris`
      * function is the starting point for the Morris traversal algorithm. It represents the root node of
      * the binary tree or the node from which the traversal should begin. It can be provided as either a
      * key, a node, an entry, or a reference
@@ -619,7 +668,7 @@ export declare class BinaryTree<K = any, V = any, R = object, NODE extends Binar
      * provided callback function to each node in the binary tree in the specified order pattern (IN,
      * PRE, or POST).
      */
-    morris<C extends NodeCallback<NODE>>(callback?: C, pattern?: DFSOrderPattern, startNode?: BTNRep<K, V, NODE> | R): ReturnType<C>[];
+    morris<C extends NodeCallback<BinaryTreeNode<K, V>>>(callback?: C, pattern?: DFSOrderPattern, startNode?: BTNRep<K, V, BinaryTreeNode<K, V>>): ReturnType<C>[];
     /**
      * Time complexity: O(n)
      * Space complexity: O(n)
@@ -631,7 +680,8 @@ export declare class BinaryTree<K = any, V = any, R = object, NODE extends Binar
      * original tree using breadth-first search (bfs), and adds the nodes to the new tree. If a node in
      * the original tree is null, a null node is added to the cloned tree. If a node
      */
-    clone(): this;
+    clone(): BinaryTree<K, V, R, MK, MV, MR>;
+    protected _clone(cloned: BinaryTree<K, V, R, MK, MV, MR>): void;
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -648,7 +698,7 @@ export declare class BinaryTree<K = any, V = any, R = object, NODE extends Binar
      * @returns The `filter` method is returning a new tree that contains entries that pass the provided
      * predicate function.
      */
-    filter(predicate: EntryCallback<K, V | undefined, boolean>, thisArg?: any): this;
+    filter(predicate: EntryCallback<K, V | undefined, boolean>, thisArg?: any): BinaryTree<K, V, R, MK, MV, MR>;
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -668,14 +718,14 @@ export declare class BinaryTree<K = any, V = any, R = object, NODE extends Binar
      * @returns The `map` function is returning a new `BinaryTree` instance filled with entries that are
      * the result of applying the provided `callback` function to each entry in the original tree.
      */
-    map<MK, MV, MR>(callback: EntryCallback<K, V | undefined, [MK, MV]>, options?: BinaryTreeOptions<MK, MV, MR>, thisArg?: any): BinaryTree<MK, MV, MR, BinaryTreeNode<MK, MV, BinaryTreeNodeNested<MK, MV>>>;
+    map(callback: EntryCallback<K, V | undefined, [MK, MV]>, options?: BinaryTreeOptions<MK, MV, MR>, thisArg?: any): BinaryTree<MK, MV, MR>;
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
      *
      * The function `toVisual` in TypeScript overrides the visual representation of a binary tree with
      * customizable options for displaying undefined, null, and sentinel nodes.
-     * @param {BTNRep<K, V, NODE> | R} startNode - The `startNode` parameter in the
+     * @param {BTNRep<K, V, BinaryTreeNode<K, V>>} startNode - The `startNode` parameter in the
      * `toVisual` method is used to specify the starting point for visualizing the binary tree structure.
      * It can be a node, key, entry, or the root of the tree. If no specific starting point is provided,
      * the default is set to the root
@@ -687,7 +737,7 @@ export declare class BinaryTree<K = any, V = any, R = object, NODE extends Binar
      * the lines to the output string. The final output string contains the visual representation of the
      * binary tree with the specified options.
      */
-    toVisual(startNode?: BTNRep<K, V, NODE> | R, options?: BinaryTreePrintOptions): string;
+    toVisual(startNode?: BTNRep<K, V, BinaryTreeNode<K, V>>, options?: BinaryTreePrintOptions): string;
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -698,28 +748,31 @@ export declare class BinaryTree<K = any, V = any, R = object, NODE extends Binar
      * printing options for the binary tree. It is an optional parameter that allows you to customize how
      * the binary tree is printed, such as choosing between different traversal orders or formatting
      * options.
-     * @param {BTNRep<K, V, NODE> | R} startNode - The `startNode` parameter in the
+     * @param {BTNRep<K, V, BinaryTreeNode<K, V>>} startNode - The `startNode` parameter in the
      * `override print` method is used to specify the starting point for printing the binary tree. It can
      * be either a key, a node, an entry, or the root of the tree. If no specific starting point is
      * provided, the default value is set to
      */
-    print(options?: BinaryTreePrintOptions, startNode?: BTNRep<K, V, NODE> | R): void;
+    print(options?: BinaryTreePrintOptions, startNode?: BTNRep<K, V, BinaryTreeNode<K, V>>): void;
     /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     *
      * The function `keyValueNodeEntryRawToNodeAndValue` converts various input types into a node object
      * or returns null.
-     * @param {BTNRep<K, V, NODE> | R} keyNodeEntryOrRaw - The
-     * `keyValueNodeEntryRawToNodeAndValue` function takes in a parameter `keyNodeEntryOrRaw`, which
-     * can be of type `BTNRep<K, V, NODE>` or `R`. This parameter represents either a key, a
+     * @param {BTNRep<K, V, BinaryTreeNode<K, V>>} keyNodeOrEntry - The
+     * `keyValueNodeEntryRawToNodeAndValue` function takes in a parameter `keyNodeOrEntry`, which
+     * can be of type `BTNRep<K, V, BinaryTreeNode<K, V>>` or `R`. This parameter represents either a key, a
      * node, an entry
      * @param {V} [value] - The `value` parameter in the `keyValueNodeEntryRawToNodeAndValue` function is
      * an optional parameter of type `V`. It represents the value associated with the key in the node
      * being created. If a `value` is provided, it will be used when creating the node. If
      * @returns The `keyValueNodeEntryRawToNodeAndValue` function returns an optional node
-     * (`OptNodeOrNull<NODE>`) based on the input parameters provided. The function checks the type of the
-     * input parameter (`keyNodeEntryOrRaw`) and processes it accordingly to return a node or null
+     * (`OptNodeOrNull<BinaryTreeNode<K, V>>`) based on the input parameters provided. The function checks the type of the
+     * input parameter (`keyNodeOrEntry`) and processes it accordingly to return a node or null
      * value.
      */
-    protected _keyValueNodeEntryRawToNodeAndValue(keyNodeEntryOrRaw: BTNRep<K, V, NODE> | R, value?: V): [OptNodeOrNull<NODE>, V | undefined];
+    protected _keyValueNodeOrEntryToNodeAndValue(keyNodeOrEntry: BTNRep<K, V, BinaryTreeNode<K, V>>, value?: V): [OptNodeOrNull<BinaryTreeNode<K, V>>, V | undefined];
     /**
      * Time complexity: O(n)
      * Space complexity: O(n)
@@ -728,11 +781,11 @@ export declare class BinaryTree<K = any, V = any, R = object, NODE extends Binar
      * the specified order pattern and callback function.
      * @param {C} callback - The `callback` parameter in the `_dfs` method is a function that will be
      * called on each node visited during the depth-first search traversal. It is of type `C`, which
-     * extends `NodeCallback<OptNodeOrNull<NODE>>`. The default value for this parameter is `this._DEFAULT
+     * extends `NodeCallback<OptNodeOrNull<BinaryTreeNode<K, V>>>`. The default value for this parameter is `this._DEFAULT
      * @param {DFSOrderPattern} [pattern=IN] - The `pattern` parameter in the `_dfs` method specifies the
      * order in which the nodes are visited during the Depth-First Search traversal. It can have one of
      * the following values:
-     * @param {BTNRep<K, V, NODE> | R} startNode - The `startNode` parameter in the `_dfs`
+     * @param {BTNRep<K, V, BinaryTreeNode<K, V>>} startNode - The `startNode` parameter in the `_dfs`
      * method is used to specify the starting point for the depth-first search traversal in a binary
      * tree. It can be provided as either a `BTNRep` object or a reference to the root node
      * of the tree. If no specific
@@ -762,7 +815,7 @@ export declare class BinaryTree<K = any, V = any, R = object, NODE extends Binar
      * @returns The function `_dfs` returns an array of the return type of the callback function provided
      * as input.
      */
-    protected _dfs<C extends NodeCallback<OptNodeOrNull<NODE>>>(callback?: C, pattern?: DFSOrderPattern, startNode?: BTNRep<K, V, NODE> | R, iterationType?: IterationType, includeNull?: boolean, shouldVisitLeft?: (node: OptNodeOrNull<NODE>) => boolean, shouldVisitRight?: (node: OptNodeOrNull<NODE>) => boolean, shouldVisitRoot?: (node: OptNodeOrNull<NODE>) => boolean, shouldProcessRoot?: (node: OptNodeOrNull<NODE>) => boolean): ReturnType<C>[];
+    protected _dfs<C extends NodeCallback<OptNodeOrNull<BinaryTreeNode<K, V>>>>(callback?: C, pattern?: DFSOrderPattern, startNode?: BTNRep<K, V, BinaryTreeNode<K, V>>, iterationType?: IterationType, includeNull?: boolean, shouldVisitLeft?: (node: OptNodeOrNull<BinaryTreeNode<K, V>>) => boolean, shouldVisitRight?: (node: OptNodeOrNull<BinaryTreeNode<K, V>>) => boolean, shouldVisitRoot?: (node: OptNodeOrNull<BinaryTreeNode<K, V>>) => boolean, shouldProcessRoot?: (node: OptNodeOrNull<BinaryTreeNode<K, V>>) => boolean): ReturnType<C>[];
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -778,7 +831,7 @@ export declare class BinaryTree<K = any, V = any, R = object, NODE extends Binar
      * the `iterationType` property. If the `iterationType` is set to 'ITERATIVE', the method uses a
      * stack to perform an in-order traversal of the tree. If the `iterationType` is not 'ITERATIVE
      */
-    protected _getIterator(node?: OptNodeOrNull<NODE>): IterableIterator<[K, V | undefined]>;
+    protected _getIterator(node?: OptNodeOrNull<BinaryTreeNode<K, V>>): IterableIterator<[K, V | undefined]>;
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -794,62 +847,62 @@ export declare class BinaryTree<K = any, V = any, R = object, NODE extends Binar
      * information about how to display a node in a binary tree. The `NodeDisplayLayout` consists of four
      * elements:
      */
-    protected _displayAux(node: OptNodeOrNull<NODE>, options: BinaryTreePrintOptions): NodeDisplayLayout;
-    protected _DEFAULT_NODE_CALLBACK: (node: OptNodeOrNull<NODE>) => K | undefined;
+    protected _displayAux(node: OptNodeOrNull<BinaryTreeNode<K, V>>, options: BinaryTreePrintOptions): NodeDisplayLayout;
+    protected _DEFAULT_NODE_CALLBACK: (node: OptNodeOrNull<BinaryTreeNode<K, V>>) => K | undefined;
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
      *
      * The _swapProperties function swaps key and value properties between two nodes in a binary tree.
-     * @param {BTNRep<K, V, NODE> | R} srcNode - The `srcNode` parameter in the
+     * @param {BTNRep<K, V, BinaryTreeNode<K, V>>} srcNode - The `srcNode` parameter in the
      * `_swapProperties` method can be either a BTNRep object containing key and value
      * properties, or it can be of type R.
-     * @param {BTNRep<K, V, NODE> | R} destNode - The `destNode` parameter in the
+     * @param {BTNRep<K, V, BinaryTreeNode<K, V>>} destNode - The `destNode` parameter in the
      * `_swapProperties` method represents the node or entry where the properties will be swapped with
-     * the `srcNode`. It can be of type `BTNRep<K, V, NODE>` or `R`. The method ensures that
+     * the `srcNode`. It can be of type `BTNRep<K, V, BinaryTreeNode<K, V>>` or `R`. The method ensures that
      * both `srcNode
      * @returns The `_swapProperties` method returns either the `destNode` with its key and value swapped
      * with the `srcNode`, or `undefined` if either `srcNode` or `destNode` is falsy.
      */
-    protected _swapProperties(srcNode: BTNRep<K, V, NODE> | R, destNode: BTNRep<K, V, NODE> | R): NODE | undefined;
+    protected _swapProperties(srcNode: BTNRep<K, V, BinaryTreeNode<K, V>>, destNode: BTNRep<K, V, BinaryTreeNode<K, V>>): BinaryTreeNode<K, V> | undefined;
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
      *
      * The _replaceNode function replaces an old node with a new node in a binary tree structure.
-     * @param {NODE} oldNode - The `oldNode` parameter represents the node that you want to replace in a
+     * @param {BinaryTreeNode<K, V>} oldNode - The `oldNode` parameter represents the node that you want to replace in a
      * tree data structure.
-     * @param {NODE} newNode - The `newNode` parameter in the `_replaceNode` function represents the node
+     * @param {BinaryTreeNode<K, V>} newNode - The `newNode` parameter in the `_replaceNode` function represents the node
      * that will replace the `oldNode` in a tree data structure. This function is responsible for
      * updating the parent, left child, right child, and root (if necessary) references when replacing a
      * node in the tree.
      * @returns The method `_replaceNode` is returning the `newNode` that was passed as a parameter after
      * replacing the `oldNode` with it in the binary tree structure.
      */
-    protected _replaceNode(oldNode: NODE, newNode: NODE): NODE;
+    protected _replaceNode(oldNode: BinaryTreeNode<K, V>, newNode: BinaryTreeNode<K, V>): BinaryTreeNode<K, V>;
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
      *
      * The function _setRoot sets the root node of a data structure while updating the parent reference
      * of the previous root node.
-     * @param v - The parameter `v` in the `_setRoot` method is of type `OptNodeOrNull<NODE>`, which means
-     * it can either be an optional `NODE` type or `null`.
+     * @param v - The parameter `v` in the `_setRoot` method is of type `OptNodeOrNull<BinaryTreeNode<K, V>>`, which means
+     * it can either be an optional `BinaryTreeNode<K, V>` type or `null`.
      */
-    protected _setRoot(v: OptNodeOrNull<NODE>): void;
+    protected _setRoot(v: OptNodeOrNull<BinaryTreeNode<K, V>>): void;
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
      *
      * The function `_ensurePredicate` in TypeScript ensures that the input is converted into a valid
      * predicate function for a binary tree node.
-     * @param {BTNRep<K, V, NODE> | R | NodePredicate<NODE>} keyNodeEntryRawOrPredicate - The
+     * @param {BTNRep<K, V, BinaryTreeNode<K, V>> | NodePredicate<BinaryTreeNode<K, V>>} keyNodeEntryOrPredicate - The
      * `_ensurePredicate` method in the provided code snippet is responsible for ensuring that the input
-     * parameter `keyNodeEntryRawOrPredicate` is transformed into a valid predicate function that can be
+     * parameter `keyNodeEntryOrPredicate` is transformed into a valid predicate function that can be
      * used for filtering nodes in a binary tree.
-     * @returns A NodePredicate<NODE> function is being returned.
+     * @returns A NodePredicate<BinaryTreeNode<K, V>> function is being returned.
      */
-    protected _ensurePredicate(keyNodeEntryRawOrPredicate: BTNRep<K, V, NODE> | R | NodePredicate<NODE>): NodePredicate<NODE>;
+    protected _ensurePredicate(keyNodeEntryOrPredicate: BTNRep<K, V, BinaryTreeNode<K, V>> | NodePredicate<BinaryTreeNode<K, V>>): NodePredicate<BinaryTreeNode<K, V>>;
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -857,26 +910,26 @@ export declare class BinaryTree<K = any, V = any, R = object, NODE extends Binar
      * The function `_isPredicate` checks if a given parameter is a function.
      * @param {any} p - The parameter `p` is a variable of type `any`, which means it can hold any type
      * of value. In this context, the function `_isPredicate` is checking if `p` is a function that
-     * satisfies the type `NodePredicate<NODE>`.
+     * satisfies the type `NodePredicate<BinaryTreeNode<K, V>>`.
      * @returns The function is checking if the input `p` is a function and returning a boolean value
      * based on that check. If `p` is a function, it will return `true`, indicating that `p` is a
      * predicate function for a binary tree node. If `p` is not a function, it will return `false`.
      */
-    protected _isPredicate(p: any): p is NodePredicate<NODE>;
+    protected _isPredicate(p: any): p is NodePredicate<BinaryTreeNode<K, V>>;
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
      *
      * The function `_extractKey` in TypeScript returns the key from a given input, which can be a node,
      * entry, raw data, or null/undefined.
-     * @param {BTNRep<K, V, NODE> | R} keyNodeEntryOrRaw - The `_extractKey` method you provided is a
-     * TypeScript method that takes in a parameter `keyNodeEntryOrRaw` of type `BTNRep<K, V, NODE> | R`,
-     * where `BTNRep` is a generic type with keys `K`, `V`, and `NODE`, and `
-     * @returns The `_extractKey` method returns the key value extracted from the `keyNodeEntryOrRaw`
+     * @param {BTNRep<K, V, BinaryTreeNode<K, V>>} keyNodeOrEntry - The `_extractKey` method you provided is a
+     * TypeScript method that takes in a parameter `keyNodeOrEntry` of type `BTNRep<K, V, BinaryTreeNode<K, V>>`,
+     * where `BTNRep` is a generic type with keys `K`, `V`, and `BinaryTreeNode<K, V>`, and `
+     * @returns The `_extractKey` method returns the key value extracted from the `keyNodeOrEntry`
      * parameter. The return value can be a key value of type `K`, `null`, or `undefined`, depending on
      * the conditions checked in the method.
      */
-    protected _extractKey(keyNodeEntryOrRaw: BTNRep<K, V, NODE> | R): K | null | undefined;
+    protected _extractKey(keyNodeOrEntry: BTNRep<K, V, BinaryTreeNode<K, V>>): K | null | undefined;
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)