min-heap-typed 1.38.6 → 1.38.8

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

@@ -7,13 +7,13 @@
  */
 import { BST, BSTNode } from './bst';
 import type { AVLTreeNodeNested, AVLTreeOptions, BinaryTreeDeletedResult, BinaryTreeNodeKey } from '../../types';
-import { IBinaryTree } from '../../interfaces';
 import { MapCallback } from '../../types';
-export declare class AVLTreeNode<V = any, FAMILY extends AVLTreeNode<V, FAMILY> = AVLTreeNodeNested<V>> extends BSTNode<V, FAMILY> {
+import { IBinaryTree } from '../../interfaces';
+export declare class AVLTreeNode<V = any, N extends AVLTreeNode<V, N> = AVLTreeNodeNested<V>> extends BSTNode<V, N> {
     height: number;
     constructor(key: BinaryTreeNodeKey, val?: V);
 }
-export declare class AVLTree<N extends AVLTreeNode<N['val'], N> = AVLTreeNode> extends BST<N> implements IBinaryTree<N> {
+export declare class AVLTree<V = any, N extends AVLTreeNode<V, N> = AVLTreeNode<V, AVLTreeNodeNested<V>>> extends BST<V, N> implements IBinaryTree<V, N> {
     /**
      * This is a constructor function for an AVL tree data structure in TypeScript.
      * @param {AVLTreeOptions} [options] - The `options` parameter is an optional object that can be passed to the
@@ -26,11 +26,11 @@ export declare class AVLTree<N extends AVLTreeNode<N['val'], N> = AVLTreeNode> e
      * @param {BinaryTreeNodeKey} key - The key parameter is the key value that will be associated with
      * the new node. It is used to determine the position of the node in the binary search tree.
      * @param [val] - The parameter `val` is an optional value that can be assigned to the node. It is of
-     * type `N['val']`, which means it can be any value that is assignable to the `val` property of the
+     * type `V`, which means it can be any value that is assignable to the `val` property of the
      * node type `N`.
      * @returns a new AVLTreeNode object with the specified key and value.
      */
-    createNode(key: BinaryTreeNodeKey, val?: N['val']): N;
+    createNode(key: BinaryTreeNodeKey, val?: V): N;
     /**
      * The function overrides the add method of a binary tree node and balances the tree after inserting
      * a new node.
@@ -40,7 +40,7 @@ export declare class AVLTree<N extends AVLTreeNode<N['val'], N> = AVLTreeNode> e
      * are adding to the binary search tree.
      * @returns The method is returning the inserted node (`N`), `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 function overrides the delete method of a binary tree and balances the tree after deleting a
      * node if necessary.

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

@@ -31,7 +31,7 @@ class AVLTree extends bst_1.BST {
      * @param {BinaryTreeNodeKey} key - The key parameter is the key value that will be associated with
      * the new node. It is used to determine the position of the node in the binary search tree.
      * @param [val] - The parameter `val` is an optional value that can be assigned to the node. It is of
-     * type `N['val']`, which means it can be any value that is assignable to the `val` property of the
+     * type `V`, which means it can be any value that is assignable to the `val` property of the
      * node type `N`.
      * @returns a new AVLTreeNode object with the specified key and value.
      */

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

@@ -11,9 +11,9 @@ import { IBinaryTree } from '../../interfaces';
 /**
  * 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.
  */
-export declare class BinaryTreeNode<V = any, FAMILY extends BinaryTreeNode<V, FAMILY> = BinaryTreeNodeNested<V>> {
+export declare class BinaryTreeNode<V = any, N extends BinaryTreeNode<V, N> = BinaryTreeNode<V, BinaryTreeNodeNested<V>>> {
     /**
      * The key associated with the node.
      */
@@ -25,7 +25,7 @@ export declare class BinaryTreeNode<V = any, FAMILY extends BinaryTreeNode<V, FA
     /**
      * The parent node of the current node.
      */
-    parent: FAMILY | null | undefined;
+    parent: N | null | undefined;
     /**
      * Creates a new instance of BinaryTreeNode.
      * @param {BinaryTreeNodeKey} key - The key associated with the node.
@@ -36,22 +36,22 @@ export declare class BinaryTreeNode<V = any, FAMILY extends BinaryTreeNode<V, FA
     /**
      * Get the left child node.
      */
-    get left(): FAMILY | null | undefined;
+    get left(): N | null | undefined;
     /**
      * 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: FAMILY | null | undefined);
+    set left(v: N | null | undefined);
     private _right;
     /**
      * Get the right child node.
      */
-    get right(): FAMILY | null | undefined;
+    get right(): N | null | undefined;
     /**
      * 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: FAMILY | null | undefined);
+    set right(v: N | null | undefined);
     /**
      * Get the position of the node within its family.
      * @returns {FamilyPosition} - The family position of the node.
@@ -62,13 +62,22 @@ export declare class BinaryTreeNode<V = any, FAMILY extends BinaryTreeNode<V, FA
  * Represents a binary tree data structure.
  * @template N - The type of the binary tree's nodes.
  */
-export declare class BinaryTree<N extends BinaryTreeNode<N['val'], N> = BinaryTreeNode> implements IBinaryTree<N> {
-    private _loopType;
+export declare class BinaryTree<V = any, N extends BinaryTreeNode<V, N> = BinaryTreeNode<V, BinaryTreeNodeNested<V>>> implements IBinaryTree<V, N> {
     /**
      * Creates a new instance of BinaryTree.
      * @param {BinaryTreeOptions} [options] - The options for the binary tree.
      */
     constructor(options?: BinaryTreeOptions);
+    private _iterationType;
+    /**
+     * Get the iteration type used in the binary tree.
+     */
+    get iterationType(): IterationType;
+    /**
+     * Set the iteration type for the binary tree.
+     * @param {IterationType} v - The new iteration type to set.
+     */
+    set iterationType(v: IterationType);
     private _root;
     /**
      * Get the root node of the binary tree.
@@ -79,22 +88,13 @@ export declare class BinaryTree<N extends BinaryTreeNode<N['val'], N> = BinaryTr
      * Get the number of nodes in the binary tree.
      */
     get size(): number;
-    /**
-     * Get the iteration type used in the binary tree.
-     */
-    get iterationType(): IterationType;
-    /**
-     * Set the iteration type for the binary tree.
-     * @param {IterationType} v - The new iteration type to set.
-     */
-    set iterationType(v: IterationType);
     /**
      * 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: BinaryTreeNodeKey, val?: N['val']): N;
+    createNode(key: BinaryTreeNodeKey, val?: V): N;
     /**
      * Clear the binary tree, removing all nodes.
      */
@@ -107,31 +107,31 @@ export declare class BinaryTree<N extends BinaryTreeNode<N['val'], N> = BinaryTr
     /**
      * 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: BinaryTreeNodeKey | N | null, val?: N['val']): N | null | undefined;
+    add(keyOrNode: BinaryTreeNodeKey | N | null, val?: V): N | null | undefined;
     /**
      * The `addMany` function takes an array of binary tree node IDs or nodes, and optionally an array of corresponding data
      * 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: (BinaryTreeNodeKey | null)[] | (N | null)[], values?: N['val'][]): (N | null | undefined)[];
+    addMany(keysOrNodes: (BinaryTreeNodeKey | null)[] | (N | null)[], values?: V[]): (N | null | undefined)[];
     /**
      * 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.
      */
-    refill(keysOrNodes: (BinaryTreeNodeKey | null)[] | (N | null)[], data?: N[] | Array<N['val']>): boolean;
+    refill(keysOrNodes: (BinaryTreeNodeKey | null)[] | (N | null)[], data?: Array<V>): boolean;
     delete<C extends MapCallback<N>>(identifier: ReturnType<C> | N): BinaryTreeDeletedResult<N>[];
     delete<C extends MapCallback<N>>(identifier: ReturnType<C> | N, callback: C): BinaryTreeDeletedResult<N>[];
     /**
@@ -285,10 +285,6 @@ export declare class BinaryTree<N extends BinaryTreeNode<N['val'], N> = BinaryTr
      * @param callback - The `callback` parameter is a function that will be called for each node in the
      * 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 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
      * search. It determines from which node the search will begin. If `beginRoot` is `null`, the search
      * will not be performed and an empty array will be returned.
@@ -296,7 +292,23 @@ export declare class BinaryTree<N extends BinaryTreeNode<N['val'], N> = BinaryTr
      * in the breadth-first search (BFS) algorithm. It can have two possible values:
      * @returns The function `bfs` returns an array of `BFSCallbackReturn<N>[]`.
      */
-    bfs<C extends BFSCallback<N> = BFSCallback<N, BinaryTreeNodeKey>>(callback?: C, withLevel?: boolean, beginRoot?: N | null, iterationType?: IterationType): ReturnType<C>[];
+    bfs<C extends BFSCallback<N> = BFSCallback<N, BinaryTreeNodeKey>>(callback?: C, beginRoot?: N | null, iterationType?: IterationType): ReturnType<C>[];
+    /**
+     * The `listLevels` function takes a binary tree node and a callback function, and returns an array
+     * of arrays representing the levels of the tree.
+     * @param {C} callback - The `callback` parameter is a function that will be called on each node in
+     * the tree. It takes a node as input and returns a value. The return type of the callback function
+     * is determined by the generic type `C`.
+     * @param {N | null} beginRoot - The `beginRoot` parameter represents the starting node of the binary tree
+     * traversal. It can be any node in the binary tree. If no node is provided, the traversal will start
+     * from the root node of the binary tree.
+     * @param iterationType - The `iterationType` parameter determines whether the tree traversal is done
+     * recursively or iteratively. It can have two possible values:
+     * @returns The function `listLevels` returns an array of arrays, where each inner array represents a
+     * level in a binary tree. Each inner array contains the return type of the provided callback
+     * function `C` applied to the nodes at that level.
+     */
+    listLevels<C extends BFSCallback<N> = BFSCallback<N, BinaryTreeNodeKey>>(callback?: C, beginRoot?: N | null, iterationType?: IterationType): ReturnType<C>[][];
     /**
      * The function returns the predecessor node of a given node in a binary tree.
      * @param {N} node - The parameter "node" represents a node in a binary tree.

package/dist/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 {
     /**
@@ -34,7 +34,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) {
@@ -50,7 +50,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) {
@@ -87,7 +87,7 @@ class BinaryTree {
      * @param {BinaryTreeOptions} [options] - The options for the binary tree.
      */
     constructor(options) {
-        this._loopType = types_1.IterationType.ITERATIVE;
+        this._iterationType = types_1.IterationType.ITERATIVE;
         this._root = null;
         this._size = 0;
         /**
@@ -100,38 +100,38 @@ class BinaryTree {
         this._defaultCallbackByKey = node => node.key;
         if (options !== undefined) {
             const { iterationType = types_1.IterationType.ITERATIVE } = options;
-            this._loopType = iterationType;
+            this._iterationType = iterationType;
         }
     }
     /**
-     * Get the root node of the binary tree.
+     * Get the iteration type used in the binary tree.
      */
-    get root() {
-        return this._root;
+    get iterationType() {
+        return this._iterationType;
     }
     /**
-     * Get the number of nodes in the binary tree.
+     * Set the iteration type for the binary tree.
+     * @param {IterationType} v - The new iteration type to set.
      */
-    get size() {
-        return this._size;
+    set iterationType(v) {
+        this._iterationType = v;
     }
     /**
-     * Get the iteration type used in the binary tree.
+     * Get the root node of the binary tree.
      */
-    get iterationType() {
-        return this._loopType;
+    get root() {
+        return this._root;
     }
     /**
-     * Set the iteration type for the binary tree.
-     * @param {IterationType} v - The new iteration type to set.
+     * Get the number of nodes in the binary tree.
      */
-    set iterationType(v) {
-        this._loopType = v;
+    get size() {
+        return this._size;
     }
     /**
      * 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) {
@@ -154,7 +154,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) {
@@ -219,7 +219,7 @@ 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.
@@ -241,7 +241,7 @@ class BinaryTree {
      * 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.
@@ -821,10 +821,6 @@ class BinaryTree {
      * @param callback - The `callback` parameter is a function that will be called for each node in the
      * 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 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
      * search. It determines from which node the search will begin. If `beginRoot` is `null`, the search
      * will not be performed and an empty array will be returned.
@@ -832,13 +828,65 @@ class BinaryTree {
      * in the breadth-first search (BFS) algorithm. It can have two possible values:
      * @returns The function `bfs` returns an array of `BFSCallbackReturn<N>[]`.
      */
-    bfs(callback = this._defaultCallbackByKey, withLevel = false, beginRoot = this.root, iterationType = this.iterationType) {
+    bfs(callback = this._defaultCallbackByKey, beginRoot = this.root, iterationType = this.iterationType) {
         if (!beginRoot)
             return [];
         const ans = [];
+        if (iterationType === types_1.IterationType.RECURSIVE) {
+            const queue = new queue_1.Queue([beginRoot]);
+            function traverse(level) {
+                if (queue.size === 0)
+                    return;
+                const current = queue.shift();
+                ans.push(callback(current));
+                if (current.left)
+                    queue.push(current.left);
+                if (current.right)
+                    queue.push(current.right);
+                traverse(level + 1);
+            }
+            traverse(0);
+        }
+        else {
+            const queue = new queue_1.Queue([beginRoot]);
+            while (queue.size > 0) {
+                const levelSize = queue.size;
+                for (let i = 0; i < levelSize; i++) {
+                    const current = queue.shift();
+                    ans.push(callback(current));
+                    if (current.left)
+                        queue.push(current.left);
+                    if (current.right)
+                        queue.push(current.right);
+                }
+            }
+        }
+        return ans;
+    }
+    /**
+     * The `listLevels` function takes a binary tree node and a callback function, and returns an array
+     * of arrays representing the levels of the tree.
+     * @param {C} callback - The `callback` parameter is a function that will be called on each node in
+     * the tree. It takes a node as input and returns a value. The return type of the callback function
+     * is determined by the generic type `C`.
+     * @param {N | null} beginRoot - The `beginRoot` parameter represents the starting node of the binary tree
+     * traversal. It can be any node in the binary tree. If no node is provided, the traversal will start
+     * from the root node of the binary tree.
+     * @param iterationType - The `iterationType` parameter determines whether the tree traversal is done
+     * recursively or iteratively. It can have two possible values:
+     * @returns The function `listLevels` returns an array of arrays, where each inner array represents a
+     * level in a binary tree. Each inner array contains the return type of the provided callback
+     * function `C` applied to the nodes at that level.
+     */
+    listLevels(callback = this._defaultCallbackByKey, beginRoot = this.root, iterationType = this.iterationType) {
+        if (!beginRoot)
+            return [];
+        const levelsNodes = [];
         if (iterationType === types_1.IterationType.RECURSIVE) {
             const _recursive = (node, level) => {
-                callback && ans.push(callback(node, withLevel ? level : undefined));
+                if (!levelsNodes[level])
+                    levelsNodes[level] = [];
+                levelsNodes[level].push(callback(node));
                 if (node.left)
                     _recursive(node.left, level + 1);
                 if (node.right)
@@ -851,14 +899,16 @@ class BinaryTree {
             while (stack.length > 0) {
                 const head = stack.pop();
                 const [node, level] = head;
-                callback && ans.push(callback(node, withLevel ? level : undefined));
+                if (!levelsNodes[level])
+                    levelsNodes[level] = [];
+                levelsNodes[level].push(callback(node));
                 if (node.right)
                     stack.push([node.right, level + 1]);
                 if (node.left)
                     stack.push([node.left, level + 1]);
             }
         }
-        return ans;
+        return levelsNodes;
     }
     /**
      * The function returns the predecessor node of a given node in a binary tree.

package/dist/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<V, BSTNodeNested<V>>> 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,7 +39,7 @@ 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.
@@ -47,13 +47,13 @@ export declare class BST<N extends BSTNode<N['val'], N> = BSTNode> extends Binar
      * 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.

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

@@ -130,7 +130,7 @@ class BST extends binary_tree_1.BinaryTree {
      * 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:

package/dist/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<V, RBTreeNodeNested<V>>> 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/data-structures/binary-tree/tree-multiset.d.ts

@@ -9,7 +9,7 @@ import type { BinaryTreeNodeKey, TreeMultisetNodeNested, TreeMultisetOptions } f
 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<V, TreeMultisetNodeNested<V>>> 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.

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

@@ -177,7 +177,7 @@ class TreeMultiset extends avl_tree_1.AVLTree {
      * 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.
@@ -191,7 +191,7 @@ class TreeMultiset extends avl_tree_1.AVLTree {
                 continue;
             }
             if (keyOrNode === null) {
-                inserted.push(this.add(NaN, null, 0));
+                inserted.push(this.add(NaN, undefined, 0));
                 continue;
             }
             inserted.push(this.add(keyOrNode, data === null || data === void 0 ? void 0 : data[i], 1));

package/dist/interfaces/binary-tree.d.ts

@@ -1,6 +1,6 @@
 import { BinaryTreeNode } from '../data-structures';
-import { BinaryTreeDeletedResult, BinaryTreeNodeKey, MapCallback } from '../types';
-export interface IBinaryTree<N extends BinaryTreeNode<N['val'], N>> {
+import { BinaryTreeDeletedResult, BinaryTreeNodeKey, BinaryTreeNodeNested, MapCallback } from '../types';
+export interface IBinaryTree<V = any, N extends BinaryTreeNode<V, N> = BinaryTreeNodeNested<V>> {
     createNode(key: BinaryTreeNodeKey, val?: N['val']): N;
     add(keyOrNode: BinaryTreeNodeKey | N | null, val?: N['val']): N | null | undefined;
     delete<C extends MapCallback<N>>(identifier: ReturnType<C> | N, callback: C): BinaryTreeDeletedResult<N>[];

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "min-heap-typed",
-  "version": "1.38.6",
+  "version": "1.38.8",
   "description": "Min Heap. Javascript & Typescript Data Structure.",
   "main": "dist/index.js",
   "scripts": {
@@ -131,6 +131,6 @@
     "typescript": "^4.9.5"
   },
   "dependencies": {
-    "data-structure-typed": "^1.38.6"
+    "data-structure-typed": "^1.38.8"
   }
 }