data-structure-typed 1.38.5 → 1.38.7

package/dist/mjs/data-structures/binary-tree/binary-tree.js

@@ -14,7 +14,7 @@ const queue_1 = require("../queue");
 /**
  * Represents a node in a binary tree.
  * @template V - The type of data stored in the node.
- * @template FAMILY - The type of the family relationship in the binary tree.
+ * @template N - The type of the family relationship in the binary tree.
  */
 class BinaryTreeNode {
     /**
@@ -47,7 +47,7 @@ class BinaryTreeNode {
     }
     /**
      * Set the left child node.
-     * @param {FAMILY | null | undefined} v - The left child node.
+     * @param {N | null | undefined} v - The left child node.
      */
     set left(v) {
         if (v) {
@@ -64,7 +64,7 @@ class BinaryTreeNode {
     }
     /**
      * Set the right child node.
-     * @param {FAMILY | null | undefined} v - The right child node.
+     * @param {N | null | undefined} v - The right child node.
      */
     set right(v) {
         if (v) {
@@ -78,35 +78,16 @@ class BinaryTreeNode {
      */
     get familyPosition() {
         const that = this;
-        if (that.parent) {
-            if (that.parent.left === that) {
-                if (that.left || that.right) {
-                    return types_1.FamilyPosition.ROOT_LEFT;
-                }
-                else {
-                    return types_1.FamilyPosition.LEFT;
-                }
-            }
-            else if (that.parent.right === that) {
-                if (that.left || that.right) {
-                    return types_1.FamilyPosition.ROOT_RIGHT;
-                }
-                else {
-                    return types_1.FamilyPosition.RIGHT;
-                }
-            }
-            else {
-                return types_1.FamilyPosition.MAL_NODE;
-            }
+        if (!this.parent) {
+            return this.left || this.right ? types_1.FamilyPosition.ROOT : types_1.FamilyPosition.ISOLATED;
         }
-        else {
-            if (that.left || that.right) {
-                return types_1.FamilyPosition.ROOT;
-            }
-            else {
-                return types_1.FamilyPosition.ISOLATED;
-            }
+        if (this.parent.left === that) {
+            return this.left || this.right ? types_1.FamilyPosition.ROOT_LEFT : types_1.FamilyPosition.LEFT;
         }
+        else if (this.parent.right === that) {
+            return this.left || this.right ? types_1.FamilyPosition.ROOT_RIGHT : types_1.FamilyPosition.RIGHT;
+        }
+        return types_1.FamilyPosition.MAL_NODE;
     }
 }
 exports.BinaryTreeNode = BinaryTreeNode;
@@ -115,7 +96,6 @@ exports.BinaryTreeNode = BinaryTreeNode;
  * @template N - The type of the binary tree's nodes.
  */
 class BinaryTree {
-    _loopType = types_1.IterationType.ITERATIVE;
     /**
      * Creates a new instance of BinaryTree.
      * @param {BinaryTreeOptions} [options] - The options for the binary tree.
@@ -123,9 +103,23 @@ class BinaryTree {
     constructor(options) {
         if (options !== undefined) {
             const { iterationType = types_1.IterationType.ITERATIVE } = options;
-            this._loopType = iterationType;
+            this._iterationType = iterationType;
         }
     }
+    _iterationType = types_1.IterationType.ITERATIVE;
+    /**
+     * Get the iteration type used in the binary tree.
+     */
+    get iterationType() {
+        return this._iterationType;
+    }
+    /**
+     * Set the iteration type for the binary tree.
+     * @param {IterationType} v - The new iteration type to set.
+     */
+    set iterationType(v) {
+        this._iterationType = v;
+    }
     _root = null;
     /**
      * Get the root node of the binary tree.
@@ -140,23 +134,10 @@ class BinaryTree {
     get size() {
         return this._size;
     }
-    /**
-     * Get the iteration type used in the binary tree.
-     */
-    get iterationType() {
-        return this._loopType;
-    }
-    /**
-     * Set the iteration type for the binary tree.
-     * @param {IterationType} v - The new iteration type to set.
-     */
-    set iterationType(v) {
-        this._loopType = v;
-    }
     /**
      * Creates a new instance of BinaryTreeNode with the given key and value.
      * @param {BinaryTreeNodeKey} key - The key for the new node.
-     * @param {N['val']} val - The value for the new node.
+     * @param {V} val - The value for the new node.
      * @returns {N} - The newly created BinaryTreeNode.
      */
     createNode(key, val) {
@@ -179,7 +160,7 @@ class BinaryTree {
     /**
      * Add a node with the given key and value to the binary tree.
      * @param {BinaryTreeNodeKey | N | null} keyOrNode - The key or node to add to the binary tree.
-     * @param {N['val']} val - The value for the new node (optional).
+     * @param {V} val - The value for the new node (optional).
      * @returns {N | null | undefined} - The inserted node, or null if nothing was inserted, or undefined if the operation failed.
      */
     add(keyOrNode, val) {
@@ -216,7 +197,8 @@ class BinaryTree {
         else {
             return;
         }
-        const existNode = keyOrNode ? this.get(keyOrNode, this._defaultCallbackByKey) : undefined;
+        const key = typeof keyOrNode === 'number' ? keyOrNode : keyOrNode ? keyOrNode.key : undefined;
+        const existNode = key !== undefined ? this.get(key, this._defaultCallbackByKey) : undefined;
         if (this.root) {
             if (existNode) {
                 existNode.val = val;
@@ -243,34 +225,29 @@ class BinaryTree {
      * values, and adds them to the binary tree.
      * @param {(BinaryTreeNodeKey | null)[] | (N | null)[]} keysOrNodes - An array of BinaryTreeNodeKey or BinaryTreeNode
      * objects, or null values.
-     * @param {N['val'][]} [values] - The `values` parameter is an optional array of values (`N['val'][]`) that corresponds to
+     * @param {V[]} [values] - The `values` parameter is an optional array of values (`V[]`) that corresponds to
      * the nodes or node IDs being added. It is used to set the value of each node being added. If `values` is not provided,
      * the value of the nodes will be `undefined`.
      * @returns The function `addMany` returns an array of `N`, `null`, or `undefined` values.
      */
     addMany(keysOrNodes, values) {
         // TODO not sure addMany not be run multi times
-        const inserted = [];
-        for (let i = 0; i < keysOrNodes.length; i++) {
-            const keyOrNode = keysOrNodes[i];
+        return keysOrNodes.map((keyOrNode, i) => {
             if (keyOrNode instanceof BinaryTreeNode) {
-                inserted.push(this.add(keyOrNode.key, keyOrNode.val));
-                continue;
+                return this.add(keyOrNode.key, keyOrNode.val);
             }
             if (keyOrNode === null) {
-                inserted.push(this.add(null));
-                continue;
+                return this.add(null);
             }
             const val = values?.[i];
-            inserted.push(this.add(keyOrNode, val));
-        }
-        return inserted;
+            return this.add(keyOrNode, val);
+        });
     }
     /**
      * The `refill` function clears the binary tree and adds multiple nodes with the given IDs or nodes and optional data.
      * @param {(BinaryTreeNodeKey | N)[]} keysOrNodes - The `keysOrNodes` parameter is an array that can contain either
      * `BinaryTreeNodeKey` or `N` values.
-     * @param {N[] | Array<N['val']>} [data] - The `data` parameter is an optional array of values that will be assigned to
+     * @param {N[] | Array<V>} [data] - The `data` parameter is an optional array of values that will be assigned to
      * the nodes being added. If provided, the length of the `data` array should be equal to the length of the `keysOrNodes`
      * array. Each value in the `data` array will be assigned to the
      * @returns The method is returning a boolean value.
@@ -282,16 +259,24 @@ class BinaryTree {
     /**
      * The `delete` function removes a node from a binary search tree and returns the deleted node along
      * with the parent node that needs to be balanced.
-     * @param {N | BinaryTreeNodeKey} nodeOrKey - The `nodeOrKey` parameter can be either a node (`N`) or
      * a key (`BinaryTreeNodeKey`). If it is a key, the function will find the corresponding node in the
      * binary tree.
      * @returns an array of `BinaryTreeDeletedResult<N>` objects.
+     * @param {ReturnType<C>} identifier - The `identifier` parameter is either a
+     * `BinaryTreeNodeKey` or a generic type `N`. It represents the property of the node that we are
+     * searching for. It can be a specific key value or any other property of the node.
+     * @param callback - The `callback` parameter is a function that takes a node as input and returns a
+     * value. This value is compared with the `identifier` parameter to determine if the node should be
+     * included in the result. The `callback` parameter has a default value of
+     * `this._defaultCallbackByKey`, which
      */
-    delete(nodeOrKey) {
+    delete(identifier, callback = this._defaultCallbackByKey) {
         const bstDeletedResult = [];
         if (!this.root)
             return bstDeletedResult;
-        const curr = typeof nodeOrKey === 'number' ? this.get(nodeOrKey) : nodeOrKey;
+        if (identifier instanceof BinaryTreeNode)
+            callback = (node => node);
+        const curr = this.get(identifier, callback);
         if (!curr)
             return bstDeletedResult;
         const parent = curr?.parent ? curr.parent : null;
@@ -333,10 +318,10 @@ class BinaryTree {
     /**
      * The function `getDepth` calculates the depth of a given node in a binary tree relative to a
      * specified root node.
-     * @param {N | BinaryTreeNodeKey | null} distNode - The `distNode` parameter represents the node
+     * @param {BinaryTreeNodeKey | N | null} distNode - The `distNode` parameter represents the node
      * whose depth we want to find in the binary tree. It can be either a node object (`N`), a key value
      * of the node (`BinaryTreeNodeKey`), or `null`.
-     * @param {N | BinaryTreeNodeKey | null} beginRoot - The `beginRoot` parameter represents the
+     * @param {BinaryTreeNodeKey | N | null} beginRoot - The `beginRoot` parameter represents the
      * starting node from which we want to calculate the depth. It can be either a node object or the key
      * of a node in the binary tree. If no value is provided for `beginRoot`, it defaults to the root
      * node of the binary tree.
@@ -360,7 +345,7 @@ class BinaryTree {
     /**
      * The `getHeight` function calculates the maximum height of a binary tree using either recursive or
      * iterative approach.
-     * @param {N | BinaryTreeNodeKey | null} beginRoot - The `beginRoot` parameter represents the
+     * @param {BinaryTreeNodeKey | N | null} beginRoot - The `beginRoot` parameter represents the
      * starting node from which the height of the binary tree is calculated. It can be either a node
      * object (`N`), a key value of a node in the tree (`BinaryTreeNodeKey`), or `null` if no starting
      * node is specified. If `
@@ -469,15 +454,15 @@ class BinaryTree {
     /**
      * The function `getNodes` returns an array of nodes that match a given node property, using either
      * recursive or iterative traversal.
-     * @param {BinaryTreeNodeKey | N} nodeProperty - The `nodeProperty` parameter is either a
+     * @param {ReturnType<C>} identifier - The `identifier` parameter is either a
      * `BinaryTreeNodeKey` or a generic type `N`. It represents the property of the node that we are
      * searching for. It can be a specific key value or any other property of the node.
      * @param callback - The `callback` parameter is a function that takes a node as input and returns a
-     * value. This value is compared with the `nodeProperty` parameter to determine if the node should be
+     * value. This value is compared with the `identifier` parameter to determine if the node should be
      * included in the result. The `callback` parameter has a default value of
      * `this._defaultCallbackByKey`, which
      * @param [onlyOne=false] - A boolean value indicating whether to stop searching after finding the
-     * first node that matches the nodeProperty. If set to true, the function will return an array with
+     * first node that matches the identifier. If set to true, the function will return an array with
      * only one element (or an empty array if no matching node is found). If set to false (default), the
      * function will continue searching for all
      * @param {N | null} beginRoot - The `beginRoot` parameter is the starting node from which the
@@ -487,13 +472,15 @@ class BinaryTree {
      * traverse the binary tree. It can have two possible values:
      * @returns The function `getNodes` returns an array of nodes (`N[]`).
      */
-    getNodes(nodeProperty, callback = this._defaultCallbackByKey, onlyOne = false, beginRoot = this.root, iterationType = this.iterationType) {
+    getNodes(identifier, callback = this._defaultCallbackByKey, onlyOne = false, beginRoot = this.root, iterationType = this.iterationType) {
         if (!beginRoot)
             return [];
+        if (identifier instanceof BinaryTreeNode)
+            callback = (node => node);
         const ans = [];
         if (iterationType === types_1.IterationType.RECURSIVE) {
             const _traverse = (cur) => {
-                if (callback(cur) === nodeProperty) {
+                if (callback(cur) === identifier) {
                     ans.push(cur);
                     if (onlyOne)
                         return;
@@ -510,7 +497,7 @@ class BinaryTree {
             while (queue.size > 0) {
                 const cur = queue.shift();
                 if (cur) {
-                    if (callback(cur) === nodeProperty) {
+                    if (callback(cur) === identifier) {
                         ans.push(cur);
                         if (onlyOne)
                             return ans;
@@ -524,7 +511,7 @@ class BinaryTree {
     }
     /**
      * The function checks if a binary tree has a node with a given property or key.
-     * @param {BinaryTreeNodeKey | N} nodeProperty - The `nodeProperty` parameter is the key or value of
+     * @param {BinaryTreeNodeKey | N} identifier - The `identifier` parameter is the key or value of
      * the node that you want to find in the binary tree. It can be either a `BinaryTreeNodeKey` or a
      * generic type `N`.
      * @param callback - The `callback` parameter is a function that is used to determine whether a node
@@ -539,13 +526,15 @@ class BinaryTree {
      * performed when searching for nodes in the binary tree. It can have one of the following values:
      * @returns a boolean value.
      */
-    has(nodeProperty, callback = this._defaultCallbackByKey, beginRoot = this.root, iterationType = this.iterationType) {
+    has(identifier, callback = this._defaultCallbackByKey, beginRoot = this.root, iterationType = this.iterationType) {
+        if (identifier instanceof BinaryTreeNode)
+            callback = (node => node);
         // TODO may support finding node by value equal
-        return this.getNodes(nodeProperty, callback, true, beginRoot, iterationType).length > 0;
+        return this.getNodes(identifier, callback, true, beginRoot, iterationType).length > 0;
     }
     /**
      * The function `get` returns the first node in a binary tree that matches the given property or key.
-     * @param {BinaryTreeNodeKey | N} nodeProperty - The `nodeProperty` parameter is the key or value of
+     * @param {BinaryTreeNodeKey | N} identifier - The `identifier` parameter is the key or value of
      * the node that you want to find in the binary tree. It can be either a `BinaryTreeNodeKey` or `N`
      * type.
      * @param callback - The `callback` parameter is a function that is used to determine whether a node
@@ -558,9 +547,11 @@ class BinaryTree {
      * performed when searching for a node in the binary tree. It can have one of the following values:
      * @returns either the found node (of type N) or null if no node is found.
      */
-    get(nodeProperty, callback = this._defaultCallbackByKey, beginRoot = this.root, iterationType = this.iterationType) {
+    get(identifier, callback = this._defaultCallbackByKey, beginRoot = this.root, iterationType = this.iterationType) {
+        if (identifier instanceof BinaryTreeNode)
+            callback = (node => node);
         // TODO may support finding node by value equal
-        return this.getNodes(nodeProperty, callback, true, beginRoot, iterationType)[0] ?? null;
+        return this.getNodes(identifier, callback, true, beginRoot, iterationType)[0] ?? null;
     }
     /**
      * The function `getPathToRoot` returns an array of nodes starting from a given node and traversing
@@ -587,7 +578,7 @@ class BinaryTree {
     /**
      * The function `getLeftMost` returns the leftmost node in a binary tree, either using recursive or
      * iterative traversal.
-     * @param {N | BinaryTreeNodeKey | null} beginRoot - The `beginRoot` parameter is the starting point
+     * @param {BinaryTreeNodeKey | N | null} beginRoot - The `beginRoot` parameter is the starting point
      * for finding the leftmost node in a binary tree. It can be either a node object (`N`), a key value
      * of a node (`BinaryTreeNodeKey`), or `null` if the tree is empty.
      * @param iterationType - The `iterationType` parameter is used to determine the type of iteration to
@@ -711,7 +702,7 @@ class BinaryTree {
      * subtree traversal. It takes a single argument, which is the current node being traversed, and
      * returns a value. The return values from each callback invocation will be collected and returned as
      * an array.
-     * @param {N | BinaryTreeNodeKey | null} beginRoot - The `beginRoot` parameter is the starting point
+     * @param {BinaryTreeNodeKey | N | null} beginRoot - The `beginRoot` parameter is the starting point
      * for traversing the subtree. It can be either a node object, a key value of a node, or `null` to
      * start from the root of the tree.
      * @param iterationType - The `iterationType` parameter determines the type of traversal to be
@@ -835,7 +826,7 @@ class BinaryTree {
      * breadth-first search. It takes a node of type `N` as its argument and returns a value of type
      * `BFSCallbackReturn<N>`. The default value for this parameter is `this._defaultCallbackByKey
      * @param {boolean} [withLevel=false] - The `withLevel` parameter is a boolean flag that determines
-     * whether or not to include the level of each node in the callback function. If `withLevel` is set
+     * whether to include the level of each node in the callback function. If `withLevel` is set
      * to `true`, the level of each node will be passed as an argument to the callback function. If
      * `withLevel` is
      * @param {N | null} beginRoot - The `beginRoot` parameter is the starting node for the breadth-first

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

@@ -9,10 +9,10 @@ import type { BinaryTreeNodeKey, BSTComparator, BSTNodeNested, BSTOptions, MapCa
 import { CP, IterationType } from '../../types';
 import { BinaryTree, BinaryTreeNode } from './binary-tree';
 import { IBinaryTree } from '../../interfaces';
-export declare class BSTNode<V = any, FAMILY extends BSTNode<V, FAMILY> = BSTNodeNested<V>> extends BinaryTreeNode<V, FAMILY> {
+export declare class BSTNode<V = any, N extends BSTNode<V, N> = BSTNodeNested<V>> extends BinaryTreeNode<V, N> {
     constructor(key: BinaryTreeNodeKey, val?: V);
 }
-export declare class BST<N extends BSTNode<N['val'], N> = BSTNode> extends BinaryTree<N> implements IBinaryTree<N> {
+export declare class BST<V = any, N extends BSTNode<V, N> = BSTNode> extends BinaryTree<V, N> implements IBinaryTree<V, N> {
     /**
      * The constructor function initializes a binary search tree object with an optional comparator
      * function.
@@ -28,7 +28,7 @@ export declare class BST<N extends BSTNode<N['val'], N> = BSTNode> extends Binar
      * represents the value associated with the node in a binary search tree.
      * @returns a new instance of the BSTNode class with the specified key and value.
      */
-    createNode(key: BinaryTreeNodeKey, val?: N['val']): N;
+    createNode(key: BinaryTreeNodeKey, val?: V): N;
     /**
      * The `add` function in a binary search tree class inserts a new node with a given key and value
      * into the tree.
@@ -39,25 +39,25 @@ export declare class BST<N extends BSTNode<N['val'], N> = BSTNode> extends Binar
      * @returns the inserted node (N) if it was successfully added to the binary search tree. If the node
      * was not added or if the parameters were invalid, it returns null or undefined.
      */
-    add(keyOrNode: BinaryTreeNodeKey | N | null, val?: N['val']): N | null | undefined;
+    add(keyOrNode: BinaryTreeNodeKey | N | null, val?: V): N | null | undefined;
     /**
      * The `addMany` function is used to efficiently add multiple nodes to a binary search tree while
      * maintaining balance.
-     * @param {[BinaryTreeNodeKey | N, N['val']][]} arr - The `arr` parameter in the `addMany` function
+     * @param {[BinaryTreeNodeKey | N, N['val']][]} keysOrNodes - The `arr` parameter in the `addMany` function
      * represents an array of keys or nodes that need to be added to the binary search tree. It can be an
      * array of `BinaryTreeNodeKey` or `N` (which represents the node type in the binary search tree) or
      * `null
-     * @param {N['val'][]} data - The values of tree nodes
+     * @param {V[]} data - The values of tree nodes
      * @param {boolean} isBalanceAdd - If true the nodes will be balance inserted in binary search method.
      * @param iterationType - The `iterationType` parameter determines the type of iteration to be used.
      * It can have two possible values:
      * @returns The `addMany` function returns an array of `N`, `null`, or `undefined` values.
      */
-    addMany(keysOrNodes: (BinaryTreeNodeKey | null)[] | (N | null)[], data?: N['val'][], isBalanceAdd?: boolean, iterationType?: IterationType): (N | null | undefined)[];
+    addMany(keysOrNodes: (BinaryTreeNodeKey | null)[] | (N | null)[], data?: V[], isBalanceAdd?: boolean, iterationType?: IterationType): (N | null | undefined)[];
     /**
      * The function returns the first node in the binary tree that matches the given node property and
      * callback.
-     * @param {BinaryTreeNodeKey | N} nodeProperty - The `nodeProperty` parameter is used to specify the
+     * @param {ReturnType<C> | N} identifier - The `nodeProperty` parameter is used to specify the
      * property of the binary tree node that you want to search for. It can be either a specific key
      * value (`BinaryTreeNodeKey`) or a custom callback function (`MapCallback<N>`) that determines
      * whether a node matches the desired property.
@@ -72,7 +72,7 @@ export declare class BST<N extends BSTNode<N['val'], N> = BSTNode> extends Binar
      * @returns either the first node that matches the given nodeProperty and callback, or null if no
      * matching node is found.
      */
-    get<C extends MapCallback<N> = MapCallback<N, BinaryTreeNodeKey>>(nodeProperty: BinaryTreeNodeKey | N, callback?: C, beginRoot?: N | null, iterationType?: IterationType): N | null;
+    get<C extends MapCallback<N>>(identifier: ReturnType<C> | N, callback?: C, beginRoot?: N | null, iterationType?: IterationType): N | null;
     /**
      * The function `lastKey` returns the key of the rightmost node if the comparison result is less
      * than, the key of the leftmost node if the comparison result is greater than, and the key of the
@@ -92,7 +92,7 @@ export declare class BST<N extends BSTNode<N['val'], N> = BSTNode> extends Binar
     /**
      * The function `getNodes` retrieves nodes from a binary tree based on a given node property or key,
      * using either recursive or iterative traversal.
-     * @param {BinaryTreeNodeKey | N} nodeProperty - The `nodeProperty` parameter represents the property
+     * @param {ReturnType<C> | N} identifier - The `nodeProperty` parameter represents the property
      * of the binary tree node that you want to search for. It can be either a `BinaryTreeNodeKey` or a
      * generic type `N`.
      * @param callback - The `callback` parameter is a function that takes a node as input and returns a
@@ -110,7 +110,7 @@ export declare class BST<N extends BSTNode<N['val'], N> = BSTNode> extends Binar
      * traverse the binary tree. It can have one of the following values:
      * @returns an array of nodes (N[]).
      */
-    getNodes<C extends MapCallback<N> = MapCallback<N, BinaryTreeNodeKey>>(nodeProperty: BinaryTreeNodeKey | N, callback?: C, onlyOne?: boolean, beginRoot?: N | null, iterationType?: IterationType): N[];
+    getNodes<C extends MapCallback<N>>(identifier: ReturnType<C> | N, callback?: C, onlyOne?: boolean, beginRoot?: N | null, iterationType?: IterationType): N[];
     /**
      * The `lesserOrGreaterTraverse` function traverses a binary tree and applies a callback function to
      * nodes that have a key value lesser or greater than a target key value.
@@ -120,7 +120,7 @@ export declare class BST<N extends BSTNode<N['val'], N> = BSTNode> extends Binar
      * @param {CP} lesserOrGreater - The `lesserOrGreater` parameter is used to determine whether to
      * traverse nodes that are lesser than, greater than, or equal to the `targetNode`. It can take one
      * of the following values:
-     * @param {N | BinaryTreeNodeKey | null} targetNode - The `targetNode` parameter in the
+     * @param {BinaryTreeNodeKey | N | null} targetNode - The `targetNode` parameter in the
      * `lesserOrGreaterTraverse` function is used to specify the node from which the traversal should
      * start. It can be either a reference to a specific node (`N`), the key of a node
      * (`BinaryTreeNodeKey`), or `null` to
@@ -128,7 +128,7 @@ export declare class BST<N extends BSTNode<N['val'], N> = BSTNode> extends Binar
      * done recursively or iteratively. It can have two possible values:
      * @returns The function `lesserOrGreaterTraverse` returns an array of `MapCallbackReturn<N>`.
      */
-    lesserOrGreaterTraverse<C extends MapCallback<N> = MapCallback<N, BinaryTreeNodeKey>>(callback?: C, lesserOrGreater?: CP, targetNode?: N | BinaryTreeNodeKey | null, iterationType?: IterationType): ReturnType<C>[];
+    lesserOrGreaterTraverse<C extends MapCallback<N>>(callback?: C, lesserOrGreater?: CP, targetNode?: BinaryTreeNodeKey | N | null, iterationType?: IterationType): ReturnType<C>[];
     /**
      * Balancing Adjustment:
      * Perfectly Balanced Binary Tree: Since the balance of a perfectly balanced binary tree is already fixed, no additional balancing adjustment is needed. Any insertion or deletion operation will disrupt the perfect balance, often requiring a complete reconstruction of the tree.

package/dist/mjs/data-structures/binary-tree/bst.js

@@ -125,11 +125,11 @@ class BST extends binary_tree_1.BinaryTree {
     /**
      * The `addMany` function is used to efficiently add multiple nodes to a binary search tree while
      * maintaining balance.
-     * @param {[BinaryTreeNodeKey | N, N['val']][]} arr - The `arr` parameter in the `addMany` function
+     * @param {[BinaryTreeNodeKey | N, N['val']][]} keysOrNodes - The `arr` parameter in the `addMany` function
      * represents an array of keys or nodes that need to be added to the binary search tree. It can be an
      * array of `BinaryTreeNodeKey` or `N` (which represents the node type in the binary search tree) or
      * `null
-     * @param {N['val'][]} data - The values of tree nodes
+     * @param {V[]} data - The values of tree nodes
      * @param {boolean} isBalanceAdd - If true the nodes will be balance inserted in binary search method.
      * @param iterationType - The `iterationType` parameter determines the type of iteration to be used.
      * It can have two possible values:
@@ -207,7 +207,7 @@ class BST extends binary_tree_1.BinaryTree {
     /**
      * The function returns the first node in the binary tree that matches the given node property and
      * callback.
-     * @param {BinaryTreeNodeKey | N} nodeProperty - The `nodeProperty` parameter is used to specify the
+     * @param {ReturnType<C> | N} identifier - The `nodeProperty` parameter is used to specify the
      * property of the binary tree node that you want to search for. It can be either a specific key
      * value (`BinaryTreeNodeKey`) or a custom callback function (`MapCallback<N>`) that determines
      * whether a node matches the desired property.
@@ -222,8 +222,8 @@ class BST extends binary_tree_1.BinaryTree {
      * @returns either the first node that matches the given nodeProperty and callback, or null if no
      * matching node is found.
      */
-    get(nodeProperty, callback = this._defaultCallbackByKey, beginRoot = this.root, iterationType = this.iterationType) {
-        return this.getNodes(nodeProperty, callback, true, beginRoot, iterationType)[0] ?? null;
+    get(identifier, callback = this._defaultCallbackByKey, beginRoot = this.root, iterationType = this.iterationType) {
+        return this.getNodes(identifier, callback, true, beginRoot, iterationType)[0] ?? null;
     }
     /**
      * The function `lastKey` returns the key of the rightmost node if the comparison result is less
@@ -251,7 +251,7 @@ class BST extends binary_tree_1.BinaryTree {
     /**
      * The function `getNodes` retrieves nodes from a binary tree based on a given node property or key,
      * using either recursive or iterative traversal.
-     * @param {BinaryTreeNodeKey | N} nodeProperty - The `nodeProperty` parameter represents the property
+     * @param {ReturnType<C> | N} identifier - The `nodeProperty` parameter represents the property
      * of the binary tree node that you want to search for. It can be either a `BinaryTreeNodeKey` or a
      * generic type `N`.
      * @param callback - The `callback` parameter is a function that takes a node as input and returns a
@@ -269,14 +269,14 @@ class BST extends binary_tree_1.BinaryTree {
      * traverse the binary tree. It can have one of the following values:
      * @returns an array of nodes (N[]).
      */
-    getNodes(nodeProperty, callback = this._defaultCallbackByKey, onlyOne = false, beginRoot = this.root, iterationType = this.iterationType) {
+    getNodes(identifier, callback = this._defaultCallbackByKey, onlyOne = false, beginRoot = this.root, iterationType = this.iterationType) {
         if (!beginRoot)
             return [];
         const ans = [];
         if (iterationType === types_1.IterationType.RECURSIVE) {
             const _traverse = (cur) => {
                 const callbackResult = callback(cur);
-                if (callbackResult === nodeProperty) {
+                if (callbackResult === identifier) {
                     ans.push(cur);
                     if (onlyOne)
                         return;
@@ -285,9 +285,9 @@ class BST extends binary_tree_1.BinaryTree {
                     return;
                 // TODO potential bug
                 if (callback === this._defaultCallbackByKey) {
-                    if (this._compare(cur.key, nodeProperty) === types_1.CP.gt)
+                    if (this._compare(cur.key, identifier) === types_1.CP.gt)
                         cur.left && _traverse(cur.left);
-                    if (this._compare(cur.key, nodeProperty) === types_1.CP.lt)
+                    if (this._compare(cur.key, identifier) === types_1.CP.lt)
                         cur.right && _traverse(cur.right);
                 }
                 else {
@@ -303,16 +303,16 @@ class BST extends binary_tree_1.BinaryTree {
                 const cur = queue.shift();
                 if (cur) {
                     const callbackResult = callback(cur);
-                    if (callbackResult === nodeProperty) {
+                    if (callbackResult === identifier) {
                         ans.push(cur);
                         if (onlyOne)
                             return ans;
                     }
                     // TODO potential bug
                     if (callback === this._defaultCallbackByKey) {
-                        if (this._compare(cur.key, nodeProperty) === types_1.CP.gt)
+                        if (this._compare(cur.key, identifier) === types_1.CP.gt)
                             cur.left && queue.push(cur.left);
-                        if (this._compare(cur.key, nodeProperty) === types_1.CP.lt)
+                        if (this._compare(cur.key, identifier) === types_1.CP.lt)
                             cur.right && queue.push(cur.right);
                     }
                     else {
@@ -334,7 +334,7 @@ class BST extends binary_tree_1.BinaryTree {
      * @param {CP} lesserOrGreater - The `lesserOrGreater` parameter is used to determine whether to
      * traverse nodes that are lesser than, greater than, or equal to the `targetNode`. It can take one
      * of the following values:
-     * @param {N | BinaryTreeNodeKey | null} targetNode - The `targetNode` parameter in the
+     * @param {BinaryTreeNodeKey | N | null} targetNode - The `targetNode` parameter in the
      * `lesserOrGreaterTraverse` function is used to specify the node from which the traversal should
      * start. It can be either a reference to a specific node (`N`), the key of a node
      * (`BinaryTreeNodeKey`), or `null` to

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

@@ -1,13 +1,13 @@
 import { BinaryTreeNodeKey, RBColor, RBTreeNodeNested, RBTreeOptions } from '../../types';
 import { IBinaryTree } from '../../interfaces';
 import { BST, BSTNode } from './bst';
-export declare class RBTreeNode<V = any, FAMILY extends RBTreeNode<V, FAMILY> = RBTreeNodeNested<V>> extends BSTNode<V, FAMILY> {
+export declare class RBTreeNode<V = any, N extends RBTreeNode<V, N> = RBTreeNodeNested<V>> extends BSTNode<V, N> {
     constructor(key: BinaryTreeNodeKey, val?: V);
     private _color;
     get color(): RBColor;
     set color(value: RBColor);
 }
-export declare class RBTree<N extends RBTreeNode<N['val'], N> = RBTreeNode> extends BST<N> implements IBinaryTree<N> {
+export declare class RBTree<V, N extends RBTreeNode<V, N> = RBTreeNode> extends BST<V, N> implements IBinaryTree<V, N> {
     constructor(options?: RBTreeOptions);
-    createNode(key: BinaryTreeNodeKey, val?: N['val']): N;
+    createNode(key: BinaryTreeNodeKey, val?: V): N;
 }

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

@@ -6,10 +6,10 @@
  * @license MIT License
  */
 import type { BinaryTreeNodeKey, TreeMultisetNodeNested, TreeMultisetOptions } from '../../types';
-import { BinaryTreeDeletedResult, IterationType } from '../../types';
+import { BinaryTreeDeletedResult, IterationType, MapCallback } from '../../types';
 import { IBinaryTree } from '../../interfaces';
 import { AVLTree, AVLTreeNode } from './avl-tree';
-export declare class TreeMultisetNode<V = any, FAMILY extends TreeMultisetNode<V, FAMILY> = TreeMultisetNodeNested<V>> extends AVLTreeNode<V, FAMILY> {
+export declare class TreeMultisetNode<V = any, N extends TreeMultisetNode<V, N> = TreeMultisetNodeNested<V>> extends AVLTreeNode<V, N> {
     count: number;
     /**
      * The constructor function initializes a BinaryTreeNode object with a key, value, and count.
@@ -26,7 +26,7 @@ export declare class TreeMultisetNode<V = any, FAMILY extends TreeMultisetNode<V
 /**
  * The only distinction between a TreeMultiset and a AVLTree lies in the ability of the former to store duplicate nodes through the utilization of counters.
  */
-export declare class TreeMultiset<N extends TreeMultisetNode<N['val'], N> = TreeMultisetNode> extends AVLTree<N> implements IBinaryTree<N> {
+export declare class TreeMultiset<V = any, N extends TreeMultisetNode<V, N> = TreeMultisetNode> extends AVLTree<V, N> implements IBinaryTree<V, N> {
     /**
      * The constructor function for a TreeMultiset class in TypeScript, which extends another class and sets an option to
      * merge duplicated values.
@@ -45,7 +45,7 @@ export declare class TreeMultiset<N extends TreeMultisetNode<N['val'], N> = Tree
      * occurrences of the value in the binary search tree node. If not provided, the count will default to 1.
      * @returns A new instance of the BSTNode class with the specified key, value, and count (if provided).
      */
-    createNode(key: BinaryTreeNodeKey, val?: N['val'], count?: number): N;
+    createNode(key: BinaryTreeNodeKey, val?: V, count?: number): N;
     /**
      * The `add` function adds a new node to a binary search tree, updating the count if the key already
      * exists, and balancing the tree if necessary.
@@ -59,7 +59,7 @@ export declare class TreeMultiset<N extends TreeMultisetNode<N['val'], N> = Tree
      * count is specified, the default count will be 1.
      * @returns The function `add` returns a value of type `N | null | undefined`.
      */
-    add(keyOrNode: BinaryTreeNodeKey | N | null, val?: N['val'], count?: number): N | null | undefined;
+    add(keyOrNode: BinaryTreeNodeKey | N | null, val?: V, count?: number): N | null | undefined;
     /**
      * The function adds a new node to a binary tree if there is an available slot in the parent node.
      * @param {N | null} newNode - The `newNode` parameter represents the node that needs to be added to
@@ -74,12 +74,12 @@ export declare class TreeMultiset<N extends TreeMultisetNode<N['val'], N> = Tree
      * inserted nodes.
      * @param {(BinaryTreeNodeKey | null)[] | (N | null)[]} keysOrNodes - An array of keys or nodes to be
      * added to the multiset. Each element can be either a BinaryTreeNodeKey or a TreeMultisetNode.
-     * @param {N['val'][]} [data] - The `data` parameter is an optional array of values that correspond
+     * @param {V[]} [data] - The `data` parameter is an optional array of values that correspond
      * to the keys or nodes being added to the multiset. It is used to associate additional data with
      * each key or node.
      * @returns The function `addMany` returns an array of `N`, `null`, or `undefined` values.
      */
-    addMany(keysOrNodes: (BinaryTreeNodeKey | null)[] | (N | null)[], data?: N['val'][]): (N | null | undefined)[];
+    addMany(keysOrNodes: (BinaryTreeNodeKey | null)[] | (N | null)[], data?: V[]): (N | null | undefined)[];
     /**
      * The `perfectlyBalance` function in TypeScript takes a sorted array of nodes and builds a balanced
      * binary search tree using either a recursive or iterative approach.
@@ -92,16 +92,20 @@ export declare class TreeMultiset<N extends TreeMultisetNode<N['val'], N> = Tree
     /**
      * The `delete` function in a binary search tree deletes a node from the tree and returns the deleted
      * node along with the parent node that needs to be balanced.
-     * @param {N | BinaryTreeNodeKey} nodeOrKey - The `nodeOrKey` parameter can be either a node object
-     * (`N`) or a key value (`BinaryTreeNodeKey`). It represents the node or key that needs to be deleted
-     * from the binary tree.
+     * @param {ReturnType<C>} identifier - The `identifier` parameter is either a
+     * `BinaryTreeNodeKey` or a generic type `N`. It represents the property of the node that we are
+     * searching for. It can be a specific key value or any other property of the node.
+     * @param callback - The `callback` parameter is a function that takes a node as input and returns a
+     * value. This value is compared with the `identifier` parameter to determine if the node should be
+     * included in the result. The `callback` parameter has a default value of
+     * `this._defaultCallbackByKey`
      * @param [ignoreCount=false] - A boolean flag indicating whether to ignore the count of the node
      * being deleted. If set to true, the count of the node will not be considered and the node will be
      * deleted regardless of its count. If set to false (default), the count of the node will be
      * decremented by 1 and
      * @returns The method `delete` returns an array of `BinaryTreeDeletedResult<N>` objects.
      */
-    delete(nodeOrKey: N | BinaryTreeNodeKey, ignoreCount?: boolean): BinaryTreeDeletedResult<N>[];
+    delete<C extends MapCallback<N>>(identifier: ReturnType<C>, callback?: C, ignoreCount?: boolean): BinaryTreeDeletedResult<N>[];
     /**
      * The clear() function clears the contents of a data structure and sets the count to zero.
      */