data-structure-typed 1.54.2 → 1.54.3

package/dist/umd/data-structure-typed.js

@@ -7463,7 +7463,7 @@ var dataStructureTyped = (() => {
      * 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
+     * iterable that can contain either objects of type `K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  ` 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:
@@ -7472,6 +7472,7 @@ var dataStructureTyped = (() => {
       super();
       __publicField(this, "iterationType", "ITERATIVE");
       __publicField(this, "_isMapMode", true);
+      __publicField(this, "_isDuplicate", false);
       __publicField(this, "_store", /* @__PURE__ */ new Map());
       __publicField(this, "_root");
       __publicField(this, "_size", 0);
@@ -7479,9 +7480,10 @@ var dataStructureTyped = (() => {
       __publicField(this, "_toEntryFn");
       __publicField(this, "_DEFAULT_NODE_CALLBACK", (node) => node ? node.key : void 0);
       if (options) {
-        const { iterationType, toEntryFn, isMapMode } = options;
+        const { iterationType, toEntryFn, isMapMode, isDuplicate } = options;
         if (iterationType) this.iterationType = iterationType;
         if (isMapMode !== void 0) this._isMapMode = isMapMode;
+        if (isDuplicate !== void 0) this._isDuplicate = isDuplicate;
         if (typeof toEntryFn === "function") this._toEntryFn = toEntryFn;
         else if (toEntryFn) throw TypeError("toEntryFn must be a function type");
       }
@@ -7490,6 +7492,9 @@ var dataStructureTyped = (() => {
     get isMapMode() {
       return this._isMapMode;
     }
+    get isDuplicate() {
+      return this._isDuplicate;
+    }
     get store() {
       return this._store;
     }
@@ -7544,8 +7549,8 @@ var dataStructureTyped = (() => {
      *
      * 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, BinaryTreeNode<K, V>>} keyNodeOrEntry - The `keyNodeOrEntry`
-     * parameter in the `ensureNode` function can be of type `BTNRep<K, V, BinaryTreeNode<K, V>>` or `R`. It
+     * @param {K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  } keyNodeOrEntry - The `keyNodeOrEntry`
+     * parameter in the `ensureNode` function can be of type `K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  ` 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
@@ -7571,7 +7576,7 @@ var dataStructureTyped = (() => {
      * Space Complexity: O(1)
      *
      * The function isNode checks if the input is an instance of BinaryTreeNode.
-     * @param {BTNRep<K, V, BinaryTreeNode<K, V>>} keyNodeOrEntry - The parameter
+     * @param {K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  } 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.
@@ -7588,7 +7593,7 @@ var dataStructureTyped = (() => {
      * 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, BinaryTreeNode<K, V>> | R} keyNodeEntryOrRaw - BTNRep<K, V, BinaryTreeNode<K, V>>
+     * @param {K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined   | R} keyNodeEntryOrRaw - K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined
      * @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`.
@@ -7601,8 +7606,8 @@ var dataStructureTyped = (() => {
      * Space Complexity: O(1)
      *
      * The function `isRealNode` checks if a given input is a valid node in a binary tree.
-     * @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`.
+     * @param {K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  } keyNodeOrEntry - The `keyNodeOrEntry`
+     * parameter in the `isRealNode` function can be of type `K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  ` 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
@@ -7618,7 +7623,7 @@ var dataStructureTyped = (() => {
      * Space Complexity: O(1)
      *
      * The function checks if a given input is a valid node or null.
-     * @param {BTNRep<K, V, BinaryTreeNode<K, V>>} keyNodeOrEntry - The parameter
+     * @param {K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  } 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
@@ -7633,7 +7638,7 @@ var dataStructureTyped = (() => {
      * 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, BinaryTreeNode<K, V>>} keyNodeOrEntry - BTNRep<K, V,
+     * @param {K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  } 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.
@@ -7646,9 +7651,9 @@ var dataStructureTyped = (() => {
      * 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
+     * @param {K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined   | NodePredicate<BinaryTreeNode<K, V>> | Range<K>} keyNodeEntryOrPredicate
+     * - The `keyNodeEntryOrPredicate` parameter in the `isRange` function can be
+     * of type `K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  `, `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`,
@@ -7664,8 +7669,8 @@ var dataStructureTyped = (() => {
      *
      * The function determines whether a given key, node, entry, or raw data is a leaf node in a binary
      * tree.
-     * @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
+     * @param {K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  } keyNodeOrEntry - The parameter
+     * `keyNodeOrEntry` can be of type `K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  ` 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
@@ -7683,8 +7688,8 @@ var dataStructureTyped = (() => {
      *
      * 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, BinaryTreeNode<K, V>>} keyNodeOrEntry - The `keyNodeOrEntry`
-     * parameter in the `isEntry` function can be of type `BTNRep<K, V, BinaryTreeNode<K, V>>` or type `R`.
+     * @param {K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  } keyNodeOrEntry - The `keyNodeOrEntry`
+     * parameter in the `isEntry` function can be of type `K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  ` 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
@@ -7714,7 +7719,7 @@ var dataStructureTyped = (() => {
      *
      * 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, BinaryTreeNode<K, V>>} keyNodeOrEntry - The `add` method you provided
+     * @param {K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  } 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
@@ -7739,10 +7744,12 @@ var dataStructureTyped = (() => {
       while (queue.size > 0) {
         const cur = queue.shift();
         if (!cur) continue;
-        if (newNode !== null && cur.key === newNode.key) {
-          this._replaceNode(cur, newNode);
-          if (this._isMapMode) this._setValue(cur.key, newValue);
-          return true;
+        if (!this._isDuplicate) {
+          if (newNode !== null && cur.key === newNode.key) {
+            this._replaceNode(cur, newNode);
+            if (this._isMapMode) this._setValue(cur.key, newValue);
+            return true;
+          }
         }
         if (potentialParent === void 0 && (cur.left === void 0 || cur.right === void 0)) {
           potentialParent = cur;
@@ -7775,7 +7782,7 @@ var dataStructureTyped = (() => {
      * 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, BinaryTreeNode<K, V>>` or `R`.
+     * `K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  ` 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
@@ -7821,7 +7828,7 @@ var dataStructureTyped = (() => {
      * 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, BinaryTreeNode<K, V>>` objects or `R`
+     * method can accept an iterable containing a mix of `K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  ` 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`.
@@ -7836,7 +7843,7 @@ var dataStructureTyped = (() => {
      *
      * 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, BinaryTreeNode<K, V>>} keyNodeOrEntry
+     * @param {K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  } 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
@@ -7890,15 +7897,15 @@ var dataStructureTyped = (() => {
      *
      * 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, BinaryTreeNode<K, V>> | NodePredicate<BinaryTreeNode<K, V>>} keyNodeEntryOrPredicate - The
+     * @param {K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined   | 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<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
+     * extends `NodeCallback<BinaryTreeNode<K, V> | null>`. The default value for `callback` is `this._DEFAULT_NODE_CALLBACK` if
+     * @param {K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  } 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
@@ -7948,12 +7955,12 @@ var dataStructureTyped = (() => {
      *
      * 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, BinaryTreeNode<K, V>> | NodePredicate<BinaryTreeNode<K, V>>} keyNodeEntryOrPredicate
+     * @param {K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined   | 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
      * `keyNodeEntryOrPredicate` parameter. If `onlyOne` is set to `true`, the function will
-     * @param {BTNRep<K, V, BinaryTreeNode<K, V>>} startNode - The `startNode` parameter in the
+     * @param {K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  } 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
@@ -7972,10 +7979,10 @@ var dataStructureTyped = (() => {
      *
      * The `getNode` function retrieves a node based on the provided key, node, entry, raw data, or
      * predicate.
-     * @param {BTNRep<K, V, BinaryTreeNode<K, V>> | NodePredicate<BinaryTreeNode<K, V>>} keyNodeEntryOrPredicate
+     * @param {K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined   | 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, BinaryTreeNode<K, V>>} startNode - The `startNode` parameter in the
+     * @param {K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  } 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.
@@ -7995,10 +8002,10 @@ var dataStructureTyped = (() => {
      *
      * 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, BinaryTreeNode<K, V>> | NodePredicate<BinaryTreeNode<K, V>>} keyNodeEntryOrPredicate
+     * @param {K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined   | NodePredicate<BinaryTreeNode<K, V>>} keyNodeEntryOrPredicate
      * - The `keyNodeEntryOrPredicate` parameter in the `get` method can accept one of the
      * following types:
-     * @param {BTNRep<K, V, BinaryTreeNode<K, V>>} startNode - The `startNode` parameter in the `get`
+     * @param {K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  } 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`).
@@ -8026,10 +8033,10 @@ var dataStructureTyped = (() => {
      *
      * 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, BinaryTreeNode<K, V>> | NodePredicate<BinaryTreeNode<K, V>>} keyNodeEntryOrPredicate
+     * @param {K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined   | NodePredicate<BinaryTreeNode<K, V>>} keyNodeEntryOrPredicate
      * - The `keyNodeEntryOrPredicate` parameter in the `override has` method can accept one of
      * the following types:
-     * @param {BTNRep<K, V, BinaryTreeNode<K, V>>} startNode - The `startNode` parameter in the
+     * @param {K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  } 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
@@ -8072,7 +8079,7 @@ var dataStructureTyped = (() => {
      *
      * The function checks if a binary tree is perfectly balanced by comparing its minimum height with
      * its height.
-     * @param {BTNRep<K, V, BinaryTreeNode<K, V>>} startNode - The `startNode` parameter is the starting
+     * @param {K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  } 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
@@ -8090,7 +8097,7 @@ var dataStructureTyped = (() => {
      *
      * The function `isBST` in TypeScript checks if a binary search tree is valid using either recursive
      * or iterative methods.
-     * @param {BTNRep<K, V, BinaryTreeNode<K, V>>} startNode - The `startNode` parameter in the `isBST`
+     * @param {K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  } 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
@@ -8142,10 +8149,10 @@ var dataStructureTyped = (() => {
      * Space Complexity: O(log n)
      *
      * The `getDepth` function calculates the depth between two nodes in a binary tree.
-     * @param {BTNRep<K, V, BinaryTreeNode<K, V>>} dist - The `dist` parameter in the `getDepth`
+     * @param {K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  } 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, BinaryTreeNode<K, V>>} startNode - The `startNode` parameter in the
+     * @param {K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  } 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
@@ -8172,7 +8179,7 @@ var dataStructureTyped = (() => {
      *
      * The `getHeight` function calculates the maximum height of a binary tree using either a recursive
      * or iterative approach in TypeScript.
-     * @param {BTNRep<K, V, BinaryTreeNode<K, V>>} startNode - The `startNode` parameter is the starting
+     * @param {K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  } 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.
@@ -8212,7 +8219,7 @@ var dataStructureTyped = (() => {
      *
      * The `getMinHeight` function calculates the minimum height of a binary tree using either a
      * recursive or iterative approach in TypeScript.
-     * @param {BTNRep<K, V, BinaryTreeNode<K, V>>} startNode - The `startNode` parameter in the
+     * @param {K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  } 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
@@ -8271,7 +8278,7 @@ var dataStructureTyped = (() => {
      * 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, BinaryTreeNode<K, V>>} beginNode - The `beginNode` parameter in the
+     * @param {K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  } 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
@@ -8301,7 +8308,7 @@ var dataStructureTyped = (() => {
      * @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, BinaryTreeNode<K, V>>} startNode - The `startNode` parameter in the
+     * @param {K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  } 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
@@ -8341,7 +8348,7 @@ var dataStructureTyped = (() => {
      * 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, BinaryTreeNode<K, V>>} startNode - The `startNode` parameter in the
+     * @param {K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  } 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
@@ -8427,32 +8434,34 @@ var dataStructureTyped = (() => {
      * Time complexity: O(n)
      * Space complexity: O(n)
      *
-     * The function `dfs` performs a depth-first search traversal on a binary tree structure based on the
-     * specified parameters.
-     * @param {C} callback - The `callback` parameter is a generic type `C` that extends the
-     * `NodeCallback` interface with a type parameter of `OptNodeOrNull<BinaryTreeNode<K, V>>`. It has a default value of
-     * `this._DEFAULT_NODE_CALLBACK as C`.
-     * @param {DFSOrderPattern} [pattern=IN] - The `pattern` parameter in the `dfs` method specifies the
-     * order in which the Depth-First Search (DFS) algorithm should traverse the nodes in the tree. The
-     * possible values for the `pattern` parameter are:
-     * @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. It can be
-     * either a `BTNRep` object representing a key, node, or entry in the binary tree map,
-     * or it can be a
-     * @param {IterationType} iterationType - The `iterationType` parameter in the `dfs` method specifies
-     * the type of iteration to be performed during the depth-first search traversal. It is used to
-     * determine the order in which nodes are visited during the traversal.
-     * @param [includeNull=false] - The `includeNull` parameter in the `dfs` method is a boolean flag
-     * that determines whether null values should be included in the traversal or not. If `includeNull`
-     * is set to `true`, then null values will be included in the traversal process. If it is set to
-     * `false`,
-     * @returns The `dfs` method is returning an array of the return type specified by the generic type
-     * parameter `C`. The return type is determined by the callback function provided to the method.
-     */
-    dfs(callback = this._DEFAULT_NODE_CALLBACK, pattern = "IN", startNode = this._root, iterationType = this.iterationType, includeNull = false) {
+     * The function performs a depth-first search on a binary tree structure based on the specified
+     * parameters.
+     * @param {C} callback - The `callback` parameter is a function that will be called for each node
+     * visited during the depth-first search. It should accept a `BinaryTreeNode` as an argument and
+     * return an optional node or null. The default value for this parameter is `_DEFAULT_NODE_CALLBACK`.
+     * @param {DFSOrderPattern} [pattern=IN] - The `pattern` parameter in the `dfs` function specifies
+     * the order in which the nodes are visited during a depth-first search traversal. The possible
+     * values for the `pattern` parameter are:
+     * @param {boolean} [onlyOne=false] - The `onlyOne` parameter in the `dfs` function is a boolean flag
+     * that determines whether the depth-first search should stop after finding the first matching node
+     * or continue searching for all matching nodes. If `onlyOne` is set to `true`, the search will stop
+     * after finding the first matching node
+     * @param {K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined}
+     * startNode - The `startNode` parameter in the `dfs` function can be one of the following types:
+     * @param {IterationType} iterationType - The `iterationType` parameter in the `dfs` function
+     * specifies the type of iteration to be performed during the Depth-First Search traversal. It is
+     * used to determine the order in which nodes are visited during the traversal. The possible values
+     * for `iterationType` are typically defined as an enum or a
+     * @param [includeNull=false] - The `includeNull` parameter in the `dfs` function determines whether
+     * null nodes should be included in the depth-first search traversal. If `includeNull` is set to
+     * `true`, null nodes will be included in the traversal process. If it is set to `false`, null nodes
+     * will be skipped
+     * @returns The `dfs` method is returning an array of the return type of the callback function `C`.
+     */
+    dfs(callback = this._DEFAULT_NODE_CALLBACK, pattern = "IN", onlyOne = false, startNode = this._root, iterationType = this.iterationType, includeNull = false) {
       startNode = this.ensureNode(startNode);
       if (!startNode) return [];
-      return this._dfs(callback, pattern, startNode, iterationType, includeNull);
+      return this._dfs(callback, pattern, onlyOne, startNode, iterationType, includeNull);
     }
     /**
      * Time complexity: O(n)
@@ -8463,7 +8472,7 @@ var dataStructureTyped = (() => {
      * @param {C} callback - The `callback` parameter in the `bfs` function is a function that will be
      * called on each node visited during the breadth-first search traversal. It is a generic type `C`
      * that extends the `NodeCallback` type, which takes a parameter of type `BinaryTreeNode<K, V>` or `null`.
-     * @param {BTNRep<K, V, BinaryTreeNode<K, V>>} startNode - The `startNode` parameter in the `bfs`
+     * @param {K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  } startNode - The `startNode` parameter in the `bfs`
      * function represents the starting point for the breadth-first search traversal in a binary tree. It
      * can be specified as a key, node, or entry in the binary tree structure. If not provided, the
      * default value is the root node of the binary
@@ -8526,7 +8535,7 @@ var dataStructureTyped = (() => {
      * 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, BinaryTreeNode<K, V>>} startNode - The `startNode` parameter in the `leaves`
+     * @param {K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  } 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
@@ -8574,7 +8583,7 @@ var dataStructureTyped = (() => {
      * @param {C} callback - The `callback` parameter is a function that will be applied to each node in
      * the binary tree during the traversal. It is used to process each node and determine what
      * information to include in the output for each level of the tree.
-     * @param {BTNRep<K, V, BinaryTreeNode<K, V>>} startNode - The `startNode` parameter in the
+     * @param {K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  } startNode - The `startNode` parameter in the
      * `listLevels` function represents the starting point for traversing the binary tree. It can be
      * either a key, a node, or an entry in the binary tree. If not provided, the default value is the
      * root of the binary tree.
@@ -8632,11 +8641,11 @@ var dataStructureTyped = (() => {
      * 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<BinaryTreeNode<K, V>>` type. The default value for `callback` is `this._DEFAULT
+     * `NodeCallback<BinaryTreeNode<K, V> | null>` 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, BinaryTreeNode<K, V>>} startNode - The `startNode` parameter in the `morris`
+     * @param {K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  } 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
@@ -8740,21 +8749,6 @@ var dataStructureTyped = (() => {
       this._clone(cloned);
       return cloned;
     }
-    _clone(cloned) {
-      this.bfs(
-        (node) => {
-          if (node === null) cloned.add(null);
-          else {
-            if (this._isMapMode) cloned.add([node.key, this._store.get(node.key)]);
-            else cloned.add([node.key, node.value]);
-          }
-        },
-        this._root,
-        this.iterationType,
-        true
-      );
-      if (this._isMapMode) cloned._store = this._store;
-    }
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -8814,7 +8808,7 @@ var dataStructureTyped = (() => {
      *
      * 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, BinaryTreeNode<K, V>>} startNode - The `startNode` parameter in the
+     * @param {K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  } 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
@@ -8858,7 +8852,7 @@ var dataStructureTyped = (() => {
      * 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, BinaryTreeNode<K, V>>} startNode - The `startNode` parameter in the
+     * @param {K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  } 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
@@ -8866,21 +8860,36 @@ var dataStructureTyped = (() => {
     print(options, startNode = this._root) {
       console.log(this.toVisual(startNode, options));
     }
+    _clone(cloned) {
+      this.bfs(
+        (node) => {
+          if (node === null) cloned.add(null);
+          else {
+            if (this._isMapMode) cloned.add([node.key, this._store.get(node.key)]);
+            else cloned.add([node.key, node.value]);
+          }
+        },
+        this._root,
+        this.iterationType,
+        true
+      );
+      if (this._isMapMode) cloned._store = this._store;
+    }
     /**
      * 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, BinaryTreeNode<K, V>>} keyNodeOrEntry - The
+     * @param {K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  } 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
+     * can be of type `K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  ` 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<BinaryTreeNode<K, V>>`) based on the input parameters provided. The function checks the type of the
+     * (`BinaryTreeNode<K, V> | null | undefined`) 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.
      */
@@ -8901,45 +8910,48 @@ var dataStructureTyped = (() => {
      * Time complexity: O(n)
      * Space complexity: O(n)
      *
-     * The `_dfs` function performs a depth-first search traversal on a binary tree structure based on
-     * the specified order pattern and callback function.
+     * The `_dfs` function performs a depth-first search traversal on a binary tree, with customizable
+     * options for traversal order and node processing.
      * @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<BinaryTreeNode<K, V>>>`. The default value for this parameter is `this._DEFAULT
+     * called on each node visited during the depth-first search traversal. It is a generic type `C` that
+     * extends `NodeCallback<BinaryTreeNode<K, V> | null>`. The default value for `callback`
      * @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, 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
+     * order in which the nodes are visited during a depth-first search traversal. It can have one of the
+     * following values:
+     * @param {boolean} [onlyOne=false] - The `onlyOne` parameter in the `_dfs` method is a boolean flag
+     * that determines whether the traversal should stop after processing a single node. If `onlyOne` is
+     * set to `true`, the traversal will return as soon as a single node is processed. If it is set to
+     * `false
+     * @param {K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined}
+     * startNode - The `startNode` parameter in the `_dfs` method is used to specify the starting node
+     * for the depth-first search traversal. It can be provided in different forms:
      * @param {IterationType} iterationType - The `iterationType` parameter in the `_dfs` method
-     * specifies the type of iteration to be performed during the Depth-First Search (DFS) traversal of a
-     * binary tree. It can have two possible values:
-     * @param [includeNull=false] - The `includeNull` parameter in the `_dfs` method is a boolean flag
-     * that determines whether null nodes should be included in the depth-first search traversal. If
-     * `includeNull` is set to `true`, null nodes will be considered during the traversal process. If it
-     * is set to `false`,
-     * @param shouldVisitLeft - The `shouldVisitLeft` parameter is a function that takes a node as input
-     * and returns a boolean value. It is used to determine whether the left child of a node should be
-     * visited during the depth-first search traversal. By default, it checks if the node is truthy (not
-     * null or undefined
-     * @param shouldVisitRight - The `shouldVisitRight` parameter is a function that takes a node as an
-     * argument and returns a boolean value. It is used to determine whether the right child of a node
-     * should be visited during the depth-first search traversal. The default implementation checks if
-     * the node is truthy before visiting the right child
-     * @param shouldVisitRoot - The `shouldVisitRoot` parameter is a function that takes a node as an
-     * argument and returns a boolean value. It is used to determine whether the root node should be
-     * visited during the depth-first search traversal based on certain conditions. The default
-     * implementation checks if the node is a real node or null based
-     * @param shouldProcessRoot - The `shouldProcessRoot` parameter is a function that takes a node as an
-     * argument and returns a boolean value indicating whether the node should be processed during the
-     * depth-first search traversal. The default implementation checks if the node is a real node or null
-     * based on the `includeNull` flag. If `
-     * @returns The function `_dfs` returns an array of the return type of the callback function provided
-     * as input.
-     */
-    _dfs(callback = this._DEFAULT_NODE_CALLBACK, pattern = "IN", startNode = this._root, iterationType = this.iterationType, includeNull = false, shouldVisitLeft = (node) => !!node, shouldVisitRight = (node) => !!node, shouldVisitRoot = (node) => {
+     * specifies whether the traversal should be done recursively or iteratively. It can have two
+     * possible values:
+     * @param [includeNull=false] - The `includeNull` parameter in the `_dfs` method determines whether
+     * null nodes should be included in the traversal process. If `includeNull` is set to `true`, the
+     * method will consider null nodes as valid nodes to visit or process. If `includeNull` is set to
+     * `false`,
+     * @param shouldVisitLeft - The `shouldVisitLeft` parameter in the `_dfs` method is a function that
+     * determines whether the left child of a node should be visited during the Depth-First Search
+     * traversal. By default, it checks if the node is not null or undefined before visiting the left
+     * child. You can customize this behavior
+     * @param shouldVisitRight - The `shouldVisitRight` parameter in the `_dfs` method is a function that
+     * determines whether to visit the right child node of the current node during a depth-first search
+     * traversal. The default implementation of this function checks if the node is not null or undefined
+     * before deciding to visit it.
+     * @param shouldVisitRoot - The `shouldVisitRoot` parameter in the `_dfs` method is a function that
+     * determines whether a given node should be visited during the depth-first search traversal. The
+     * function takes a node as an argument and returns a boolean value indicating whether the node
+     * should be visited.
+     * @param shouldProcessRoot - The `shouldProcessRoot` parameter in the `_dfs` method is a function
+     * that determines whether the root node should be processed during the Depth-First Search traversal.
+     * It takes a node (BinaryTreeNode<K, V> | null | undefined) as input and returns a boolean value. If
+     * the function
+     * @returns The `_dfs` method returns an array of the return type of the provided callback function
+     * `C`.
+     */
+    _dfs(callback = this._DEFAULT_NODE_CALLBACK, pattern = "IN", onlyOne = false, startNode = this._root, iterationType = this.iterationType, includeNull = false, shouldVisitLeft = (node) => !!node, shouldVisitRight = (node) => !!node, shouldVisitRoot = (node) => {
       if (includeNull) return this.isRealNodeOrNull(node);
       return this.isRealNode(node);
     }, shouldProcessRoot = (node) => this.isRealNodeOrNull(node)) {
@@ -8950,26 +8962,35 @@ var dataStructureTyped = (() => {
         const dfs = (node) => {
           if (!shouldVisitRoot(node)) return;
           const visitLeft = () => {
-            if (shouldVisitLeft(node)) dfs(node == null ? void 0 : node.left);
+            if (shouldVisitLeft(node) && (node == null ? void 0 : node.left) !== void 0) dfs(node == null ? void 0 : node.left);
           };
           const visitRight = () => {
-            if (shouldVisitRight(node)) dfs(node == null ? void 0 : node.right);
+            if (shouldVisitRight(node) && (node == null ? void 0 : node.right) !== void 0) dfs(node == null ? void 0 : node.right);
           };
           switch (pattern) {
             case "IN":
               visitLeft();
-              if (shouldProcessRoot(node)) ans.push(callback(node));
+              if (shouldProcessRoot(node)) {
+                ans.push(callback(node));
+                if (onlyOne) return;
+              }
               visitRight();
               break;
             case "PRE":
-              if (shouldProcessRoot(node)) ans.push(callback(node));
+              if (shouldProcessRoot(node)) {
+                ans.push(callback(node));
+                if (onlyOne) return;
+              }
               visitLeft();
               visitRight();
               break;
             case "POST":
               visitLeft();
               visitRight();
-              if (shouldProcessRoot(node)) ans.push(callback(node));
+              if (shouldProcessRoot(node)) {
+                ans.push(callback(node));
+                if (onlyOne) return;
+              }
               break;
           }
         };
@@ -8992,7 +9013,10 @@ var dataStructureTyped = (() => {
           if (cur === void 0) continue;
           if (!shouldVisitRoot(cur.node)) continue;
           if (cur.opt === 1 /* PROCESS */) {
-            if (shouldProcessRoot(cur.node)) ans.push(callback(cur.node));
+            if (shouldProcessRoot(cur.node) && cur.node !== void 0) {
+              ans.push(callback(cur.node));
+              if (onlyOne) return ans;
+            }
           } else {
             switch (pattern) {
               case "IN":
@@ -9119,12 +9143,12 @@ var dataStructureTyped = (() => {
      * Space Complexity: O(1)
      *
      * The _swapProperties function swaps key and value properties between two nodes in a binary tree.
-     * @param {BTNRep<K, V, BinaryTreeNode<K, V>>} srcNode - The `srcNode` parameter in the
+     * @param {K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  } 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, BinaryTreeNode<K, V>>} destNode - The `destNode` parameter in the
+     * @param {K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  } 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, BinaryTreeNode<K, V>>` or `R`. The method ensures that
+     * the `srcNode`. It can be of type `K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  ` 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.
@@ -9181,7 +9205,7 @@ var dataStructureTyped = (() => {
      *
      * 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<BinaryTreeNode<K, V>>`, which means
+     * @param v - The parameter `v` in the `_setRoot` method is of type `BinaryTreeNode<K, V> | null | undefined`, which means
      * it can either be an optional `BinaryTreeNode<K, V>` type or `null`.
      */
     _setRoot(v) {
@@ -9196,7 +9220,7 @@ var dataStructureTyped = (() => {
      *
      * 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, BinaryTreeNode<K, V>> | NodePredicate<BinaryTreeNode<K, V>>} keyNodeEntryOrPredicate - The
+     * @param {K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined   | NodePredicate<BinaryTreeNode<K, V>>} keyNodeEntryOrPredicate - The
      * `_ensurePredicate` method in the provided code snippet is responsible for ensuring that the input
      * parameter `keyNodeEntryOrPredicate` is transformed into a valid predicate function that can be
      * used for filtering nodes in a binary tree.
@@ -9210,9 +9234,15 @@ var dataStructureTyped = (() => {
         return (node) => node === keyNodeEntryOrPredicate;
       if (this.isEntry(keyNodeEntryOrPredicate)) {
         const [key] = keyNodeEntryOrPredicate;
-        return (node) => node.key === key;
+        return (node) => {
+          if (!node) return false;
+          return node.key === key;
+        };
       }
-      return (node) => node.key === keyNodeEntryOrPredicate;
+      return (node) => {
+        if (!node) return false;
+        return node.key === keyNodeEntryOrPredicate;
+      };
     }
     /**
      * Time Complexity: O(1)
@@ -9235,8 +9265,8 @@ var dataStructureTyped = (() => {
      *
      * 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, 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>>`,
+     * @param {K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  } keyNodeOrEntry - The `_extractKey` method you provided is a
+     * TypeScript method that takes in a parameter `keyNodeOrEntry` of type `K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  `,
      * 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
@@ -9331,7 +9361,7 @@ var dataStructureTyped = (() => {
      * This TypeScript constructor initializes a binary search tree with optional options and adds
      * elements if provided.
      * @param keysNodesEntriesOrRaws - The `keysNodesEntriesOrRaws` parameter in the constructor is an
-     * iterable that can contain elements of type `BTNRep<K, V, BSTNode<K, V>>` or `R`. It is used to
+     * iterable that can contain elements of type `K |  BSTNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  ` or `R`. It is used to
      * initialize the binary search tree with keys, nodes, entries, or raw data.
      * @param [options] - The `options` parameter is an optional object that can contain the following
      * properties:
@@ -9417,7 +9447,7 @@ var dataStructureTyped = (() => {
      *
      * The function ensures the existence of a node in a data structure and returns it, or undefined if
      * it doesn't exist.
-     * @param {BTNRep<K, V, BSTNode<K, V>>} keyNodeOrEntry - The parameter
+     * @param {K |  BSTNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  } keyNodeOrEntry - The parameter
      * `keyNodeOrEntry` can accept a value of type `R`, which represents the key, node,
      * entry, or raw element that needs to be ensured in the tree.
      * @param {IterationType} [iterationType=ITERATIVE] - The `iterationType` parameter is an optional
@@ -9435,8 +9465,8 @@ var dataStructureTyped = (() => {
      * Space Complexity: O(1)
      *
      * The function checks if the input is an instance of the BSTNode class.
-     * @param {BTNRep<K, V, BSTNode<K, V>>} keyNodeOrEntry - The parameter
-     * `keyNodeOrEntry` can be of type `R` or `BTNRep<K, V, BSTNode<K, V>>`.
+     * @param {K |  BSTNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  } keyNodeOrEntry - The parameter
+     * `keyNodeOrEntry` can be of type `R` or `K |  BSTNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  `.
      * @returns a boolean value indicating whether the input parameter `keyNodeOrEntry` is
      * an instance of the `BSTNode` class.
      */
@@ -9462,8 +9492,8 @@ var dataStructureTyped = (() => {
      * Space Complexity: O(log n)
      *
      * The `add` function in TypeScript adds a new node to a binary search tree based on the key value.
-     * @param {BTNRep<K, V, BSTNode<K, V>>} keyNodeOrEntry - The parameter
-     * `keyNodeOrEntry` can accept a value of type `R` or `BTNRep<K, V, BSTNode<K, V>>`.
+     * @param {K |  BSTNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  } keyNodeOrEntry - The parameter
+     * `keyNodeOrEntry` can accept a value of type `R` or `K |  BSTNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  `.
      * @param {V} [value] - The `value` parameter is an optional value that can be associated with the
      * key in the binary search tree. If provided, it will be stored in the node along with the key.
      * @returns a boolean value.
@@ -9616,7 +9646,7 @@ var dataStructureTyped = (() => {
      *
      * The function `search` in TypeScript overrides the search behavior in a binary tree structure based
      * on specified criteria.
-     * @param {BTNRep<K, V, BSTNode<K, V>> | NodePredicate<BSTNode<K, V>>} keyNodeEntryOrPredicate - The
+     * @param {K |  BSTNode<K, V> | [K | null | undefined, V | undefined] | null | undefined   | NodePredicate<BSTNode<K, V>>} keyNodeEntryOrPredicate - The
      * `keyNodeEntryOrPredicate` parameter in the `override search` method can accept one of the
      * following types:
      * @param [onlyOne=false] - The `onlyOne` parameter is a boolean flag that determines whether the
@@ -9624,9 +9654,9 @@ var dataStructureTyped = (() => {
      * search will return as soon as a matching node is found. If `onlyOne` is set to `false`, the
      * @param {C} callback - The `callback` parameter in the `override search` function is a function
      * that will be called on each node that matches the search criteria. It is of type `C`, which
-     * extends `NodeCallback<BSTNode<K, V>>`. The callback function should accept a node of type `BSTNode<K, V>` as its
+     * extends `NodeCallback<BSTNode<K, V> | null>`. The callback function should accept a node of type `BSTNode<K, V>` as its
      * argument and
-     * @param {BTNRep<K, V, BSTNode<K, V>>} startNode - The `startNode` parameter in the `override search`
+     * @param {K |  BSTNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  } startNode - The `startNode` parameter in the `override search`
      * method represents the node from which the search operation will begin. It is the starting point
      * for searching within the tree data structure. The method ensures that the `startNode` is a valid
      * node before proceeding with the search operation. If the `
@@ -9646,75 +9676,58 @@ var dataStructureTyped = (() => {
       let predicate;
       const isRange = this.isRange(keyNodeEntryOrPredicate);
       if (isRange) {
-        predicate = (node) => keyNodeEntryOrPredicate.isInRange(node.key, this._comparator);
+        predicate = (node) => {
+          if (!node) return false;
+          return keyNodeEntryOrPredicate.isInRange(node.key, this._comparator);
+        };
       } else {
         predicate = this._ensurePredicate(keyNodeEntryOrPredicate);
       }
-      const isToLeftByRange = (cur) => {
+      const shouldVisitLeft = (cur) => {
+        if (!cur) return false;
+        if (!this.isRealNode(cur.left)) return false;
         if (isRange) {
           const range = keyNodeEntryOrPredicate;
           const leftS = this.isReverse ? range.high : range.low;
           const leftI = this.isReverse ? range.includeHigh : range.includeLow;
           return leftI && this._compare(cur.key, leftS) >= 0 || !leftI && this._compare(cur.key, leftS) > 0;
         }
-        return false;
+        if (!isRange && !this._isPredicate(keyNodeEntryOrPredicate)) {
+          const benchmarkKey = this._extractKey(keyNodeEntryOrPredicate);
+          return benchmarkKey !== null && benchmarkKey !== void 0 && this._compare(cur.key, benchmarkKey) > 0;
+        }
+        return true;
       };
-      const isToRightByRange = (cur) => {
+      const shouldVisitRight = (cur) => {
+        if (!cur) return false;
+        if (!this.isRealNode(cur.right)) return false;
         if (isRange) {
           const range = keyNodeEntryOrPredicate;
           const rightS = this.isReverse ? range.low : range.high;
           const rightI = this.isReverse ? range.includeLow : range.includeLow;
           return rightI && this._compare(cur.key, rightS) <= 0 || !rightI && this._compare(cur.key, rightS) < 0;
         }
-        return false;
+        if (!isRange && !this._isPredicate(keyNodeEntryOrPredicate)) {
+          const benchmarkKey = this._extractKey(keyNodeEntryOrPredicate);
+          return benchmarkKey !== null && benchmarkKey !== void 0 && this._compare(cur.key, benchmarkKey) < 0;
+        }
+        return true;
       };
-      const ans = [];
-      if (iterationType === "RECURSIVE") {
-        const dfs = (cur) => {
-          if (predicate(cur)) {
-            ans.push(callback(cur));
-            if (onlyOne) return;
-          }
-          if (!this.isRealNode(cur.left) && !this.isRealNode(cur.right)) return;
-          if (isRange) {
-            if (this.isRealNode(cur.left) && isToLeftByRange(cur)) dfs(cur.left);
-            if (this.isRealNode(cur.right) && isToRightByRange(cur)) dfs(cur.right);
-          } else if (!this._isPredicate(keyNodeEntryOrPredicate)) {
-            const benchmarkKey = this._extractKey(keyNodeEntryOrPredicate);
-            if (this.isRealNode(cur.left) && benchmarkKey !== null && benchmarkKey !== void 0 && this._compare(cur.key, benchmarkKey) > 0)
-              dfs(cur.left);
-            if (this.isRealNode(cur.right) && benchmarkKey !== null && benchmarkKey !== void 0 && this._compare(cur.key, benchmarkKey) < 0)
-              dfs(cur.right);
-          } else {
-            if (this.isRealNode(cur.left)) dfs(cur.left);
-            if (this.isRealNode(cur.right)) dfs(cur.right);
-          }
-        };
-        dfs(startNode);
-      } else {
-        const stack = [startNode];
-        while (stack.length > 0) {
-          const cur = stack.pop();
-          if (predicate(cur)) {
-            ans.push(callback(cur));
-            if (onlyOne) return ans;
-          }
-          if (isRange) {
-            if (this.isRealNode(cur.left) && isToLeftByRange(cur)) stack.push(cur.left);
-            if (this.isRealNode(cur.right) && isToRightByRange(cur)) stack.push(cur.right);
-          } else if (!this._isPredicate(keyNodeEntryOrPredicate)) {
-            const benchmarkKey = this._extractKey(keyNodeEntryOrPredicate);
-            if (this.isRealNode(cur.right) && benchmarkKey !== null && benchmarkKey !== void 0 && this._compare(cur.key, benchmarkKey) < 0)
-              stack.push(cur.right);
-            if (this.isRealNode(cur.left) && benchmarkKey !== null && benchmarkKey !== void 0 && this._compare(cur.key, benchmarkKey) > 0)
-              stack.push(cur.left);
-          } else {
-            if (this.isRealNode(cur.right)) stack.push(cur.right);
-            if (this.isRealNode(cur.left)) stack.push(cur.left);
-          }
+      return super._dfs(
+        callback,
+        "IN",
+        onlyOne,
+        startNode,
+        iterationType,
+        false,
+        shouldVisitLeft,
+        shouldVisitRight,
+        () => true,
+        (cur) => {
+          if (cur) return predicate(cur);
+          return false;
         }
-      }
-      return ans;
+      );
     }
     /**
      * Time Complexity: O(log n)
@@ -9725,9 +9738,9 @@ var dataStructureTyped = (() => {
      * either a `Range` object or an array of two elements representing the range boundaries.
      * @param {C} callback - The `callback` parameter in the `rangeSearch` function is a callback
      * function that is used to process each node that is found within the specified range during the
-     * search operation. It is of type `NodeCallback<BSTNode<K, V>>`, where `BSTNode<K, V>` is the type of nodes in the
+     * search operation. It is of type `NodeCallback<BSTNode<K, V> | null>`, where `BSTNode<K, V>` is the type of nodes in the
      * data structure.
-     * @param {BTNRep<K, V, BSTNode<K, V>>} startNode - The `startNode` parameter in the `rangeSearch`
+     * @param {K |  BSTNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  } startNode - The `startNode` parameter in the `rangeSearch`
      * function represents the node from which the search for nodes within the specified range will
      * begin. It is the starting point for the range search operation.
      * @param {IterationType} iterationType - The `iterationType` parameter in the `rangeSearch` function
@@ -9746,8 +9759,8 @@ var dataStructureTyped = (() => {
      * Space Complexity: O(log n)
      *
      * This function retrieves a node based on a given keyNodeEntryOrPredicate within a binary search tree structure.
-     * @param {BTNRep<K, V, BSTNode<K, V>> | NodePredicate<BSTNode<K, V>>} keyNodeEntryOrPredicate - The `keyNodeEntryOrPredicate`
-     * parameter can be of type `BTNRep<K, V, BSTNode<K, V>>`, `R`, or `NodePredicate<BSTNode<K, V>>`.
+     * @param {K |  BSTNode<K, V> | [K | null | undefined, V | undefined] | null | undefined   | NodePredicate<BSTNode<K, V>>} keyNodeEntryOrPredicate - The `keyNodeEntryOrPredicate`
+     * parameter can be of type `K |  BSTNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  `, `R`, or `NodePredicate<BSTNode<K, V>>`.
      * @param {BSTNOptKeyOrNode<K, BSTNode<K, V>>} startNode - The `startNode` parameter in the `getNode` method
      * is used to specify the starting point for searching nodes in the binary search tree. If no
      * specific starting point is provided, the default value is set to `this._root`, which is the root
@@ -9769,24 +9782,30 @@ var dataStructureTyped = (() => {
      * Time complexity: O(n)
      * Space complexity: O(n)
      *
-     * The function overrides the depth-first search method and returns an array of the return types of
-     * the callback function.
+     * The function `dfs` in TypeScript overrides the base class method with default parameters and
+     * returns the result of the super class `dfs` method.
      * @param {C} callback - The `callback` parameter is a function that will be called for each node
-     * during the depth-first search traversal. It is an optional parameter and defaults to
-     * `this._DEFAULT_NODE_CALLBACK`. The type `C` represents the type of the callback function.
-     * @param {DFSOrderPattern} [pattern=IN] - The "pattern" parameter in the code snippet refers to the
-     * order in which the Depth-First Search (DFS) algorithm visits the nodes in a tree or graph. It can
-     * take one of the following values:
-     * @param {BTNRep<K, V, BSTNode<K, V>>} startNode - The `startNode` parameter is the starting
-     * point for the depth-first search traversal. It can be either a root node, a key-value pair, or a
-     * node entry. If not specified, the default value is the root of the tree.
-     * @param {IterationType} [iterationType=ITERATIVE] - The `iterationType` parameter specifies the
-     * type of iteration to be used during the Depth-First Search (DFS) traversal. It can have one of the
-     * following values:
-     * @returns The method is returning an array of the return type of the callback function.
+     * visited during the Depth-First Search traversal. It is a generic type `C` that extends the
+     * `NodeCallback` interface for `BSTNode<K, V>`. The default value for `callback` is `this._
+     * @param {DFSOrderPattern} [pattern=IN] - The `pattern` parameter in the `override dfs` method
+     * specifies the order in which the Depth-First Search (DFS) traversal should be performed on the
+     * Binary Search Tree (BST). The possible values for the `pattern` parameter are:
+     * @param {boolean} [onlyOne=false] - The `onlyOne` parameter in the `override dfs` method is a
+     * boolean flag that indicates whether you want to stop the depth-first search traversal after
+     * finding the first matching node or continue searching for all matching nodes. If `onlyOne` is set
+     * to `true`, the traversal will stop after finding
+     * @param {K | BSTNode<K, V> | [K | null | undefined, V | undefined] | null | undefined} startNode -
+     * The `startNode` parameter in the `override dfs` method can be one of the following types:
+     * @param {IterationType} iterationType - The `iterationType` parameter in the `override dfs` method
+     * specifies the type of iteration to be performed during the Depth-First Search (DFS) traversal of a
+     * Binary Search Tree (BST). It is used to determine the order in which nodes are visited during the
+     * traversal. The possible values for `
+     * @returns The `override` function is returning the result of calling the `dfs` method from the
+     * superclass, with the provided arguments `callback`, `pattern`, `onlyOne`, `startNode`, and
+     * `iterationType`. The return type is an array of the return type of the callback function `C`.
      */
-    dfs(callback = this._DEFAULT_NODE_CALLBACK, pattern = "IN", startNode = this._root, iterationType = this.iterationType) {
-      return super.dfs(callback, pattern, startNode, iterationType);
+    dfs(callback = this._DEFAULT_NODE_CALLBACK, pattern = "IN", onlyOne = false, startNode = this._root, iterationType = this.iterationType) {
+      return super.dfs(callback, pattern, onlyOne, startNode, iterationType);
     }
     /**
      * Time complexity: O(n)
@@ -9797,7 +9816,7 @@ var dataStructureTyped = (() => {
      * @param {C} callback - The `callback` parameter is a function that will be called for each node
      * visited during the breadth-first search. It should take a single argument, which is the current
      * node being visited, and it can return a value of any type.
-     * @param {BTNRep<K, V, BSTNode<K, V>>} startNode - The `startNode` parameter is the starting
+     * @param {K |  BSTNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  } startNode - The `startNode` parameter is the starting
      * point for the breadth-first search. It can be either a root node, a key-value pair, or an entry
      * object. If no value is provided, the default value is the root of the tree.
      * @param {IterationType} iterationType - The `iterationType` parameter is used to specify the type
@@ -9815,9 +9834,9 @@ var dataStructureTyped = (() => {
      * The function overrides the listLevels method from the superclass and returns an array of arrays
      * containing the results of the callback function applied to each level of the tree.
      * @param {C} callback - The `callback` parameter is a generic type `C` that extends
-     * `NodeCallback<BSTNode<K, V>>`. It represents a callback function that will be called for each node in the
+     * `NodeCallback<BSTNode<K, V> | null>`. It represents a callback function that will be called for each node in the
      * tree during the iteration process.
-     * @param {BTNRep<K, V, BSTNode<K, V>>} startNode - The `startNode` parameter is the starting
+     * @param {K |  BSTNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  } startNode - The `startNode` parameter is the starting
      * point for listing the levels of the binary tree. It can be either a root node of the tree, a
      * key-value pair representing a node in the tree, or a key representing a node in the tree. If no
      * value is provided, the root of
@@ -9841,7 +9860,7 @@ var dataStructureTyped = (() => {
      * @param {CP} lesserOrGreater - The `lesserOrGreater` parameter is used to determine whether to
      * traverse nodes that are lesser, greater, or both than the `targetNode`. It accepts the values -1,
      * 0, or 1, where:
-     * @param {BTNRep<K, V, BSTNode<K, V>>} targetNode - The `targetNode` parameter is the node in
+     * @param {K |  BSTNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  } targetNode - The `targetNode` parameter is the node in
      * the binary tree that you want to start traversing from. It can be specified either by providing
      * the key of the node, the node itself, or an entry containing the key and value of the node. If no
      * `targetNode` is provided,
@@ -9900,8 +9919,8 @@ var dataStructureTyped = (() => {
           if (l > r) return;
           const m = l + Math.floor((r - l) / 2);
           const midNode = sorted[m];
-          if (this._isMapMode) this.add(midNode.key);
-          else this.add([midNode.key, midNode.value]);
+          if (this._isMapMode && midNode !== null) this.add(midNode.key);
+          else if (midNode !== null) this.add([midNode.key, midNode.value]);
           buildBalanceBST(l, m - 1);
           buildBalanceBST(m + 1, r);
         };
@@ -9916,8 +9935,8 @@ var dataStructureTyped = (() => {
             if (l <= r) {
               const m = l + Math.floor((r - l) / 2);
               const midNode = sorted[m];
-              if (this._isMapMode) this.add(midNode.key);
-              else this.add([midNode.key, midNode.value]);
+              if (this._isMapMode && midNode !== null) this.add(midNode.key);
+              else if (midNode !== null) this.add([midNode.key, midNode.value]);
               stack.push([m + 1, r]);
               stack.push([l, m - 1]);
             }
@@ -10020,8 +10039,8 @@ var dataStructureTyped = (() => {
      * Space Complexity: O(1)
      *
      * The function overrides a method and converts a key, value pair or entry or raw element to a node.
-     * @param {BTNRep<K, V, BSTNode<K, V>>} keyNodeOrEntry - A variable that can be of
-     * type R or BTNRep<K, V, BSTNode<K, V>>. It represents either a key, a node, an entry, or a raw
+     * @param {K |  BSTNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  } keyNodeOrEntry - A variable that can be of
+     * type R or K |  BSTNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  . It represents either a key, a node, an entry, or a raw
      * element.
      * @param {V} [value] - The `value` parameter is an optional value of type `V`. It represents the
      * value associated with a key in a key-value pair.
@@ -10669,7 +10688,8 @@ var dataStructureTyped = (() => {
      * This TypeScript constructor initializes an AVLTree with keys, nodes, entries, or raw data provided
      * in an iterable format.
      * @param keysNodesEntriesOrRaws - The `keysNodesEntriesOrRaws` parameter in the constructor is an
-     * iterable that can contain either `BTNRep<K, V, AVLTreeNode<K, V>>` objects or `R` objects. It is
+     * iterable that can contain either `
+     K | AVLTreeNode<K, V> | [K | null | undefined, V | undefined]  | null | undefined ` objects or `R` objects. It is
      * used to initialize the AVLTree with key-value pairs or raw data entries. If provided
      * @param [options] - The `options` parameter in the constructor is of type `AVLTreeOptions<K, V,
      * R>`. It is an optional parameter that allows you to specify additional options for configuring the
@@ -10719,8 +10739,9 @@ var dataStructureTyped = (() => {
      * Space Complexity: O(1)
      *
      * The function checks if the input is an instance of AVLTreeNode.
-     * @param {BTNRep<K, V, AVLTreeNode<K, V>>} keyNodeOrEntry - The parameter
-     * `keyNodeOrEntry` can be of type `R` or `BTNRep<K, V, AVLTreeNode<K, V>>`.
+     * @param {K | AVLTreeNode<K, V> | [K | null | undefined, V | undefined]  | null | undefined } keyNodeOrEntry - The parameter
+     * `keyNodeOrEntry` can be of type `R` or `
+     K | AVLTreeNode<K, V> | [K | null | undefined, V | undefined]  | null | undefined `.
      * @returns a boolean value indicating whether the input parameter `keyNodeOrEntry` is
      * an instance of the `AVLTreeNode` class.
      */
@@ -10733,8 +10754,9 @@ var dataStructureTyped = (() => {
      *
      * The function overrides the add method of a class and inserts a key-value pair into a data
      * structure, then balances the path.
-     * @param {BTNRep<K, V, AVLTreeNode<K, V>>} keyNodeOrEntry - The parameter
-     * `keyNodeOrEntry` can accept values of type `R`, `BTNRep<K, V, AVLTreeNode<K, V>>`
+     * @param { K | AVLTreeNode<K, V> | [K | null | undefined, V | undefined]  | null | undefined } keyNodeOrEntry - The parameter
+     * `keyNodeOrEntry` can accept values of type `R`, `
+     K | AVLTreeNode<K, V> | [K | null | undefined, V | undefined]  | null | undefined `
      * @param {V} [value] - The `value` parameter is an optional value that you want to associate with
      * the key or node being added to the data structure.
      * @returns The method is returning a boolean value.
@@ -10751,7 +10773,7 @@ var dataStructureTyped = (() => {
      *
      * The function overrides the delete method in a TypeScript class, performs deletion, and then
      * balances the tree if necessary.
-     * @param {BTNRep<K, V, AVLTreeNode<K, V>>} keyNodeOrEntry - The `keyNodeOrEntry`
+     * @param { K | AVLTreeNode<K, V> | [K | null | undefined, V | undefined]  | null | undefined } keyNodeOrEntry - The `keyNodeOrEntry`
      * parameter in the `override delete` method can be one of the following types:
      * @returns The `delete` method is being overridden in this code snippet. It first calls the `delete`
      * method from the superclass (presumably a parent class) with the provided `predicate`, which could
@@ -11035,8 +11057,9 @@ var dataStructureTyped = (() => {
      *
      * The `_balancePath` function is used to update the heights of nodes and perform rotation operations
      * to restore balance in an AVL tree after inserting a node.
-     * @param {BTNRep<K, V, AVLTreeNode<K, V>>} node - The `node` parameter can be of type `R` or
-     * `BTNRep<K, V, AVLTreeNode<K, V>>`.
+     * @param { K | AVLTreeNode<K, V> | [K | null | undefined, V | undefined]  | null | undefined } node - The `node` parameter can be of type `R` or
+     * `
+     K | AVLTreeNode<K, V> | [K | null | undefined, V | undefined]  | null | undefined `.
      */
     _balancePath(node) {
       node = this.ensureNode(node);
@@ -11129,7 +11152,7 @@ var dataStructureTyped = (() => {
      * This TypeScript constructor initializes a Red-Black Tree with optional keys, nodes, entries, or
      * raw data.
      * @param keysNodesEntriesOrRaws - The `keysNodesEntriesOrRaws` parameter in the constructor is an
-     * iterable that can contain either `BTNRep<K, V, RedBlackTreeNode<K, V>>` objects or `R` objects. It
+     * iterable that can contain either `K | RedBlackTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined` objects or `R` objects. It
      * is used to initialize the Red-Black Tree with keys, nodes, entries, or
      * @param [options] - The `options` parameter in the constructor is of type `RedBlackTreeOptions<K,
      * V, R>`. It is an optional parameter that allows you to specify additional options for the
@@ -11189,8 +11212,8 @@ var dataStructureTyped = (() => {
      * Space Complexity: O(1)
      *
      * The function checks if the input is an instance of the RedBlackTreeNode class.
-     * @param {BTNRep<K, V, RedBlackTreeNode<K, V>>} keyNodeOrEntry - The parameter
-     * `keyNodeOrEntry` can be of type `R` or `BTNRep<K, V, RedBlackTreeNode<K, V>>`.
+     * @param {K | RedBlackTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined} keyNodeOrEntry - The parameter
+     * `keyNodeOrEntry` can be of type `R` or `K | RedBlackTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined`.
      * @returns a boolean value indicating whether the input parameter `keyNodeOrEntry` is
      * an instance of the `RedBlackTreeNode` class.
      */
@@ -11214,8 +11237,8 @@ var dataStructureTyped = (() => {
      *
      * The function adds a new node to a binary search tree and returns true if the node was successfully
      * added.
-     * @param {BTNRep<K, V, RedBlackTreeNode<K, V>>} keyNodeOrEntry - The parameter
-     * `keyNodeOrEntry` can accept a value of type `R` or `BTNRep<K, V, RedBlackTreeNode<K, V>>`.
+     * @param {K | RedBlackTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined} keyNodeOrEntry - The parameter
+     * `keyNodeOrEntry` can accept a value of type `R` or `K | RedBlackTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined`.
      * @param {V} [value] - The `value` parameter is an optional value that you want to associate with
      * the key in the data structure. It represents the value that you want to add or update in the data
      * structure.
@@ -11249,7 +11272,7 @@ var dataStructureTyped = (() => {
      *
      * The function overrides the delete method in a binary tree data structure to remove a node based on
      * a given predicate and maintain the binary search tree properties.
-     * @param {BTNRep<K, V, RedBlackTreeNode<K, V>>} keyNodeOrEntry - The `keyNodeOrEntry`
+     * @param {K | RedBlackTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined} keyNodeOrEntry - The `keyNodeOrEntry`
      * parameter in the `override delete` method is used to specify the condition or key based on which a
      * node should be deleted from the binary tree. It can be a key, a node, an entry, or a predicate
      * function that determines which node(s) should be deleted.
@@ -11715,7 +11738,7 @@ var dataStructureTyped = (() => {
      *
      * The function `add` in TypeScript overrides the superclass method to add key-value pairs to an AVL
      * tree multi-map.
-     * @param {BTNRep<K, V[], AVLTreeMultiMapNode<K, V>> | K} keyNodeOrEntry - The `keyNodeOrEntry`
+     * @param {K | AVLTreeMultiMapNode<K, V> | [K | null | undefined, V[] | undefined] | null | undefined | K} keyNodeOrEntry - The `keyNodeOrEntry`
      * parameter in the `override add` method can be either a key-value pair entry or just a key. If it
      * is a key-value pair entry, it will be in the format `[key, values]`, where `key` is the key and
      * `values`
@@ -11762,7 +11785,7 @@ var dataStructureTyped = (() => {
      *
      * The function `deleteValue` removes a specific value from a key in an AVLTreeMultiMap data
      * structure and deletes the entire node if no values are left for that key.
-     * @param {BTNRep<K, V[], AVLTreeMultiMapNode<K, V>> | K} keyNodeOrEntry - The `keyNodeOrEntry`
+     * @param {K | AVLTreeMultiMapNode<K, V> | [K | null | undefined, V[] | undefined] | null | undefined | K} keyNodeOrEntry - The `keyNodeOrEntry`
      * parameter in the `deleteValue` function can be either a `BTNRep` object representing a key-value
      * pair in the AVLTreeMultiMapNode, or just the key itself.
      * @param {V} value - The `value` parameter in the `deleteValue` function represents the specific
@@ -11894,7 +11917,7 @@ var dataStructureTyped = (() => {
      *
      * The function `add` in TypeScript overrides the superclass method to add key-value pairs to a
      * TreeMultiMapNode, handling different input types and scenarios.
-     * @param {BTNRep<K, V[], TreeMultiMapNode<K, V>> | K} keyNodeOrEntry - The `keyNodeOrEntry`
+     * @param {K | TreeMultiMapNode<K, V> | [K | null | undefined, V[] | undefined] | null | undefined} keyNodeOrEntry - The `keyNodeOrEntry`
      * parameter in the `override add` method can be either a `BTNRep` object containing a key, an array
      * of values, and a `TreeMultiMapNode`, or just a key.
      * @param {V} [value] - The `value` parameter in the `override add` method represents the value that
@@ -11940,7 +11963,7 @@ var dataStructureTyped = (() => {
      *
      * The function `deleteValue` removes a specific value from a key in a TreeMultiMap data structure
      * and deletes the entire node if no values are left for that key.
-     * @param {BTNRep<K, V[], TreeMultiMapNode<K, V>> | K} keyNodeOrEntry - The `keyNodeOrEntry`
+     * @param {K | TreeMultiMapNode<K, V> | [K | null | undefined, V[] | undefined] | null | undefined} keyNodeOrEntry - The `keyNodeOrEntry`
      * parameter in the `deleteValue` function can be either a `BTNRep` object containing a key and an
      * array of values, or just a key itself.
      * @param {V} value - The `value` parameter in the `deleteValue` function represents the specific
@@ -12049,7 +12072,7 @@ var dataStructureTyped = (() => {
      */
     getComputedCount() {
       let sum = 0;
-      this.dfs((node) => sum += node.count);
+      this.dfs((node) => sum += node ? node.count : 0);
       return sum;
     }
     /**
@@ -12086,8 +12109,8 @@ var dataStructureTyped = (() => {
     }
     /**
      * The function checks if the input is an instance of the TreeCounterNode class.
-     * @param {BTNRep<K, V, TreeCounterNode<K, V>>} keyNodeOrEntry - The parameter
-     * `keyNodeOrEntry` can be of type `R` or `BTNRep<K, V, TreeCounterNode<K, V>>`.
+     * @param {K | TreeCounterNode<K, V> | [K | null | undefined, V | undefined] | null | undefined} keyNodeOrEntry - The parameter
+     * `keyNodeOrEntry` can be of type `R` or `K | TreeCounterNode<K, V> | [K | null | undefined, V | undefined] | null | undefined`.
      * @returns a boolean value indicating whether the input parameter `keyNodeOrEntry` is
      * an instance of the `TreeCounterNode` class.
      */
@@ -12100,7 +12123,7 @@ var dataStructureTyped = (() => {
      *
      * The function overrides the add method of a class and adds a new node to a data structure, updating
      * the count and returning a boolean indicating success.
-     * @param {BTNRep<K, V, TreeCounterNode<K, V>>} keyNodeOrEntry - The
+     * @param {K | TreeCounterNode<K, V> | [K | null | undefined, V | undefined] | null | undefined} keyNodeOrEntry - The
      * `keyNodeOrEntry` parameter can accept one of the following types:
      * @param {V} [value] - The `value` parameter represents the value associated with the key in the
      * data structure. It is an optional parameter, so it can be omitted if not needed.
@@ -12127,7 +12150,7 @@ var dataStructureTyped = (() => {
      *
      * The function `delete` in TypeScript overrides the deletion operation in a binary tree data
      * structure, handling cases where nodes have children and maintaining balance in the tree.
-     * @param {BTNRep<K, V, TreeCounterNode<K, V>>} keyNodeOrEntry - The `predicate`
+     * @param {K | TreeCounterNode<K, V> | [K | null | undefined, V | undefined] | null | undefined} keyNodeOrEntry - The `predicate`
      * parameter in the `delete` method is used to specify the condition or key based on which a node
      * should be deleted from the binary tree. It can be a key, a node, or an entry.
      * @param [ignoreCount=false] - The `ignoreCount` parameter in the `override delete` method is a
@@ -12253,8 +12276,8 @@ var dataStructureTyped = (() => {
           if (l > r) return;
           const m = l + Math.floor((r - l) / 2);
           const midNode = sorted[m];
-          if (this._isMapMode) this.add(midNode.key, void 0, midNode.count);
-          else this.add(midNode.key, midNode.value, midNode.count);
+          if (this._isMapMode && midNode !== null) this.add(midNode.key, void 0, midNode.count);
+          else if (midNode !== null) this.add(midNode.key, midNode.value, midNode.count);
           buildBalanceBST(l, m - 1);
           buildBalanceBST(m + 1, r);
         };
@@ -12269,8 +12292,8 @@ var dataStructureTyped = (() => {
             if (l <= r) {
               const m = l + Math.floor((r - l) / 2);
               const midNode = sorted[m];
-              if (this._isMapMode) this.add(midNode.key, void 0, midNode.count);
-              else this.add(midNode.key, midNode.value, midNode.count);
+              if (this._isMapMode && midNode !== null) this.add(midNode.key, void 0, midNode.count);
+              else if (midNode !== null) this.add(midNode.key, midNode.value, midNode.count);
               stack.push([m + 1, r]);
               stack.push([l, m - 1]);
             }
@@ -12288,7 +12311,7 @@ var dataStructureTyped = (() => {
      */
     clone() {
       const cloned = this.createTree();
-      this.bfs((node) => cloned.add(node.key, void 0, node.count));
+      this.bfs((node) => cloned.add(node === null ? null : node.key, void 0, node === null ? 0 : node.count));
       if (this._isMapMode) cloned._store = this._store;
       return cloned;
     }
@@ -12318,8 +12341,8 @@ var dataStructureTyped = (() => {
     /**
      * The function `keyValueNodeEntryRawToNodeAndValue` takes in a key, value, and count and returns a
      * node based on the input.
-     * @param {BTNRep<K, V, TreeCounterNode<K, V>>} keyNodeOrEntry - The parameter
-     * `keyNodeOrEntry` can be of type `R` or `BTNRep<K, V, TreeCounterNode<K, V>>`.
+     * @param {K | TreeCounterNode<K, V> | [K | null | undefined, V | undefined] | null | undefined} keyNodeOrEntry - The parameter
+     * `keyNodeOrEntry` can be of type `R` or `K | TreeCounterNode<K, V> | [K | null | undefined, V | undefined] | null | undefined`.
      * @param {V} [value] - The `value` parameter is an optional value that represents the value
      * associated with the key in the node. It is used when creating a new node or updating the value of
      * an existing node.
@@ -12495,8 +12518,8 @@ var dataStructureTyped = (() => {
     }
     /**
      * The function checks if the input is an instance of AVLTreeCounterNode.
-     * @param {BTNRep<K, V, AVLTreeCounterNode<K, V>>} keyNodeOrEntry - The parameter
-     * `keyNodeOrEntry` can be of type `R` or `BTNRep<K, V, AVLTreeCounterNode<K, V>>`.
+     * @param {K | AVLTreeCounterNode<K, V> | [K | null | undefined, V | undefined] | null | undefined} keyNodeOrEntry - The parameter
+     * `keyNodeOrEntry` can be of type `R` or `K | AVLTreeCounterNode<K, V> | [K | null | undefined, V | undefined] | null | undefined`.
      * @returns a boolean value indicating whether the input parameter `keyNodeOrEntry` is
      * an instance of the `AVLTreeCounterNode` class.
      */
@@ -12509,9 +12532,9 @@ var dataStructureTyped = (() => {
      *
      * The function overrides the add method of a TypeScript class to add a new node to a data structure
      * and update the count.
-     * @param {BTNRep<K, V, AVLTreeCounterNode<K, V>>} keyNodeOrEntry - The
+     * @param {K | AVLTreeCounterNode<K, V> | [K | null | undefined, V | undefined] | null | undefined} keyNodeOrEntry - The
      * `keyNodeOrEntry` parameter can accept a value of type `R`, which can be any type. It
-     * can also accept a value of type `BTNRep<K, V, AVLTreeCounterNode<K, V>>`, which represents a key, node,
+     * can also accept a value of type `K | AVLTreeCounterNode<K, V> | [K | null | undefined, V | undefined] | null | undefined`, which represents a key, node,
      * entry, or raw element
      * @param {V} [value] - The `value` parameter represents the value associated with the key in the
      * data structure. It is an optional parameter, so it can be omitted if not needed.
@@ -12536,7 +12559,7 @@ var dataStructureTyped = (() => {
      *
      * The function overrides the delete method in a binary tree data structure, handling deletion of
      * nodes and maintaining balance in the tree.
-     * @param {BTNRep<K, V, AVLTreeCounterNode<K, V>>} keyNodeOrEntry - The `predicate`
+     * @param {K | AVLTreeCounterNode<K, V> | [K | null | undefined, V | undefined] | null | undefined} keyNodeOrEntry - The `predicate`
      * parameter in the `delete` method is used to specify the condition for deleting a node from the
      * binary tree. It can be a key, node, or entry that determines which
      * node(s) should be deleted.
@@ -12611,6 +12634,7 @@ var dataStructureTyped = (() => {
     /**
      * Time Complexity: O(n log n)
      * Space Complexity: O(log n)
+     *
      * The `perfectlyBalance` function takes a sorted array of nodes and builds a balanced binary search
      * tree using either a recursive or iterative approach.
      * @param {IterationType} iterationType - The `iterationType` parameter is an optional parameter that
@@ -12698,8 +12722,8 @@ var dataStructureTyped = (() => {
     /**
      * The function `keyValueNodeEntryRawToNodeAndValue` converts a key, value, entry, or raw element into
      * a node object.
-     * @param {BTNRep<K, V, AVLTreeCounterNode<K, V>>} keyNodeOrEntry - The
-     * `keyNodeOrEntry` parameter can be of type `R` or `BTNRep<K, V, AVLTreeCounterNode<K, V>>`.
+     * @param {K | AVLTreeCounterNode<K, V> | [K | null | undefined, V | undefined] | null | undefined} keyNodeOrEntry - The
+     * `keyNodeOrEntry` parameter can be of type `R` or `K | AVLTreeCounterNode<K, V> | [K | null | undefined, V | undefined] | null | undefined`.
      * @param {V} [value] - The `value` parameter is an optional value that can be passed to the
      * `override` function. It represents the value associated with the key in the data structure. If no
      * value is provided, it will default to `undefined`.
@@ -14148,13 +14172,6 @@ var dataStructureTyped = (() => {
   };
   return __toCommonJS(src_exports);
 })();
-/**
- * data-structure-typed
- *
- * @author Tyler Zeng
- * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT License
- */
 /**
  * data-structure-typed
  *