data-structure-typed 1.52.3 → 1.52.5

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

@@ -114,6 +114,7 @@ var dataStructureTyped = (() => {
     BinaryTree: () => BinaryTree,
     BinaryTreeNode: () => BinaryTreeNode,
     Character: () => Character,
+    DFSOperation: () => DFSOperation,
     Deque: () => Deque,
     DirectedEdge: () => DirectedEdge,
     DirectedGraph: () => DirectedGraph,
@@ -196,10 +197,6 @@ var dataStructureTyped = (() => {
     *[Symbol.iterator](...args) {
       yield* __yieldStar(this._getIterator(...args));
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -212,10 +209,6 @@ var dataStructureTyped = (() => {
         yield item;
       }
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -227,10 +220,6 @@ var dataStructureTyped = (() => {
         yield item[0];
       }
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -242,10 +231,6 @@ var dataStructureTyped = (() => {
         yield item[1];
       }
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -269,10 +254,6 @@ var dataStructureTyped = (() => {
       }
       return true;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -297,14 +278,6 @@ var dataStructureTyped = (() => {
       }
       return false;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -325,10 +298,6 @@ var dataStructureTyped = (() => {
         callbackfn.call(thisArg, value, key, index++, this);
       }
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -355,10 +324,6 @@ var dataStructureTyped = (() => {
       }
       return;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -377,10 +342,6 @@ var dataStructureTyped = (() => {
       }
       return false;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -397,10 +358,6 @@ var dataStructureTyped = (() => {
       }
       return false;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -444,10 +401,6 @@ var dataStructureTyped = (() => {
       }
       return accumulator;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -455,7 +408,7 @@ var dataStructureTyped = (() => {
      * The print function logs the elements of an array to the console.
      */
     print() {
-      console.log([...this]);
+      return [...this];
     }
   };
 
@@ -486,10 +439,6 @@ var dataStructureTyped = (() => {
     get toElementFn() {
       return this._toElementFn;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -502,10 +451,6 @@ var dataStructureTyped = (() => {
     *[Symbol.iterator](...args) {
       yield* __yieldStar(this._getIterator(...args));
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -517,10 +462,6 @@ var dataStructureTyped = (() => {
         yield item;
       }
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -544,14 +485,6 @@ var dataStructureTyped = (() => {
       }
       return true;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -575,10 +508,6 @@ var dataStructureTyped = (() => {
       }
       return false;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -598,10 +527,6 @@ var dataStructureTyped = (() => {
         callbackfn.call(thisArg, item, index++, this);
       }
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -643,10 +568,6 @@ var dataStructureTyped = (() => {
       }
       return false;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -668,10 +589,6 @@ var dataStructureTyped = (() => {
       }
       return accumulator;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -679,7 +596,7 @@ var dataStructureTyped = (() => {
      * The print function logs the elements of an array to the console.
      */
     print() {
-      console.log([...this]);
+      return [...this];
     }
   };
 
@@ -760,28 +677,44 @@ var dataStructureTyped = (() => {
     const multiplier = Math.pow(10, digit);
     return Math.round(num * multiplier) / multiplier;
   };
-  function isComparable(key) {
-    const keyType = typeof key;
-    if (keyType === "number")
-      return !isNaN(key);
-    if (keyType === "string")
-      return true;
-    if (keyType === "bigint")
-      return true;
-    if (keyType === "boolean")
-      return true;
-    if (keyType === "symbol")
+  function isPrimitiveComparable(value) {
+    const valueType = typeof value;
+    if (valueType === "number")
+      return !Number.isNaN(value);
+    return valueType === "bigint" || valueType === "string" || valueType === "boolean";
+  }
+  function tryObjectToPrimitive(obj) {
+    if (typeof obj.valueOf === "function") {
+      const valueOfResult = obj.valueOf();
+      if (valueOfResult !== obj) {
+        if (isPrimitiveComparable(valueOfResult))
+          return valueOfResult;
+        if (typeof valueOfResult === "object" && valueOfResult !== null)
+          return tryObjectToPrimitive(valueOfResult);
+      }
+    }
+    if (typeof obj.toString === "function") {
+      const stringResult = obj.toString();
+      if (stringResult !== "[object Object]")
+        return stringResult;
+    }
+    return null;
+  }
+  function isComparable(value, isForceObjectComparable = false) {
+    if (value === null || value === void 0)
       return false;
-    if (keyType === "undefined")
+    if (isPrimitiveComparable(value))
+      return true;
+    if (typeof value !== "object")
       return false;
-    if (keyType === "function")
-      return isComparable(key());
-    if (keyType === "object") {
-      if (key === null)
-        return true;
+    if (value instanceof Date)
+      return !Number.isNaN(value.getTime());
+    if (isForceObjectComparable)
+      return true;
+    const comparableValue = tryObjectToPrimitive(value);
+    if (comparableValue === null || comparableValue === void 0)
       return false;
-    }
-    return false;
+    return isPrimitiveComparable(comparableValue);
   }
 
   // src/utils/number.ts
@@ -809,12 +742,10 @@ var dataStructureTyped = (() => {
       __publicField(this, "_hashFn", (key) => String(key));
       if (options) {
         const { hashFn, toEntryFn } = options;
-        if (hashFn) {
+        if (hashFn)
           this._hashFn = hashFn;
-        }
-        if (toEntryFn) {
+        if (toEntryFn)
           this._toEntryFn = toEntryFn;
-        }
       }
       if (entryOrRawElements) {
         this.setMany(entryOrRawElements);
@@ -922,8 +853,8 @@ var dataStructureTyped = (() => {
         if (this.isEntry(rawEle)) {
           key = rawEle[0];
           value = rawEle[1];
-        } else if (this.toEntryFn) {
-          const item = this.toEntryFn(rawEle);
+        } else if (this._toEntryFn) {
+          const item = this._toEntryFn(rawEle);
           key = item[0];
           value = item[1];
         }
@@ -989,8 +920,7 @@ var dataStructureTyped = (() => {
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
-     */
-    /**
+     *
      * The clone function creates a new HashMap with the same key-value pairs as
      * this one. The clone function is useful for creating a copy of an existing
      * HashMap, and then modifying that copy without affecting the original.
@@ -998,12 +928,8 @@ var dataStructureTyped = (() => {
      * @return A new hashmap with the same values as this one
      */
     clone() {
-      return new _HashMap(this, { hashFn: this.hashFn, toEntryFn: this.toEntryFn });
+      return new _HashMap(this, { hashFn: this._hashFn, toEntryFn: this._toEntryFn });
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -1052,17 +978,6 @@ var dataStructureTyped = (() => {
       }
       return filteredMap;
     }
-    /**
-     * The put function sets a value in a data structure using a specified key.
-     * @param {K} key - The key parameter is of type K, which represents the type of the key being passed
-     * to the function.
-     * @param {V} value - The value parameter represents the value that you want to associate with the
-     * specified key in the data structure.
-     * @returns The method is returning a boolean value.
-     */
-    put(key, value) {
-      return this.set(key, value);
-    }
     /**
      * The function returns an iterator that yields key-value pairs from both an object store and an
      * object map.
@@ -1095,7 +1010,7 @@ var dataStructureTyped = (() => {
       const keyType = typeof key;
       let strKey;
       if (keyType !== "string" && keyType !== "number" && keyType !== "symbol") {
-        strKey = this.hashFn(key);
+        strKey = this._hashFn(key);
       } else {
         if (keyType === "number") {
           strKey = key;
@@ -1148,10 +1063,7 @@ var dataStructureTyped = (() => {
         }
       }
       if (entryOrRawElements) {
-        for (const el of entryOrRawElements) {
-          const [key, value] = this.toEntryFn(el);
-          this.set(key, value);
-        }
+        this.setMany(entryOrRawElements);
       }
     }
     /**
@@ -1213,10 +1125,6 @@ var dataStructureTyped = (() => {
     get size() {
       return this._size;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -1230,10 +1138,6 @@ var dataStructureTyped = (() => {
         return;
       return [this.head.key, this.head.value];
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -1268,10 +1172,6 @@ var dataStructureTyped = (() => {
         node = node.prev;
       }
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -1288,7 +1188,7 @@ var dataStructureTyped = (() => {
       let node;
       const isNewKey = !this.has(key);
       if (isWeakKey(key)) {
-        const hash = this.objHashFn(key);
+        const hash = this._objHashFn(key);
         node = this.objMap.get(hash);
         if (!node && isNewKey) {
           node = { key: hash, value, prev: this.tail, next: this._sentinel };
@@ -1297,7 +1197,7 @@ var dataStructureTyped = (() => {
           node.value = value;
         }
       } else {
-        const hash = this.hashFn(key);
+        const hash = this._hashFn(key);
         node = this.noObjMap[hash];
         if (!node && isNewKey) {
           this.noObjMap[hash] = node = { key, value, prev: this.tail, next: this._sentinel };
@@ -1330,8 +1230,17 @@ var dataStructureTyped = (() => {
     setMany(entryOrRawElements) {
       const results = [];
       for (const rawEle of entryOrRawElements) {
-        const [key, value] = this.toEntryFn(rawEle);
-        results.push(this.set(key, value));
+        let key, value;
+        if (this.isEntry(rawEle)) {
+          key = rawEle[0];
+          value = rawEle[1];
+        } else if (this._toEntryFn) {
+          const item = this._toEntryFn(rawEle);
+          key = item[0];
+          value = item[1];
+        }
+        if (key !== void 0 && value !== void 0)
+          results.push(this.set(key, value));
       }
       return results;
     }
@@ -1343,17 +1252,13 @@ var dataStructureTyped = (() => {
      */
     has(key) {
       if (isWeakKey(key)) {
-        const hash = this.objHashFn(key);
+        const hash = this._objHashFn(key);
         return this.objMap.has(hash);
       } else {
-        const hash = this.hashFn(key);
+        const hash = this._hashFn(key);
         return hash in this.noObjMap;
       }
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -1369,19 +1274,15 @@ var dataStructureTyped = (() => {
      */
     get(key) {
       if (isWeakKey(key)) {
-        const hash = this.objHashFn(key);
+        const hash = this._objHashFn(key);
         const node = this.objMap.get(hash);
         return node ? node.value : void 0;
       } else {
-        const hash = this.hashFn(key);
+        const hash = this._hashFn(key);
         const node = this.noObjMap[hash];
         return node ? node.value : void 0;
       }
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -1401,10 +1302,6 @@ var dataStructureTyped = (() => {
       }
       return node.value;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -1418,14 +1315,14 @@ var dataStructureTyped = (() => {
     delete(key) {
       let node;
       if (isWeakKey(key)) {
-        const hash = this.objHashFn(key);
+        const hash = this._objHashFn(key);
         node = this.objMap.get(hash);
         if (!node) {
           return false;
         }
         this.objMap.delete(hash);
       } else {
-        const hash = this.hashFn(key);
+        const hash = this._hashFn(key);
         node = this.noObjMap[hash];
         if (!node) {
           return false;
@@ -1435,10 +1332,6 @@ var dataStructureTyped = (() => {
       this._deleteNode(node);
       return true;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -1456,10 +1349,6 @@ var dataStructureTyped = (() => {
       }
       return this._deleteNode(node);
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -1480,10 +1369,6 @@ var dataStructureTyped = (() => {
     isEntry(rawElement) {
       return Array.isArray(rawElement) && rawElement.length === 2;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -1495,10 +1380,6 @@ var dataStructureTyped = (() => {
       this._size = 0;
       this._head = this._tail = this._sentinel.prev = this._sentinel.next = this._sentinel;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -1509,17 +1390,13 @@ var dataStructureTyped = (() => {
      * of the original `LinkedHashMap` object.
      */
     clone() {
-      const cloned = new _LinkedHashMap([], { hashFn: this.hashFn, objHashFn: this.objHashFn });
+      const cloned = new _LinkedHashMap([], { hashFn: this._hashFn, objHashFn: this._objHashFn });
       for (const entry of this) {
         const [key, value] = entry;
         cloned.set(key, value);
       }
       return cloned;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -1546,10 +1423,6 @@ var dataStructureTyped = (() => {
       }
       return filteredMap;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -1577,29 +1450,6 @@ var dataStructureTyped = (() => {
       }
       return mappedMap;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The put function sets a value in a data structure using a specified key.
-     * @param {K} key - The key parameter is of type K, which represents the type of the key being passed
-     * to the function.
-     * @param {V} value - The value parameter represents the value that you want to associate with the
-     * specified key in the data structure.
-     * @returns The method is returning a boolean value.
-     */
-    put(key, value) {
-      return this.set(key, value);
-    }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     * where n is the number of entries in the LinkedHashMap.
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -1614,10 +1464,6 @@ var dataStructureTyped = (() => {
         node = node.next;
       }
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -1743,12 +1589,6 @@ var dataStructureTyped = (() => {
     get size() {
       return this._size;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     * Linear time, where n is the length of the input array, as it performs a loop to push each element into the linked list.
-     * Linear space, as it creates a new node for each element in the array.
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -1765,10 +1605,6 @@ var dataStructureTyped = (() => {
       }
       return singlyLinkedList;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -1790,11 +1626,6 @@ var dataStructureTyped = (() => {
       this._size++;
       return true;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     * Linear time in the worst case, as it may need to traverse the list to find the last element.
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -1823,10 +1654,6 @@ var dataStructureTyped = (() => {
       this._size--;
       return value;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -1842,10 +1669,6 @@ var dataStructureTyped = (() => {
       this._size--;
       return removedNode.value;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -1867,10 +1690,6 @@ var dataStructureTyped = (() => {
       this._size++;
       return true;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -1890,10 +1709,6 @@ var dataStructureTyped = (() => {
       }
       return current.value;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -1911,10 +1726,6 @@ var dataStructureTyped = (() => {
       }
       return current;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -1942,10 +1753,6 @@ var dataStructureTyped = (() => {
       this._size--;
       return true;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -1957,7 +1764,7 @@ var dataStructureTyped = (() => {
      * successfully deleted from the linked list, and `false` if the value or node is not found in the linked list.
      */
     delete(valueOrNode) {
-      if (!valueOrNode)
+      if (valueOrNode === void 0)
         return false;
       let value;
       if (valueOrNode instanceof SinglyLinkedListNode) {
@@ -1987,10 +1794,6 @@ var dataStructureTyped = (() => {
       }
       return false;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -2037,12 +1840,6 @@ var dataStructureTyped = (() => {
       this._tail = void 0;
       this._size = 0;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     * Linear time, where n is the length of the list, as it needs to traverse the entire list to convert it to an array.
-     * Linear space, as it creates an array with the same length as the list.
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -2059,10 +1856,6 @@ var dataStructureTyped = (() => {
       }
       return array;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -2085,10 +1878,6 @@ var dataStructureTyped = (() => {
       [this._head, this._tail] = [this.tail, this.head];
       return this;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -2110,10 +1899,6 @@ var dataStructureTyped = (() => {
       }
       return -1;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -2134,10 +1919,6 @@ var dataStructureTyped = (() => {
       }
       return void 0;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -2175,10 +1956,6 @@ var dataStructureTyped = (() => {
       }
       return false;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -2209,10 +1986,6 @@ var dataStructureTyped = (() => {
       }
       return false;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -2232,10 +2005,6 @@ var dataStructureTyped = (() => {
       }
       return count;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -2248,10 +2017,6 @@ var dataStructureTyped = (() => {
     clone() {
       return new _SinglyLinkedList(this, { toElementFn: this.toElementFn });
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -2283,8 +2048,7 @@ var dataStructureTyped = (() => {
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
-     */
-    /**
+     *
      * The `map` function takes a callback function and returns a new SinglyLinkedList with the results
      * of applying the callback to each element in the original list.
      * @param callback - The `callback` parameter is a function that will be called for each element in
@@ -2426,11 +2190,6 @@ var dataStructureTyped = (() => {
     get size() {
       return this._size;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     * where n is the number of elements in the linked list.
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -2442,10 +2201,6 @@ var dataStructureTyped = (() => {
       var _a;
       return (_a = this.head) == null ? void 0 : _a.value;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -2457,10 +2212,6 @@ var dataStructureTyped = (() => {
       var _a;
       return (_a = this.tail) == null ? void 0 : _a.value;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -2476,8 +2227,7 @@ var dataStructureTyped = (() => {
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
-     */
-    /**
+     *
      * The push function adds a new element to the end of a doubly linked list.
      * @param {E} element - The "element" parameter represents the value that you want to add to the
      * doubly linked list.
@@ -2499,8 +2249,7 @@ var dataStructureTyped = (() => {
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
-     */
-    /**
+     *
      * The `pop()` function removes and returns the value of the last element in a linked list.
      * @returns The method is returning the value of the removed node.
      */
@@ -2521,8 +2270,7 @@ var dataStructureTyped = (() => {
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
-     */
-    /**
+     *
      * The `shift()` function removes and returns the value of the first element in a doubly linked list.
      * @returns The value of the removed node.
      */
@@ -2543,8 +2291,7 @@ var dataStructureTyped = (() => {
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
-     */
-    /**
+     *
      * The unshift function adds a new element to the beginning of a doubly linked list.
      * @param {E} element - The "element" parameter represents the value of the element that you want to
      * add to the beginning of the doubly linked list.
@@ -2563,10 +2310,6 @@ var dataStructureTyped = (() => {
       this._size++;
       return true;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -2586,10 +2329,6 @@ var dataStructureTyped = (() => {
       }
       return current.value;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -2610,10 +2349,6 @@ var dataStructureTyped = (() => {
       }
       return current;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -2634,10 +2369,6 @@ var dataStructureTyped = (() => {
       }
       return void 0;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -2671,11 +2402,6 @@ var dataStructureTyped = (() => {
       this._size++;
       return true;
     }
-    /**
-     * Time Complexity: O(1) or O(n)
-     * Space Complexity: O(1)
-     * where n is the number of elements in the linked list.
-     */
     /**
      * Time Complexity: O(1) or O(n)
      * Space Complexity: O(1)
@@ -2712,10 +2438,6 @@ var dataStructureTyped = (() => {
       }
       return false;
     }
-    /**
-     * Time Complexity: O(1) or O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1) or O(n)
      * Space Complexity: O(1)
@@ -2780,10 +2502,6 @@ var dataStructureTyped = (() => {
       this._size--;
       return true;
     }
-    /**
-     * Time Complexity: O(1) or O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1) or O(n)
      * Space Complexity: O(1)
@@ -2817,10 +2535,6 @@ var dataStructureTyped = (() => {
       }
       return false;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -2831,10 +2545,6 @@ var dataStructureTyped = (() => {
     isEmpty() {
       return this.size === 0;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -2846,10 +2556,6 @@ var dataStructureTyped = (() => {
       this._tail = void 0;
       this._size = 0;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -2872,10 +2578,6 @@ var dataStructureTyped = (() => {
       }
       return -1;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -2897,10 +2599,6 @@ var dataStructureTyped = (() => {
       }
       return void 0;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -2917,10 +2615,6 @@ var dataStructureTyped = (() => {
       }
       return this;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -2937,10 +2631,6 @@ var dataStructureTyped = (() => {
       }
       return array;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -2957,10 +2647,6 @@ var dataStructureTyped = (() => {
       }
       return array;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -2973,10 +2659,6 @@ var dataStructureTyped = (() => {
     clone() {
       return new _DoublyLinkedList(this);
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -3008,8 +2690,7 @@ var dataStructureTyped = (() => {
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
-     */
-    /**
+     *
      * The `map` function takes a callback function and returns a new DoublyLinkedList with the results
      * of applying the callback to each element in the original list.
      * @param callback - The callback parameter is a function that will be called for each element in the
@@ -3112,10 +2793,6 @@ var dataStructureTyped = (() => {
     get probability() {
       return this._probability;
     }
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -3127,10 +2804,6 @@ var dataStructureTyped = (() => {
       const firstNode = this.head.forward[0];
       return firstNode ? firstNode.value : void 0;
     }
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -3147,10 +2820,6 @@ var dataStructureTyped = (() => {
       }
       return current.value;
     }
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -3178,10 +2847,6 @@ var dataStructureTyped = (() => {
         this._level = Math.max(this.level, newNode.forward.length);
       }
     }
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -3207,8 +2872,7 @@ var dataStructureTyped = (() => {
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
-     */
-    /**
+     *
      * The function checks if a key exists in a data structure.
      * @param {K} key - The parameter "key" is of type K, which represents the type of the key being
      * checked.
@@ -3217,10 +2881,6 @@ var dataStructureTyped = (() => {
     has(key) {
       return this.get(key) !== void 0;
     }
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -3254,10 +2914,6 @@ var dataStructureTyped = (() => {
       }
       return false;
     }
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -3276,10 +2932,6 @@ var dataStructureTyped = (() => {
       const nextNode = current.forward[0];
       return nextNode ? nextNode.value : void 0;
     }
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -3301,11 +2953,6 @@ var dataStructureTyped = (() => {
       }
       return lastLess ? lastLess.value : void 0;
     }
-    /**
-     * Time Complexity: O(maxLevel)
-     * Space Complexity: O(1)
-     * where maxLevel is the maximum level of the SkipList, as it may iterate up to maxLevel times in the worst case.
-     */
     /**
      * Time Complexity: O(maxLevel)
      * Space Complexity: O(1)
@@ -3374,10 +3021,6 @@ var dataStructureTyped = (() => {
     isEmpty() {
       return this.elements.length === 0;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -3390,10 +3033,6 @@ var dataStructureTyped = (() => {
         return void 0;
       return this.elements[this.elements.length - 1];
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -3406,10 +3045,6 @@ var dataStructureTyped = (() => {
       this.elements.push(element);
       return true;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -3441,10 +3076,6 @@ var dataStructureTyped = (() => {
       const spliced = this.elements.splice(index, 1);
       return spliced.length === 1;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -3455,10 +3086,6 @@ var dataStructureTyped = (() => {
     toArray() {
       return this.elements.slice();
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -3468,10 +3095,6 @@ var dataStructureTyped = (() => {
     clear() {
       this._elements = [];
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -3482,10 +3105,6 @@ var dataStructureTyped = (() => {
     clone() {
       return new _Stack(this, { toElementFn: this.toElementFn });
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -3516,8 +3135,7 @@ var dataStructureTyped = (() => {
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
-     */
-    /**
+     *
      * The `map` function takes a callback function and applies it to each element in the stack,
      * returning a new stack with the results.
      * @param callback - The callback parameter is a function that will be called for each element in the
@@ -3540,10 +3158,6 @@ var dataStructureTyped = (() => {
       }
       return newStack;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -3599,10 +3213,6 @@ var dataStructureTyped = (() => {
     get size() {
       return this.elements.length - this.offset;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -3614,10 +3224,6 @@ var dataStructureTyped = (() => {
     get first() {
       return this.size > 0 ? this.elements[this.offset] : void 0;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -3644,10 +3250,6 @@ var dataStructureTyped = (() => {
     set autoCompactRatio(v) {
       this._autoCompactRatio = v;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -3661,26 +3263,18 @@ var dataStructureTyped = (() => {
     static fromArray(elements) {
       return new _Queue(elements);
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
      *
-     * The push function adds an element to the end of the queue and returns the updated queue.Adds an element at the back of the queue.
+     * The push function adds an element to the end of the queue and returns true. Adds an element at the back of the queue.
      * @param {E} element - The `element` parameter represents the element that you want to add to the queue.
-     * @returns The `add` method is returning a `Queue<E>` object.
+     * @returns Always returns true, indicating the element was successfully added.
      */
     push(element) {
       this.elements.push(element);
       return true;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -3700,7 +3294,7 @@ var dataStructureTyped = (() => {
     }
     /**
      * The delete function removes an element from the list.
-     * @param element: E Specify the element to be deleted
+     * @param {E} element - Specify the element to be deleted
      * @return A boolean value indicating whether the element was successfully deleted or not
      */
     delete(element) {
@@ -3709,17 +3303,13 @@ var dataStructureTyped = (() => {
     }
     /**
      * The deleteAt function deletes the element at a given index.
-     * @param index: number Determine the index of the element to be deleted
+     * @param {number} index - Determine the index of the element to be deleted
      * @return A boolean value
      */
     deleteAt(index) {
       const spliced = this.elements.splice(index, 1);
       return spliced.length === 1;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -3729,10 +3319,6 @@ var dataStructureTyped = (() => {
     at(index) {
       return this.elements[index + this._offset];
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -3743,10 +3329,6 @@ var dataStructureTyped = (() => {
     isEmpty() {
       return this.size === 0;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(n)
@@ -3757,10 +3339,6 @@ var dataStructureTyped = (() => {
     toArray() {
       return this.elements.slice(this.offset);
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -3781,11 +3359,6 @@ var dataStructureTyped = (() => {
       this._offset = 0;
       return true;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     * where n is the number of elements in the queue. It creates a shallow copy of the internal array. the space required is proportional to the number of elements in the queue.
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -3796,10 +3369,6 @@ var dataStructureTyped = (() => {
     clone() {
       return new _Queue(this.elements.slice(this.offset), { toElementFn: this.toElementFn });
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -3840,10 +3409,6 @@ var dataStructureTyped = (() => {
       }
       return newDeque;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -3857,10 +3422,6 @@ var dataStructureTyped = (() => {
     }
   };
   var LinkedListQueue = class _LinkedListQueue extends SinglyLinkedList {
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -4018,10 +3579,6 @@ var dataStructureTyped = (() => {
         return;
       return this._buckets[this._bucketLast][this._lastInBucket];
     }
-    /**
-     * Time Complexity - Amortized O(1) (possible reallocation)
-     * Space Complexity - O(n) (due to potential resizing).
-     */
     /**
      * Time Complexity - Amortized O(1) (possible reallocation),
      * Space Complexity - O(n) (due to potential resizing).
@@ -4051,10 +3608,6 @@ var dataStructureTyped = (() => {
         this.shift();
       return true;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -4081,10 +3634,6 @@ var dataStructureTyped = (() => {
       this._size -= 1;
       return element;
     }
-    /**
-     * Time Complexity: Amortized O(1)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: Amortized O(1)
      * Space Complexity: O(n)
@@ -4115,10 +3664,6 @@ var dataStructureTyped = (() => {
         this.pop();
       return true;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -4146,10 +3691,6 @@ var dataStructureTyped = (() => {
       this._size -= 1;
       return element;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -4160,10 +3701,6 @@ var dataStructureTyped = (() => {
     isEmpty() {
       return this.size === 0;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -4198,10 +3735,6 @@ var dataStructureTyped = (() => {
         index--;
       }
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -4217,10 +3750,6 @@ var dataStructureTyped = (() => {
       const { bucketIndex, indexInBucket } = this._getBucketAndPosition(pos);
       return this._buckets[bucketIndex][indexInBucket];
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -4237,10 +3766,6 @@ var dataStructureTyped = (() => {
       this._buckets[bucketIndex][indexInBucket] = element;
       return true;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -4278,10 +3803,6 @@ var dataStructureTyped = (() => {
       }
       return true;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -4312,10 +3833,6 @@ var dataStructureTyped = (() => {
         return newDeque;
       }
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1) or O(n)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1) or O(n)
@@ -4334,7 +3851,6 @@ var dataStructureTyped = (() => {
     cutRest(pos, isCutSelf = false) {
       if (isCutSelf) {
         if (pos < 0) {
-          this.clear();
           return this;
         }
         const { bucketIndex, indexInBucket } = this._getBucketAndPosition(pos);
@@ -4344,16 +3860,14 @@ var dataStructureTyped = (() => {
         return this;
       } else {
         const newDeque = new _Deque([], { bucketSize: this._bucketSize });
+        if (pos < 0)
+          pos = 0;
         for (let i = pos; i < this.size; i++) {
           newDeque.push(this.at(i));
         }
         return newDeque;
       }
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1) or O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1) or O(n)
@@ -4384,10 +3898,6 @@ var dataStructureTyped = (() => {
       }
       return true;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -4415,10 +3925,6 @@ var dataStructureTyped = (() => {
       this.cut(index - 1, true);
       return true;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -4439,10 +3945,6 @@ var dataStructureTyped = (() => {
       this._lastInBucket = this._bucketSize - _firstInBucket - 1;
       return this;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -4467,10 +3969,6 @@ var dataStructureTyped = (() => {
       this.cut(index - 1, true);
       return this;
     }
-    /**
-     * Time Complexity: O(n log n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n log n)
      * Space Complexity: O(n)
@@ -4492,10 +3990,6 @@ var dataStructureTyped = (() => {
       }
       return this;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -4527,10 +4021,6 @@ var dataStructureTyped = (() => {
       this._bucketLast = newBuckets.length - 1;
       this._buckets = newBuckets;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -4550,10 +4040,6 @@ var dataStructureTyped = (() => {
       }
       return -1;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -4564,10 +4050,6 @@ var dataStructureTyped = (() => {
     toArray() {
       return [...this];
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -4580,10 +4062,6 @@ var dataStructureTyped = (() => {
     clone() {
       return new _Deque(this, { bucketSize: this.bucketSize, toElementFn: this.toElementFn });
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -4614,8 +4092,7 @@ var dataStructureTyped = (() => {
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
-     */
-    /**
+     *
      * The `map` function takes a callback function and applies it to each element in the deque,
      * returning a new deque with the results.
      * @param callback - The callback parameter is a function that will be called for each element in the
@@ -4639,10 +4116,6 @@ var dataStructureTyped = (() => {
       }
       return newDeque;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -4655,10 +4128,6 @@ var dataStructureTyped = (() => {
         yield this.at(i);
       }
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -4689,10 +4158,6 @@ var dataStructureTyped = (() => {
       this._buckets = newBuckets;
       this._bucketCount = newBuckets.length;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -5214,10 +4679,6 @@ var dataStructureTyped = (() => {
     peek() {
       return this.min ? this.min.element : void 0;
     }
-    /**
-     * Time Complexity: O(n), where n is the number of elements in the linked list.
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n), where n is the number of elements in the linked list.
      * Space Complexity: O(1)
@@ -5262,10 +4723,6 @@ var dataStructureTyped = (() => {
         parent.child.right = node;
       }
     }
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -5276,10 +4733,6 @@ var dataStructureTyped = (() => {
     poll() {
       return this.pop();
     }
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -5309,10 +4762,6 @@ var dataStructureTyped = (() => {
       this._size--;
       return z.element;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -5361,10 +4810,6 @@ var dataStructureTyped = (() => {
         return 1;
       return 0;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -5382,10 +4827,6 @@ var dataStructureTyped = (() => {
         this.root.right = node;
       }
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -5402,10 +4843,6 @@ var dataStructureTyped = (() => {
       if (node.right)
         node.right.left = node.left;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -5423,10 +4860,6 @@ var dataStructureTyped = (() => {
       x.degree++;
       y.parent = x;
     }
-    /**
-     * Time Complexity: O(n log n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n log n)
      * Space Complexity: O(n)
@@ -5677,10 +5110,6 @@ var dataStructureTyped = (() => {
     get size() {
       return this._vertexMap.size;
     }
-    /**
-     * Time Complexity: O(1) - Constant time for Map lookup.
-     * Space Complexity: O(1) - Constant space, as it creates only a few variables.
-     */
     /**
      * Time Complexity: O(1) - Constant time for Map lookup.
      * Space Complexity: O(1) - Constant space, as it creates only a few variables.
@@ -5694,10 +5123,6 @@ var dataStructureTyped = (() => {
     getVertex(vertexKey) {
       return this._vertexMap.get(vertexKey) || void 0;
     }
-    /**
-     * Time Complexity: O(1) - Constant time for Map lookup.
-     * Space Complexity: O(1) - Constant space, as it creates only a few variables.
-     */
     /**
      * Time Complexity: O(1) - Constant time for Map lookup.
      * Space Complexity: O(1) - Constant space, as it creates only a few variables.
@@ -5726,10 +5151,6 @@ var dataStructureTyped = (() => {
       const potentialKeyType = typeof potentialKey;
       return potentialKeyType === "string" || potentialKeyType === "number";
     }
-    /**
-     * Time Complexity: O(K), where K is the number of vertexMap to be removed.
-     * Space Complexity: O(1) - Constant space, as it creates only a few variables.
-     */
     /**
      * Time Complexity: O(K), where K is the number of vertexMap to be removed.
      * Space Complexity: O(1) - Constant space, as it creates only a few variables.
@@ -5747,10 +5168,6 @@ var dataStructureTyped = (() => {
       }
       return removed.length > 0;
     }
-    /**
-     * Time Complexity: O(1) - Depends on the implementation in the concrete class.
-     * Space Complexity: O(1) - Depends on the implementation in the concrete class.
-     */
     /**
      * Time Complexity: O(1) - Depends on the implementation in the concrete class.
      * Space Complexity: O(1) - Depends on the implementation in the concrete class.
@@ -5788,10 +5205,6 @@ var dataStructureTyped = (() => {
         }
       }
     }
-    /**
-     * Time Complexity: O(1) - Constant time for Map and Edge operations.
-     * Space Complexity: O(1) - Constant space, as it creates only a few variables.
-     */
     /**
      * Time Complexity: O(1) - Constant time for Map and Edge operations.
      * Space Complexity: O(1) - Constant space, as it creates only a few variables.
@@ -5815,10 +5228,6 @@ var dataStructureTyped = (() => {
         return false;
       }
     }
-    /**
-     * Time Complexity: O(P), where P is the number of paths found (in the worst case, exploring all paths).
-     * Space Complexity: O(P) - Linear space, where P is the number of paths found.
-     */
     /**
      * Time Complexity: O(P), where P is the number of paths found (in the worst case, exploring all paths).
      * Space Complexity: O(P) - Linear space, where P is the number of paths found.
@@ -5856,10 +5265,6 @@ var dataStructureTyped = (() => {
       }
       return paths;
     }
-    /**
-     * Time Complexity: O(L), where L is the length of the path.
-     * Space Complexity: O(1) - Constant space.
-     */
     /**
      * Time Complexity: O(L), where L is the length of the path.
      * Space Complexity: O(1) - Constant space.
@@ -5876,10 +5281,6 @@ var dataStructureTyped = (() => {
       }
       return sum;
     }
-    /**
-     * Time Complexity: O(V + E) - Depends on the implementation (Dijkstra's algorithm).
-     * Space Complexity: O(V + E) - Depends on the implementation (Dijkstra's algorithm).
-     */
     /**
      * Time Complexity: O(V + E) - Depends on the implementation (Dijkstra's algorithm).
      * Space Complexity: O(V + E) - Depends on the implementation (Dijkstra's algorithm).
@@ -5938,10 +5339,6 @@ var dataStructureTyped = (() => {
         return void 0;
       }
     }
-    /**
-     * Time Complexity: O(V + E) - Depends on the implementation (Dijkstra's algorithm or DFS).
-     * Space Complexity: O(V + E) - Depends on the implementation (Dijkstra's algorithm or DFS).
-     */
     /**
      * Time Complexity: O(V + E) - Depends on the implementation (Dijkstra's algorithm or DFS).
      * Space Complexity: O(V + E) - Depends on the implementation (Dijkstra's algorithm or DFS).
@@ -6009,13 +5406,6 @@ var dataStructureTyped = (() => {
         return minPath;
       }
     }
-    /**
-     *  Dijkstra algorithm time: O(VE) space: O(VO + EO)
-     */
-    /**
-     * Time Complexity: O(V^2 + E) - Quadratic time in the worst case (no heap optimization).
-     * Space Complexity: O(V + E) - Depends on the implementation (Dijkstra's algorithm).
-     */
     /**
      * Time Complexity: O(V^2 + E) - Quadratic time in the worst case (no heap optimization).
      * Space Complexity: O(V + E) - Depends on the implementation (Dijkstra's algorithm).
@@ -6129,18 +5519,6 @@ var dataStructureTyped = (() => {
       genPaths && getPaths(minDest);
       return { distMap, preMap, seen, paths, minDist, minPath };
     }
-    /**
-     *  Dijkstra algorithm time: O(logVE) space: O(VO + EO)
-     *
-     * Dijkstra's algorithm only solves the single-source shortest path problem, while the Bellman-Ford algorithm and Floyd-Warshall algorithm can address shortest paths between all pairs of nodes.
-     * Dijkstra's algorithm is suitable for graphs with non-negative edge weights, whereas the Bellman-Ford algorithm and Floyd-Warshall algorithm can handle negative-weight edgeMap.
-     * The time complexity of Dijkstra's algorithm and the Bellman-Ford algorithm depends on the size of the graph, while the time complexity of the Floyd-Warshall algorithm is O(VO^3), where VO is the number of nodes. For dense graphs, Floyd-Warshall might become slower.
-     *
-     */
-    /**
-     * Time Complexity: O((V + E) * log(V)) - Depends on the implementation (using a binary heap).
-     * Space Complexity: O(V + E) - Depends on the implementation (using a binary heap).
-     */
     /**
      * Time Complexity: O((V + E) * log(V)) - Depends on the implementation (using a binary heap).
      * Space Complexity: O(V + E) - Depends on the implementation (using a binary heap).
@@ -6252,11 +5630,6 @@ var dataStructureTyped = (() => {
       }
       return { distMap, preMap, seen, paths, minDist, minPath };
     }
-    /**
-     * Time Complexity: O(V * E) - Quadratic time in the worst case (Bellman-Ford algorithm).
-     * Space Complexity: O(V + E) - Depends on the implementation (Bellman-Ford algorithm).
-     * one to rest pairs
-     */
     /**
      * Time Complexity: O(V * E) - Quadratic time in the worst case (Bellman-Ford algorithm).
      * Space Complexity: O(V + E) - Depends on the implementation (Bellman-Ford algorithm).
@@ -6372,13 +5745,6 @@ var dataStructureTyped = (() => {
      * The Bellman-Ford algorithm is also used to find the shortest paths from a source node to all other nodes in a graph. Unlike Dijkstra's algorithm, it can handle edge weights that are negative. Its basic idea involves iterative relaxation of all edgeMap for several rounds to gradually approximate the shortest paths. Due to its ability to handle negative-weight edgeMap, the Bellman-Ford algorithm is more flexible in some scenarios.
      * The `bellmanFord` function implements the Bellman-Ford algorithm to find the shortest path from a source vertex to
      */
-    /**
-     * Time Complexity: O(V^3) - Cubic time (Floyd-Warshall algorithm).
-     * Space Complexity: O(V^2) - Quadratic space (Floyd-Warshall algorithm).
-     * Not support graph with negative weight cycle
-     * all pairs
-     * The Floyd-Warshall algorithm is used to find the shortest paths between all pairs of nodes in a graph. It employs dynamic programming to compute the shortest paths from any node to any other node. The Floyd-Warshall algorithm's advantage lies in its ability to handle graphs with negative-weight edgeMap, and it can simultaneously compute shortest paths between any two nodes.
-     */
     /**
      * Time Complexity: O(V^3) - Cubic time (Floyd-Warshall algorithm).
      * Space Complexity: O(V^2) - Quadratic space (Floyd-Warshall algorithm).
@@ -6459,10 +5825,6 @@ var dataStructureTyped = (() => {
       }
       return [...uniqueCycles].map((cycleString) => cycleString[1]);
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -6490,10 +5852,6 @@ var dataStructureTyped = (() => {
       }
       return filtered;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -6591,10 +5949,6 @@ var dataStructureTyped = (() => {
     set inEdgeMap(v) {
       this._inEdgeMap = v;
     }
-    /**
-     * In TypeScript, a subclass inherits the interface implementation of its parent class, without needing to implement the same interface again in the subclass. This behavior differs from Java's approach. In Java, if a parent class implements an interface, the subclass needs to explicitly implement the same interface, even if the parent class has already implemented it.
-     * This means that using abstract methods in the parent class cannot constrain the grandchild classes. Defining methods within an interface also cannot constrain the descendant classes. When inheriting from this class, developers need to be aware that this method needs to be overridden.
-     */
     /**
      * The function creates a new vertex with an optional value and returns it.
      * @param {VertexKey} key - The `key` parameter is the unique identifier for the vertex. It is of type `VertexKey`, which
@@ -6607,10 +5961,6 @@ var dataStructureTyped = (() => {
     createVertex(key, value) {
       return new DirectedVertex(key, value);
     }
-    /**
-     * In TypeScript, a subclass inherits the interface implementation of its parent class, without needing to implement the same interface again in the subclass. This behavior differs from Java's approach. In Java, if a parent class implements an interface, the subclass needs to explicitly implement the same interface, even if the parent class has already implemented it.
-     * This means that using abstract methods in the parent class cannot constrain the grandchild classes. Defining methods within an interface also cannot constrain the descendant classes. When inheriting from this class, developers need to be aware that this method needs to be overridden.
-     */
     /**
      * The function creates a directed edge between two vertexMap with an optional weight and value.
      * @param {VertexKey} src - The source vertex ID of the edge. It represents the starting point of the edge.
@@ -6624,10 +5974,6 @@ var dataStructureTyped = (() => {
     createEdge(src, dest, weight, value) {
       return new DirectedEdge(src, dest, weight != null ? weight : 1, value);
     }
-    /**
-     * Time Complexity: O(|V|) where |V| is the number of vertexMap
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(|V|) where |V| is the number of vertexMap
      * Space Complexity: O(1)
@@ -6653,10 +5999,6 @@ var dataStructureTyped = (() => {
       }
       return edgeMap[0] || void 0;
     }
-    /**
-     * Time Complexity: O(|E|) where |E| is the number of edgeMap
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(|E|) where |E| is the number of edgeMap
      * Space Complexity: O(1)
@@ -6683,10 +6025,6 @@ var dataStructureTyped = (() => {
       }
       return removed;
     }
-    /**
-     * Time Complexity: O(E) where E is the number of edgeMap
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(E) where E is the number of edgeMap
      * Space Complexity: O(1)
@@ -6726,10 +6064,6 @@ var dataStructureTyped = (() => {
       }
       return removed;
     }
-    /**
-     * Time Complexity: O(1) - Constant time for Map operations.
-     * Space Complexity: O(1) - Constant space, as it creates only a few variables.
-     */
     /**
      * Time Complexity: O(1) - Constant time for Map operations.
      * Space Complexity: O(1) - Constant space, as it creates only a few variables.
@@ -6759,10 +6093,6 @@ var dataStructureTyped = (() => {
       }
       return this._vertexMap.delete(vertexKey);
     }
-    /**
-     * Time Complexity: O(|E|) where |E| is the number of edgeMap
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(|E|) where |E| is the number of edgeMap
      * Space Complexity: O(1)
@@ -6784,10 +6114,6 @@ var dataStructureTyped = (() => {
       }
       return removed;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -6804,10 +6130,6 @@ var dataStructureTyped = (() => {
       }
       return [];
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -6824,10 +6146,6 @@ var dataStructureTyped = (() => {
       }
       return [];
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -6839,10 +6157,6 @@ var dataStructureTyped = (() => {
     degreeOf(vertexOrKey) {
       return this.outDegreeOf(vertexOrKey) + this.inDegreeOf(vertexOrKey);
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -6854,10 +6168,6 @@ var dataStructureTyped = (() => {
     inDegreeOf(vertexOrKey) {
       return this.incomingEdgesOf(vertexOrKey).length;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -6869,10 +6179,6 @@ var dataStructureTyped = (() => {
     outDegreeOf(vertexOrKey) {
       return this.outgoingEdgesOf(vertexOrKey).length;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -6884,10 +6190,6 @@ var dataStructureTyped = (() => {
     edgesOf(vertexOrKey) {
       return [...this.outgoingEdgesOf(vertexOrKey), ...this.incomingEdgesOf(vertexOrKey)];
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -6899,10 +6201,6 @@ var dataStructureTyped = (() => {
     getEdgeSrc(e) {
       return this._getVertex(e.src);
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -6914,10 +6212,6 @@ var dataStructureTyped = (() => {
     getEdgeDest(e) {
       return this._getVertex(e.dest);
     }
-    /**
-     * Time Complexity: O(|E|) where |E| is the number of edgeMap
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(|E|) where |E| is the number of edgeMap
      * Space Complexity: O(1)
@@ -6941,10 +6235,6 @@ var dataStructureTyped = (() => {
       }
       return destinations;
     }
-    /**
-     * Time Complexity: O(|V| + |E|) where |V| is the number of vertexMap and |E| is the number of edgeMap
-     * Space Complexity: O(|V|)
-     */
     /**
      * Time Complexity: O(|V| + |E|) where |V| is the number of vertexMap and |E| is the number of edgeMap
      * Space Complexity: O(|V|)
@@ -6989,10 +6279,6 @@ var dataStructureTyped = (() => {
         sorted = sorted.map((vertex) => vertex instanceof DirectedVertex ? vertex.key : vertex);
       return sorted.reverse();
     }
-    /**
-     * Time Complexity: O(|E|) where |E| is the number of edgeMap
-     * Space Complexity: O(|E|)
-     */
     /**
      * Time Complexity: O(|E|) where |E| is the number of edgeMap
      * Space Complexity: O(|E|)
@@ -7007,10 +6293,6 @@ var dataStructureTyped = (() => {
       });
       return edgeMap;
     }
-    /**
-     * Time Complexity: O(|E|) where |E| is the number of edgeMap
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(|E|) where |E| is the number of edgeMap
      * Space Complexity: O(1)
@@ -7034,10 +6316,6 @@ var dataStructureTyped = (() => {
       }
       return neighbors;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -7068,10 +6346,6 @@ var dataStructureTyped = (() => {
     isEmpty() {
       return this.vertexMap.size === 0 && this.inEdgeMap.size === 0 && this.outEdgeMap.size === 0;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -7095,12 +6369,6 @@ var dataStructureTyped = (() => {
       cloned.outEdgeMap = new Map(this.outEdgeMap);
       return cloned;
     }
-    /**
-     *  Time Complexity: O(V + E)
-     *  Space Complexity: O(V)
-     *  Tarjan is an algorithm based on dfs,which is used to solve the connectivity problem of graphs.
-     *  Tarjan can find the SSC(strongly connected components), articulation points, and bridges of directed graphs.
-     */
     /**
      *  Time Complexity: O(V + E)
      *  Space Complexity: O(V)
@@ -7152,10 +6420,6 @@ var dataStructureTyped = (() => {
       }
       return { dfnMap, lowMap, SCCs };
     }
-    /**
-     * Time Complexity: O(V + E) - Depends on the implementation (Tarjan's algorithm).
-     * Space Complexity: O(V) - Depends on the implementation (Tarjan's algorithm).
-     */
     /**
      * Time Complexity: O(V + E) - Depends on the implementation (Tarjan's algorithm).
      * Space Complexity: O(V) - Depends on the implementation (Tarjan's algorithm).
@@ -7184,10 +6448,6 @@ var dataStructureTyped = (() => {
     getSCCs() {
       return this.tarjan().SCCs;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -7294,10 +6554,6 @@ var dataStructureTyped = (() => {
     createEdge(v1, v2, weight, value) {
       return new UndirectedEdge(v1, v2, weight != null ? weight : 1, value);
     }
-    /**
-     * Time Complexity: O(|E|), where |E| is the number of edgeMap incident to the given vertex.
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(|E|), where |E| is the number of edgeMap incident to the given vertex.
      * Space Complexity: O(1)
@@ -7321,10 +6577,6 @@ var dataStructureTyped = (() => {
       }
       return edgeMap ? edgeMap[0] || void 0 : void 0;
     }
-    /**
-     * Time Complexity: O(|E|), where |E| is the number of edgeMap incident to the given vertex.
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(|E|), where |E| is the number of edgeMap incident to the given vertex.
      * Space Complexity: O(1)
@@ -7352,10 +6604,6 @@ var dataStructureTyped = (() => {
       }
       return removed;
     }
-    /**
-     * Time Complexity: O(E), where E is the number of edgeMap incident to the given vertex.
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(E), where E is the number of edgeMap incident to the given vertex.
      * Space Complexity: O(1)
@@ -7388,10 +6636,6 @@ var dataStructureTyped = (() => {
         return;
       }
     }
-    /**
-     * Time Complexity: O(1) - Constant time for Map operations.
-     * Space Complexity: O(1) - Constant space, as it creates only a few variables.
-     */
     /**
      * Time Complexity: O(1) - Constant time for Map operations.
      * Space Complexity: O(1) - Constant space, as it creates only a few variables.
@@ -7426,10 +6670,6 @@ var dataStructureTyped = (() => {
       }
       return this._vertexMap.delete(vertexKey);
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -7449,10 +6689,6 @@ var dataStructureTyped = (() => {
         return 0;
       }
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -7470,10 +6706,6 @@ var dataStructureTyped = (() => {
         return [];
       }
     }
-    /**
-     * Time Complexity: O(|V| + |E|), where |V| is the number of vertexMap and |E| is the number of edgeMap.
-     * Space Complexity: O(|E|)
-     */
     /**
      * Time Complexity: O(|V| + |E|), where |V| is the number of vertexMap and |E| is the number of edgeMap.
      * Space Complexity: O(|E|)
@@ -7490,10 +6722,6 @@ var dataStructureTyped = (() => {
       });
       return [...edgeSet];
     }
-    /**
-     * Time Complexity: O(|V| + |E|), where |V| is the number of vertexMap and |E| is the number of edgeMap.
-     * Space Complexity: O(|E|)
-     */
     /**
      * Time Complexity: O(|V| + |E|), where |V| is the number of vertexMap and |E| is the number of edgeMap.
      * Space Complexity: O(|E|)
@@ -7517,10 +6745,6 @@ var dataStructureTyped = (() => {
       }
       return neighbors;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -7550,10 +6774,6 @@ var dataStructureTyped = (() => {
     isEmpty() {
       return this.vertexMap.size === 0 && this.edgeMap.size === 0;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -7579,10 +6799,6 @@ var dataStructureTyped = (() => {
       cloned.edgeMap = new Map(this.edgeMap);
       return cloned;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      *  Time Complexity: O(V + E)
      *  Space Complexity: O(V)
@@ -7639,12 +6855,6 @@ var dataStructureTyped = (() => {
         cutVertices
       };
     }
-    /**
-     *  Time Complexity: O(V + E)
-     *  Space Complexity: O(V)
-     *  Tarjan is an algorithm based on dfs,which is used to solve the connectivity problem of graphs.
-     *  1. Tarjan can find the articulation points and bridges(critical edgeMap) of undirected graphs in linear time
-     */
     /**
      * The function "getBridges" returns an array of bridges in a graph using the Tarjan's algorithm.
      * @returns The function `getBridges()` is returning the bridges found using the Tarjan's algorithm.
@@ -7804,6 +7014,13 @@ var dataStructureTyped = (() => {
     }
   };
 
+  // src/types/data-structures/binary-tree/binary-tree.ts
+  var DFSOperation = /* @__PURE__ */ ((DFSOperation2) => {
+    DFSOperation2[DFSOperation2["VISIT"] = 0] = "VISIT";
+    DFSOperation2[DFSOperation2["PROCESS"] = 1] = "PROCESS";
+    return DFSOperation2;
+  })(DFSOperation || {});
+
   // src/data-structures/binary-tree/binary-tree.ts
   var BinaryTreeNode = class {
     /**
@@ -7974,30 +7191,26 @@ var dataStructureTyped = (() => {
         return null;
       if (this.isNode(keyOrNodeOrEntryOrRawElement))
         return keyOrNodeOrEntryOrRawElement;
-      if (this.toEntryFn) {
-        const [key, entryValue] = this.toEntryFn(keyOrNodeOrEntryOrRawElement);
-        if (key)
-          return this.createNode(key, entryValue != null ? entryValue : value);
-        else
-          return;
-      }
       if (this.isEntry(keyOrNodeOrEntryOrRawElement)) {
-        const [key, value2] = keyOrNodeOrEntryOrRawElement;
+        const [key, entryValue] = keyOrNodeOrEntryOrRawElement;
         if (key === void 0)
           return;
         else if (key === null)
           return null;
+        if (this.isKey(key))
+          return this.createNode(key, value != null ? value : entryValue);
+      }
+      if (this.toEntryFn) {
+        const [key, entryValue] = this.toEntryFn(keyOrNodeOrEntryOrRawElement);
+        if (this.isKey(key))
+          return this.createNode(key, value != null ? value : entryValue);
         else
-          return this.createNode(key, value2);
+          return;
       }
       if (this.isKey(keyOrNodeOrEntryOrRawElement))
         return this.createNode(keyOrNodeOrEntryOrRawElement, value);
       return;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(log n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(log n)
@@ -8012,7 +7225,7 @@ var dataStructureTyped = (() => {
      * default value of `'ITERATIVE'`.
      * @returns The function `ensureNode` returns either a `NODE` object, `null`, or `undefined`.
      */
-    ensureNode(keyOrNodeOrEntryOrRawElement, iterationType = "ITERATIVE") {
+    ensureNode(keyOrNodeOrEntryOrRawElement, iterationType = this.iterationType) {
       if (keyOrNodeOrEntryOrRawElement === null)
         return null;
       if (keyOrNodeOrEntryOrRawElement === void 0)
@@ -8023,7 +7236,7 @@ var dataStructureTyped = (() => {
         return keyOrNodeOrEntryOrRawElement;
       if (this.toEntryFn) {
         const [key] = this.toEntryFn(keyOrNodeOrEntryOrRawElement);
-        if (key)
+        if (this.isKey(key))
           return this.getNodeByKey(key);
       }
       if (this.isEntry(keyOrNodeOrEntryOrRawElement)) {
@@ -8065,7 +7278,7 @@ var dataStructureTyped = (() => {
      * `BTNKeyOrNodeOrEntry<K, V, NODE>`.
      * @returns a boolean value.
      */
-    isNodeOrNull(node) {
+    isRealNodeOrNull(node) {
       return this.isRealNode(node) || node === null;
     }
     /**
@@ -8077,6 +7290,23 @@ var dataStructureTyped = (() => {
     isNIL(node) {
       return node === this.NIL;
     }
+    /**
+     * The function `isLeaf` determines whether a given node is a leaf node in a binary tree structure.
+     * @param {R | BTNKeyOrNodeOrEntry<K, V, NODE>} node - The `node` parameter in the `isLeaf` function
+     * can be either a regular node (`R`) or a `BTNKeyOrNodeOrEntry<K, V, NODE>`.
+     * @returns The `isLeaf` function is checking if the provided node is a leaf node in a binary tree.
+     * If the node is `undefined`, it returns `false`. If the node is `null`, it returns `true`.
+     * Otherwise, it checks if both the left and right children of the node are not real nodes, and
+     * returns `true` if they are not, indicating that the node is a
+     */
+    isLeaf(node) {
+      node = this.ensureNode(node);
+      if (node === void 0)
+        return false;
+      if (node === null)
+        return true;
+      return !this.isRealNode(node.left) && !this.isRealNode(node.right);
+    }
     /**
      * The function checks if the input is an array with two elements, indicating it is a binary tree
      * node entry.
@@ -8088,41 +7318,21 @@ var dataStructureTyped = (() => {
       return Array.isArray(keyOrNodeOrEntryOrRawElement) && keyOrNodeOrEntryOrRawElement.length === 2;
     }
     /**
-     * The function checks if a given value is a valid key by evaluating its type and value.
-     * @param {any} key - The `key` parameter can be of any type. It is the value that we want to check
-     * if it is a valid key.
-     * @param [isCheckValueOf=true] - The `isCheckValueOf` parameter is a boolean flag that determines
-     * whether the function should check the valueOf() method of an object when the key is of type
-     * 'object'. If `isCheckValueOf` is true, the function will recursively call itself with the value
-     * returned by key.valueOf().
-     * @returns a boolean value.
+     * Time Complexity O(1)
+     * Space Complexity O(1)
+     *
+     * The function `isKey` checks if a given key is comparable.
+     * @param {any} key - The `key` parameter is of type `any`, which means it can be any data type in
+     * TypeScript.
+     * @returns The function `isKey` is checking if the `key` parameter is `null` or if it is comparable.
+     * If the `key` is `null`, the function returns `true`. Otherwise, it returns the result of the
+     * `isComparable` function, which is not provided in the code snippet.
      */
-    isKey(key, isCheckValueOf = true) {
+    isKey(key) {
       if (key === null)
         return true;
-      const keyType = typeof key;
-      if (keyType === "string" || keyType === "bigint" || keyType === "boolean")
-        return true;
-      if (keyType === "number")
-        return !isNaN(key);
-      if (keyType === "symbol" || keyType === "undefined")
-        return false;
-      if (keyType === "function")
-        return this.isKey(key());
-      if (keyType === "object") {
-        if (typeof key.toString === "function")
-          return true;
-        if (isCheckValueOf && typeof key.valueOf === "function") {
-          this.isKey(key.valueOf(), false);
-        }
-        return false;
-      }
-      return false;
+      return isComparable(key);
     }
-    /**
-     * Time Complexity O(n)
-     * Space Complexity O(1)
-     */
     /**
      * Time Complexity O(n)
      * Space Complexity O(1)
@@ -8179,11 +7389,6 @@ var dataStructureTyped = (() => {
       }
       return false;
     }
-    /**
-     * Time Complexity: O(k * n)
-     * Space Complexity: O(1)
-     * Comments: The time complexity for adding a node depends on the depth of the tree. In the best case (when the tree is empty), it's O(1). In the worst case (when the tree is a degenerate tree), it's O(n). The space complexity is constant.
-     */
     /**
      * Time Complexity: O(k * n)
      * Space Complexity: O(1)
@@ -8216,11 +7421,6 @@ var dataStructureTyped = (() => {
       }
       return inserted;
     }
-    /**
-     * Time Complexity: O(k * n)
-     * Space Complexity: O(1)
-     * "n" is the number of nodes in the tree, and "k" is the number of keys to be inserted.
-     */
     /**
      * Time Complexity: O(k * n)
      * Space Complexity: O(1)
@@ -8236,10 +7436,6 @@ var dataStructureTyped = (() => {
       this.clear();
       this.addMany(keysOrNodesOrEntriesOrRawElements, values);
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -8269,7 +7465,7 @@ var dataStructureTyped = (() => {
       if (!curr.left && !curr.right && !parent) {
         this._setRoot(void 0);
       } else if (curr.left) {
-        const leftSubTreeRightMost = this.getRightMost(curr.left);
+        const leftSubTreeRightMost = this.getRightMost((node) => node, curr.left);
         if (leftSubTreeRightMost) {
           const parentOfLeftSubTreeMax = leftSubTreeRightMost.parent;
           orgCurrent = this._swapProperties(curr, leftSubTreeRightMost);
@@ -8297,10 +7493,6 @@ var dataStructureTyped = (() => {
       deletedResult.push({ deleted: orgCurrent, needBalanced });
       return deletedResult;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(k + log n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(k + log n)
@@ -8326,6 +7518,10 @@ var dataStructureTyped = (() => {
      * @returns an array of NODE objects.
      */
     getNodes(identifier, callback = this._DEFAULT_CALLBACK, onlyOne = false, beginRoot = this.root, iterationType = this.iterationType) {
+      if (identifier === void 0)
+        return [];
+      if (identifier === null)
+        return [];
       beginRoot = this.ensureNode(beginRoot);
       if (!beginRoot)
         return [];
@@ -8361,10 +7557,6 @@ var dataStructureTyped = (() => {
       }
       return ans;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(log n).
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(log n).
@@ -8387,10 +7579,6 @@ var dataStructureTyped = (() => {
       var _a;
       return (_a = this.getNodes(identifier, callback, true, beginRoot, iterationType)[0]) != null ? _a : null;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(log n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(log n)
@@ -8403,13 +7591,9 @@ var dataStructureTyped = (() => {
      * It has a default value of `'ITERATIVE'`.
      * @returns a value of type NODE, null, or undefined.
      */
-    getNodeByKey(key, iterationType = "ITERATIVE") {
+    getNodeByKey(key, iterationType = this.iterationType) {
       return this.getNode(key, this._DEFAULT_CALLBACK, this.root, iterationType);
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(log n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(log n)
@@ -8435,10 +7619,6 @@ var dataStructureTyped = (() => {
       var _a;
       return (_a = this.getNode(identifier, callback, beginRoot, iterationType)) == null ? void 0 : _a.value;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(log n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(log n)
@@ -8463,10 +7643,6 @@ var dataStructureTyped = (() => {
       callback = this._ensureCallback(identifier, callback);
       return this.getNodes(identifier, callback, true, beginRoot, iterationType).length > 0;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -8477,10 +7653,6 @@ var dataStructureTyped = (() => {
       this._setRoot(void 0);
       this._size = 0;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -8491,10 +7663,6 @@ var dataStructureTyped = (() => {
     isEmpty() {
       return this.size === 0;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(log n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(log n)
@@ -8510,10 +7678,6 @@ var dataStructureTyped = (() => {
     isPerfectlyBalanced(beginRoot = this.root) {
       return this.getMinHeight(beginRoot) + 1 >= this.getHeight(beginRoot);
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -8567,10 +7731,6 @@ var dataStructureTyped = (() => {
         return isStandardBST || isInverseBST;
       }
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -8598,10 +7758,6 @@ var dataStructureTyped = (() => {
       }
       return depth;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -8642,10 +7798,6 @@ var dataStructureTyped = (() => {
         return maxHeight;
       }
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(log n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(log n)
@@ -8704,10 +7856,6 @@ var dataStructureTyped = (() => {
         return (_c = depths.get(beginRoot)) != null ? _c : -1;
       }
     }
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(log n)
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(log n)
@@ -8733,89 +7881,93 @@ var dataStructureTyped = (() => {
       result.push(beginNodeEnsured);
       return isReverse ? result.reverse() : result;
     }
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
      *
-     * The `getLeftMost` function returns the leftmost node in a binary tree, either using recursive or
-     * iterative traversal.
-     * @param {R | BTNKeyOrNodeOrEntry<K, V, NODE>} beginRoot - The `beginRoot` parameter represents the
-     * starting point for finding the leftmost node in a binary tree. It can be either a root node (`R`),
-     * a key or node or entry (`BTNKeyOrNodeOrEntry<K, V, NODE>`), or `null` or `undefined`.
-     * @param {IterationType} iterationType - The `iterationType` parameter is used to specify the type
-     * of iteration to be performed. It can have two possible values:
-     * @returns The function `getLeftMost` returns the leftmost node in a binary tree.
+     * The function `getLeftMost` retrieves the leftmost node in a binary tree using either recursive or
+     * tail-recursive iteration.
+     * @param {C} callback - The `callback` parameter is a function that will be called with the leftmost
+     * node of a binary tree or null if the tree is empty. It has a default value of `_DEFAULT_CALLBACK`
+     * if not provided explicitly.
+     * @param {R | BTNKeyOrNodeOrEntry<K, V, NODE>} beginRoot - The `beginRoot` parameter in the
+     * `getLeftMost` function represents the starting point for finding the leftmost node in a binary
+     * tree. It can be either a reference to the root node of the tree (`R`), or a key, node, or entry in
+     * the binary tree structure (`
+     * @param {IterationType} iterationType - The `iterationType` parameter in the `getLeftMost` function
+     * specifies the type of iteration to be used when traversing the binary tree nodes. It can have two
+     * possible values:
+     * @returns The `getLeftMost` function returns the result of the callback function `C` applied to the
+     * leftmost node in the binary tree starting from the `beginRoot` node. If the `beginRoot` is `NIL`,
+     * it returns the result of the callback function applied to `undefined`. If the `beginRoot` is not a
+     * real node, it returns the result of the callback function applied
      */
-    getLeftMost(beginRoot = this.root, iterationType = this.iterationType) {
+    getLeftMost(callback = this._DEFAULT_CALLBACK, beginRoot = this.root, iterationType = this.iterationType) {
       if (this.isNIL(beginRoot))
-        return beginRoot;
+        return callback(void 0);
       beginRoot = this.ensureNode(beginRoot);
       if (!this.isRealNode(beginRoot))
-        return beginRoot;
+        return callback(beginRoot);
       if (iterationType === "RECURSIVE") {
         const dfs = (cur) => {
           if (!this.isRealNode(cur.left))
             return cur;
           return dfs(cur.left);
         };
-        return dfs(beginRoot);
+        return callback(dfs(beginRoot));
       } else {
         const dfs = trampoline((cur) => {
           if (!this.isRealNode(cur.left))
             return cur;
           return dfs.cont(cur.left);
         });
-        return dfs(beginRoot);
+        return callback(dfs(beginRoot));
       }
     }
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
      *
-     * The `getRightMost` function returns the rightmost node in a binary tree, either recursively or
-     * iteratively.
-     * @param {R | BTNKeyOrNodeOrEntry<K, V, NODE>} beginRoot - The `beginRoot` parameter represents the
-     * starting point for finding the rightmost node in a binary tree. It can be either a root node
-     * (`R`), a key or node or entry (`BTNKeyOrNodeOrEntry<K, V, NODE>`), or `null` or `undefined`.
-     * @param {IterationType} iterationType - The `iterationType` parameter is used to specify the type
-     * of iteration to be performed when finding the rightmost node in a binary tree. It can have two
-     * possible values:
-     * @returns The function `getRightMost` returns a NODE object, `null`, or `undefined`.
+     * The function `getRightMost` retrieves the rightmost node in a binary tree using either recursive
+     * or iterative traversal methods.
+     * @param {C} callback - The `callback` parameter is a function that will be called with the result
+     * of the operation. It has a generic type `C` which extends `BTNCallback<OptBTNOrNull<NODE>>`. The
+     * default value for `callback` is `this._DEFAULT_CALLBACK` if it is not provided.
+     * @param {R | BTNKeyOrNodeOrEntry<K, V, NODE>} beginRoot - The `beginRoot` parameter in the
+     * `getRightMost` function represents the starting point for finding the rightmost node in a binary
+     * tree. It can be either a reference to the root node of the tree (`this.root`) or a specific key,
+     * node, or entry in the tree. If
+     * @param {IterationType} iterationType - The `iterationType` parameter in the `getRightMost`
+     * function specifies the type of iteration to be used when finding the rightmost node in a binary
+     * tree. It can have two possible values:
+     * @returns The `getRightMost` function returns the result of the callback function `C` applied to
+     * the rightmost node in the binary tree. The rightmost node is found either through a recursive
+     * depth-first search (if `iterationType` is 'RECURSIVE') or through an indirect implementation of
+     * iteration using tail recursion optimization. The result of the callback function applied to the
+     * rightmost node is returned
      */
-    getRightMost(beginRoot = this.root, iterationType = this.iterationType) {
+    getRightMost(callback = this._DEFAULT_CALLBACK, beginRoot = this.root, iterationType = this.iterationType) {
       if (this.isNIL(beginRoot))
-        return beginRoot;
+        return callback(void 0);
       beginRoot = this.ensureNode(beginRoot);
       if (!beginRoot)
-        return beginRoot;
+        return callback(beginRoot);
       if (iterationType === "RECURSIVE") {
         const dfs = (cur) => {
           if (!this.isRealNode(cur.right))
             return cur;
           return dfs(cur.right);
         };
-        return dfs(beginRoot);
+        return callback(dfs(beginRoot));
       } else {
         const dfs = trampoline((cur) => {
           if (!this.isRealNode(cur.right))
             return cur;
           return dfs.cont(cur.right);
         });
-        return dfs(beginRoot);
+        return callback(dfs(beginRoot));
       }
     }
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -8838,10 +7990,6 @@ var dataStructureTyped = (() => {
         return node;
       }
     }
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -8856,7 +8004,7 @@ var dataStructureTyped = (() => {
       if (!this.isRealNode(x))
         return void 0;
       if (this.isRealNode(x.right)) {
-        return this.getLeftMost(x.right);
+        return this.getLeftMost((node) => node, x.right);
       }
       let y = x.parent;
       while (this.isRealNode(y) && x === y.right) {
@@ -8865,10 +8013,6 @@ var dataStructureTyped = (() => {
       }
       return y;
     }
-    /**
-     * Time complexity: O(n)
-     * Space complexity: O(n)
-     */
     /**
      * Time complexity: O(n)
      * Space complexity: O(n)
@@ -8892,109 +8036,12 @@ var dataStructureTyped = (() => {
      * values will
      * @returns an array of the return types of the callback function.
      */
-    dfs(callback = this._DEFAULT_CALLBACK, pattern = "IN", beginRoot = this.root, iterationType = "ITERATIVE", includeNull = false) {
+    dfs(callback = this._DEFAULT_CALLBACK, pattern = "IN", beginRoot = this.root, iterationType = this.iterationType, includeNull = false) {
       beginRoot = this.ensureNode(beginRoot);
       if (!beginRoot)
         return [];
-      const ans = [];
-      if (iterationType === "RECURSIVE") {
-        const dfs = (node) => {
-          switch (pattern) {
-            case "IN":
-              if (includeNull) {
-                if (this.isRealNode(node) && this.isNodeOrNull(node.left))
-                  dfs(node.left);
-                this.isNodeOrNull(node) && ans.push(callback(node));
-                if (this.isRealNode(node) && this.isNodeOrNull(node.right))
-                  dfs(node.right);
-              } else {
-                if (this.isRealNode(node) && this.isRealNode(node.left))
-                  dfs(node.left);
-                this.isRealNode(node) && ans.push(callback(node));
-                if (this.isRealNode(node) && this.isRealNode(node.right))
-                  dfs(node.right);
-              }
-              break;
-            case "PRE":
-              if (includeNull) {
-                this.isNodeOrNull(node) && ans.push(callback(node));
-                if (this.isRealNode(node) && this.isNodeOrNull(node.left))
-                  dfs(node.left);
-                if (this.isRealNode(node) && this.isNodeOrNull(node.right))
-                  dfs(node.right);
-              } else {
-                this.isRealNode(node) && ans.push(callback(node));
-                if (this.isRealNode(node) && this.isRealNode(node.left))
-                  dfs(node.left);
-                if (this.isRealNode(node) && this.isRealNode(node.right))
-                  dfs(node.right);
-              }
-              break;
-            case "POST":
-              if (includeNull) {
-                if (this.isRealNode(node) && this.isNodeOrNull(node.left))
-                  dfs(node.left);
-                if (this.isRealNode(node) && this.isNodeOrNull(node.right))
-                  dfs(node.right);
-                this.isNodeOrNull(node) && ans.push(callback(node));
-              } else {
-                if (this.isRealNode(node) && this.isRealNode(node.left))
-                  dfs(node.left);
-                if (this.isRealNode(node) && this.isRealNode(node.right))
-                  dfs(node.right);
-                this.isRealNode(node) && ans.push(callback(node));
-              }
-              break;
-          }
-        };
-        dfs(beginRoot);
-      } else {
-        const stack = [{ opt: 0, node: beginRoot }];
-        while (stack.length > 0) {
-          const cur = stack.pop();
-          if (cur === void 0 || this.isNIL(cur.node))
-            continue;
-          if (includeNull) {
-            if (cur.node === void 0)
-              continue;
-          } else {
-            if (cur.node === null || cur.node === void 0)
-              continue;
-          }
-          if (cur.opt === 1) {
-            ans.push(callback(cur.node));
-          } else {
-            switch (pattern) {
-              case "IN":
-                cur.node && stack.push({ opt: 0, node: cur.node.right });
-                stack.push({ opt: 1, node: cur.node });
-                cur.node && stack.push({ opt: 0, node: cur.node.left });
-                break;
-              case "PRE":
-                cur.node && stack.push({ opt: 0, node: cur.node.right });
-                cur.node && stack.push({ opt: 0, node: cur.node.left });
-                stack.push({ opt: 1, node: cur.node });
-                break;
-              case "POST":
-                stack.push({ opt: 1, node: cur.node });
-                cur.node && stack.push({ opt: 0, node: cur.node.right });
-                cur.node && stack.push({ opt: 0, node: cur.node.left });
-                break;
-              default:
-                cur.node && stack.push({ opt: 0, node: cur.node.right });
-                stack.push({ opt: 1, node: cur.node });
-                cur.node && stack.push({ opt: 0, node: cur.node.left });
-                break;
-            }
-          }
-        }
-      }
-      return ans;
+      return this._dfs(callback, pattern, beginRoot, iterationType, includeNull);
     }
-    /**
-     * Time complexity: O(n)
-     * Space complexity: O(n)
-     */
     /**
      * Time complexity: O(n)
      * Space complexity: O(n)
@@ -9030,9 +8077,9 @@ var dataStructureTyped = (() => {
           const current = queue.shift();
           ans.push(callback(current));
           if (includeNull) {
-            if (current && this.isNodeOrNull(current.left))
+            if (current && this.isRealNodeOrNull(current.left))
               queue.push(current.left);
-            if (current && this.isNodeOrNull(current.right))
+            if (current && this.isRealNodeOrNull(current.right))
               queue.push(current.right);
           } else {
             if (this.isRealNode(current.left))
@@ -9051,9 +8098,9 @@ var dataStructureTyped = (() => {
             const current = queue.shift();
             ans.push(callback(current));
             if (includeNull) {
-              if (current && this.isNodeOrNull(current.left))
+              if (current && this.isRealNodeOrNull(current.left))
                 queue.push(current.left);
-              if (current && this.isNodeOrNull(current.right))
+              if (current && this.isRealNodeOrNull(current.right))
                 queue.push(current.right);
             } else {
               if (this.isRealNode(current.left))
@@ -9069,7 +8116,54 @@ var dataStructureTyped = (() => {
     /**
      * Time complexity: O(n)
      * Space complexity: O(n)
-     */
+     *
+     * The `leaves` function in TypeScript iterates through a binary tree to find and return the leaf
+     * nodes 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 a generic type `C` that extends `BTNCallback<NODE | null>`, where `NODE`
+     * represents a node in the binary tree. The default value for `callback` is
+     * @param {R | BTNKeyOrNodeOrEntry<K, V, NODE>} beginRoot - The `beginRoot` parameter in the `leaves`
+     * method is used to specify the starting point for finding and processing the leaves of a binary
+     * tree. It represents the root node of the binary tree or a specific key, node, or entry within the
+     * tree from which the search for leaves should begin
+     * @param {IterationType} iterationType - The `iterationType` parameter in the `leaves` method
+     * specifies the type of iteration to be performed when collecting the leaves of a binary tree. It
+     * can have two possible values:
+     * @returns The `leaves` method returns an array of values that are the result of applying the
+     * provided callback function to the leaf nodes in the binary tree structure.
+     */
+    leaves(callback = this._DEFAULT_CALLBACK, beginRoot = this.root, iterationType = this.iterationType) {
+      beginRoot = this.ensureNode(beginRoot);
+      const leaves = [];
+      if (!this.isRealNode(beginRoot)) {
+        return [];
+      }
+      if (iterationType === "RECURSIVE") {
+        const dfs = (cur) => {
+          if (this.isLeaf(cur)) {
+            leaves.push(callback(cur));
+          }
+          if (!this.isRealNode(cur.left) && !this.isRealNode(cur.right))
+            return;
+          this.isRealNode(cur.left) && dfs(cur.left);
+          this.isRealNode(cur.right) && dfs(cur.right);
+        };
+        dfs(beginRoot);
+      } else {
+        const queue = new Queue([beginRoot]);
+        while (queue.size > 0) {
+          const cur = queue.shift();
+          if (this.isRealNode(cur)) {
+            if (this.isLeaf(cur)) {
+              leaves.push(callback(cur));
+            }
+            this.isRealNode(cur.left) && queue.push(cur.left);
+            this.isRealNode(cur.right) && queue.push(cur.right);
+          }
+        }
+      }
+      return leaves;
+    }
     /**
      * Time complexity: O(n)
      * Space complexity: O(n)
@@ -9102,9 +8196,9 @@ var dataStructureTyped = (() => {
             levelsNodes[level] = [];
           levelsNodes[level].push(callback(node));
           if (includeNull) {
-            if (node && this.isNodeOrNull(node.left))
+            if (node && this.isRealNodeOrNull(node.left))
               _recursive(node.left, level + 1);
-            if (node && this.isNodeOrNull(node.right))
+            if (node && this.isRealNodeOrNull(node.right))
               _recursive(node.right, level + 1);
           } else {
             if (node && node.left)
@@ -9123,9 +8217,9 @@ var dataStructureTyped = (() => {
             levelsNodes[level] = [];
           levelsNodes[level].push(callback(node));
           if (includeNull) {
-            if (node && this.isNodeOrNull(node.right))
+            if (node && this.isRealNodeOrNull(node.right))
               stack.push([node.right, level + 1]);
-            if (node && this.isNodeOrNull(node.left))
+            if (node && this.isRealNodeOrNull(node.left))
               stack.push([node.left, level + 1]);
           } else {
             if (node && node.right)
@@ -9137,10 +8231,6 @@ var dataStructureTyped = (() => {
       }
       return levelsNodes;
     }
-    /**
-     * Time complexity: O(n)
-     * Space complexity: O(n)
-     */
     /**
      * Time complexity: O(n)
      * Space complexity: O(n)
@@ -9241,10 +8331,6 @@ var dataStructureTyped = (() => {
       }
       return ans;
     }
-    /**
-     * Time complexity: O(n)
-     * Space complexity: O(n)
-     */
     /**
      * Time complexity: O(n)
      * Space complexity: O(n)
@@ -9267,10 +8353,6 @@ var dataStructureTyped = (() => {
       );
       return cloned;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -9296,10 +8378,6 @@ var dataStructureTyped = (() => {
       }
       return newTree;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -9332,10 +8410,6 @@ var dataStructureTyped = (() => {
     // //   return newTree;
     // // }
     //
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -9353,29 +8427,163 @@ var dataStructureTyped = (() => {
     print(beginRoot = this.root, options) {
       const opts = __spreadValues({ isShowUndefined: false, isShowNull: false, isShowRedBlackNIL: false }, options);
       beginRoot = this.ensureNode(beginRoot);
+      let output = "";
       if (!beginRoot)
-        return;
+        return output;
       if (opts.isShowUndefined)
-        console.log(`U for undefined
-      `);
+        output += `U for undefined
+      `;
       if (opts.isShowNull)
-        console.log(`N for null
-      `);
+        output += `N for null
+      `;
       if (opts.isShowRedBlackNIL)
-        console.log(`S for Sentinel Node(NIL)
-      `);
+        output += `S for Sentinel Node(NIL)
+      `;
       const display = (root) => {
         const [lines, , ,] = this._displayAux(root, opts);
+        let paragraph = "";
         for (const line of lines) {
-          console.log(line);
+          paragraph += line + "\n";
         }
+        output += paragraph;
       };
       display(beginRoot);
+      return output;
     }
     /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
+     * 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 order pattern and callback function.
+     * @param {C} callback - The `callback` parameter is a function that will be called on each node
+     * visited during the depth-first search. It is of type `C`, which extends
+     * `BTNCallback<OptBTNOrNull<NODE>>`. The default value is set to `this._DEFAULT_CALLBACK` if not
+     * provided.
+     * @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 a binary tree.
+     * It can have one of the following values:
+     * @param {R | BTNKeyOrNodeOrEntry<K, V, NODE>} beginRoot - The `beginRoot` 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 the root node of the tree or a key, node, or entry that exists
+     * in the tree. If no specific `
+     * @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. 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`, the traversal will consider null nodes as valid nodes to visit and
+     * process. If set to `
+     * @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
+     * input 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 a given 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
+     * input and returns a boolean value indicating whether the node should be processed during the
+     * depth-first search traversal. The default implementation of this function simply returns `true`,
+     * meaning that by default all nodes will be processed. However, you can
+     * @returns The `_dfs` method returns an array of the return type of the callback function provided
+     * as input.
+     */
+    _dfs(callback = this._DEFAULT_CALLBACK, pattern = "IN", beginRoot = 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) => true) {
+      beginRoot = this.ensureNode(beginRoot);
+      if (!beginRoot)
+        return [];
+      const ans = [];
+      if (iterationType === "RECURSIVE") {
+        const dfs = (node) => {
+          if (!shouldVisitRoot(node))
+            return;
+          const visitLeft = () => {
+            if (shouldVisitLeft(node))
+              dfs(node == null ? void 0 : node.left);
+          };
+          const visitRight = () => {
+            if (shouldVisitRight(node))
+              dfs(node == null ? void 0 : node.right);
+          };
+          switch (pattern) {
+            case "IN":
+              visitLeft();
+              if (shouldProcessRoot(node))
+                ans.push(callback(node));
+              visitRight();
+              break;
+            case "PRE":
+              if (shouldProcessRoot(node))
+                ans.push(callback(node));
+              visitLeft();
+              visitRight();
+              break;
+            case "POST":
+              visitLeft();
+              visitRight();
+              if (shouldProcessRoot(node))
+                ans.push(callback(node));
+              break;
+          }
+        };
+        dfs(beginRoot);
+      } else {
+        const stack = [{ opt: 0 /* VISIT */, node: beginRoot }];
+        const pushLeft = (cur) => {
+          var _a;
+          if (shouldVisitLeft(cur.node))
+            stack.push({ opt: 0 /* VISIT */, node: (_a = cur.node) == null ? void 0 : _a.left });
+        };
+        const pushRight = (cur) => {
+          var _a;
+          if (shouldVisitRight(cur.node))
+            stack.push({ opt: 0 /* VISIT */, node: (_a = cur.node) == null ? void 0 : _a.right });
+        };
+        const pushRoot = (cur) => {
+          if (shouldVisitRoot(cur.node))
+            stack.push({ opt: 1 /* PROCESS */, node: cur.node });
+        };
+        while (stack.length > 0) {
+          const cur = stack.pop();
+          if (cur === void 0)
+            continue;
+          if (!shouldVisitRoot(cur.node))
+            continue;
+          if (cur.opt === 1 /* PROCESS */) {
+            if (shouldProcessRoot(cur.node))
+              ans.push(callback(cur.node));
+          } else {
+            switch (pattern) {
+              case "IN":
+                pushRight(cur);
+                pushRoot(cur);
+                pushLeft(cur);
+                break;
+              case "PRE":
+                pushRight(cur);
+                pushLeft(cur);
+                pushRoot(cur);
+                break;
+              case "POST":
+                pushRoot(cur);
+                pushRight(cur);
+                pushLeft(cur);
+                break;
+            }
+          }
+        }
+      }
+      return ans;
+    }
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -9413,10 +8621,6 @@ var dataStructureTyped = (() => {
         }
       }
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -9474,10 +8678,6 @@ var dataStructureTyped = (() => {
         ];
       }
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -9507,10 +8707,6 @@ var dataStructureTyped = (() => {
       }
       return void 0;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -9539,10 +8735,6 @@ var dataStructureTyped = (() => {
       }
       return newNode;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -9558,10 +8750,6 @@ var dataStructureTyped = (() => {
       }
       this._root = v;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -9724,7 +8912,7 @@ var dataStructureTyped = (() => {
      * @returns The method is returning either the node that was ensured or `undefined` if the node could
      * not be ensured.
      */
-    ensureNode(keyOrNodeOrEntryOrRawElement, iterationType = "ITERATIVE") {
+    ensureNode(keyOrNodeOrEntryOrRawElement, iterationType = this.iterationType) {
       var _a;
       return (_a = super.ensureNode(keyOrNodeOrEntryOrRawElement, iterationType)) != null ? _a : void 0;
     }
@@ -9738,6 +8926,9 @@ var dataStructureTyped = (() => {
     isNode(keyOrNodeOrEntryOrRawElement) {
       return keyOrNodeOrEntryOrRawElement instanceof BSTNode;
     }
+    isKey(key) {
+      return isComparable(key, this.comparator !== this._DEFAULT_COMPARATOR);
+    }
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -9781,10 +8972,6 @@ var dataStructureTyped = (() => {
       }
       return false;
     }
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(log n)
-     */
     /**
      * Time Complexity: O(k log n)
      * Space Complexity: O(k + log n)
@@ -9911,6 +9098,10 @@ var dataStructureTyped = (() => {
      * @returns The method `getNodes` returns an array of `NODE` objects.
      */
     getNodes(identifier, callback = this._DEFAULT_CALLBACK, onlyOne = false, beginRoot = this.root, iterationType = this.iterationType) {
+      if (identifier === void 0)
+        return [];
+      if (identifier === null)
+        return [];
       beginRoot = this.ensureNode(beginRoot);
       if (!beginRoot)
         return [];
@@ -9960,10 +9151,6 @@ var dataStructureTyped = (() => {
       }
       return ans;
     }
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -9989,10 +9176,6 @@ var dataStructureTyped = (() => {
       var _a;
       return (_a = this.getNodes(identifier, callback, true, beginRoot, iterationType)[0]) != null ? _a : void 0;
     }
-    /**
-     * Time Complexity: O(k log n)
-     * Space Complexity: O(k + log n)
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -10006,13 +9189,9 @@ var dataStructureTyped = (() => {
      * It has a default value of `'ITERATIVE'`.
      * @returns The method is returning a NODE object or undefined.
      */
-    getNodeByKey(key, iterationType = "ITERATIVE") {
+    getNodeByKey(key, iterationType = this.iterationType) {
       return this.getNode(key, this._DEFAULT_CALLBACK, this.root, iterationType);
     }
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(k + log n)
-     */
     /**
      * Time complexity: O(n)
      * Space complexity: O(n)
@@ -10033,13 +9212,9 @@ var dataStructureTyped = (() => {
      * following values:
      * @returns The method is returning an array of the return type of the callback function.
      */
-    dfs(callback = this._DEFAULT_CALLBACK, pattern = "IN", beginRoot = this.root, iterationType = "ITERATIVE") {
-      return super.dfs(callback, pattern, beginRoot, iterationType, false);
-    }
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
+    dfs(callback = this._DEFAULT_CALLBACK, pattern = "IN", beginRoot = this.root, iterationType = this.iterationType) {
+      return super.dfs(callback, pattern, beginRoot, iterationType);
+    }
     /**
      * Time complexity: O(n)
      * Space complexity: O(n)
@@ -10060,10 +9235,6 @@ var dataStructureTyped = (() => {
     bfs(callback = this._DEFAULT_CALLBACK, beginRoot = this.root, iterationType = this.iterationType) {
       return super.bfs(callback, beginRoot, iterationType, false);
     }
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time complexity: O(n)
      * Space complexity: O(n)
@@ -10085,10 +9256,6 @@ var dataStructureTyped = (() => {
     listLevels(callback = this._DEFAULT_CALLBACK, beginRoot = this.root, iterationType = this.iterationType) {
       return super.listLevels(callback, beginRoot, iterationType, false);
     }
-    /**
-     * Time complexity: O(n)
-     * Space complexity: O(n)
-     */
     /**
      * Time complexity: O(n)
      * Space complexity: O(n)
@@ -10147,10 +9314,6 @@ var dataStructureTyped = (() => {
         return ans;
       }
     }
-    /**
-     * Time complexity: O(n)
-     * Space complexity: O(n)
-     */
     /**
      * Time complexity: O(n)
      * Space complexity: O(n)
@@ -10198,10 +9361,6 @@ var dataStructureTyped = (() => {
         return true;
       }
     }
-    /**
-     * Time complexity: O(n)
-     * Space complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(log n)
@@ -10257,10 +9416,6 @@ var dataStructureTyped = (() => {
       }
       return balanced;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(log n)
-     */
     /**
      * The function returns the value of the _comparator property.
      * @returns The `_comparator` property is being returned.
@@ -10929,11 +10084,6 @@ var dataStructureTyped = (() => {
     isNode(keyOrNodeOrEntryOrRawElement) {
       return keyOrNodeOrEntryOrRawElement instanceof AVLTreeNode;
     }
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     * logarithmic time, where "n" is the number of nodes in the tree. The add method of the superclass (BST) has logarithmic time complexity. constant space, as it doesn't use additional data structures that scale with input size.
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -10955,10 +10105,6 @@ var dataStructureTyped = (() => {
         this._balancePath(keyOrNodeOrEntryOrRawElement);
       return inserted;
     }
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -10981,10 +10127,6 @@ var dataStructureTyped = (() => {
       }
       return deletedResults;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -11017,10 +10159,6 @@ var dataStructureTyped = (() => {
       }
       return void 0;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -11039,10 +10177,6 @@ var dataStructureTyped = (() => {
       else
         return node.right.height - node.left.height;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -11062,10 +10196,6 @@ var dataStructureTyped = (() => {
       else
         node.height = 1 + Math.max(node.right.height, node.left.height);
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -11101,10 +10231,6 @@ var dataStructureTyped = (() => {
       if (B)
         this._updateHeight(B);
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -11155,10 +10281,6 @@ var dataStructureTyped = (() => {
       B && this._updateHeight(B);
       C && this._updateHeight(C);
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -11195,10 +10317,6 @@ var dataStructureTyped = (() => {
       this._updateHeight(A);
       B && this._updateHeight(B);
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -11249,11 +10367,6 @@ var dataStructureTyped = (() => {
       B && this._updateHeight(B);
       C && this._updateHeight(C);
     }
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     * logarithmic time, where "n" is the number of nodes in the tree. The method traverses the path from the inserted node to the root. constant space, as it doesn't use additional data structures that scale with input size.
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -11290,10 +10403,6 @@ var dataStructureTyped = (() => {
         }
       }
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -11400,10 +10509,6 @@ var dataStructureTyped = (() => {
         iterationType: this.iterationType
       }, options));
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -11439,7 +10544,7 @@ var dataStructureTyped = (() => {
     //
     //   if (this.toEntryFn) {
     //     const [key, entryValue] = this.toEntryFn(keyOrNodeOrEntryOrRawElement as R);
-    //     if (key) return this.createNode(key, entryValue ?? value, 'RED');
+    //     if (this.isKey(key)) return this.createNode(key, entryValue ?? value, 'RED');
     //   }
     //
     //   if (this.isEntry(keyOrNodeOrEntryOrRawElement)) {
@@ -11452,10 +10557,6 @@ var dataStructureTyped = (() => {
     //
     //   return ;
     // }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -11467,10 +10568,6 @@ var dataStructureTyped = (() => {
       super.clear();
       this._root = this.NIL;
     }
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -11502,10 +10599,6 @@ var dataStructureTyped = (() => {
       } else
         return insertStatus === "UPDATED";
     }
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -11540,7 +10633,7 @@ var dataStructureTyped = (() => {
         replacementNode = nodeToDelete.left;
         this._transplant(nodeToDelete, nodeToDelete.left);
       } else {
-        const successor = this.getLeftMost(nodeToDelete.right);
+        const successor = this.getLeftMost((node) => node, nodeToDelete.right);
         if (successor) {
           originalColor = successor.color;
           replacementNode = successor.right;
@@ -11570,10 +10663,6 @@ var dataStructureTyped = (() => {
       results.push({ deleted: nodeToDelete, needBalanced: void 0 });
       return results;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -11588,10 +10677,6 @@ var dataStructureTyped = (() => {
       }
       this._root = v;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -11608,10 +10693,6 @@ var dataStructureTyped = (() => {
       newNode.color = oldNode.color;
       return super._replaceNode(oldNode, newNode);
     }
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -11654,10 +10735,6 @@ var dataStructureTyped = (() => {
       this._insertFixup(node);
       return "CREATED";
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -11679,10 +10756,6 @@ var dataStructureTyped = (() => {
         v.parent = u.parent;
       }
     }
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -11735,10 +10808,6 @@ var dataStructureTyped = (() => {
       if (this.isRealNode(this._root))
         this._root.color = "BLACK";
     }
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -11814,10 +10883,6 @@ var dataStructureTyped = (() => {
         node.color = "BLACK";
       }
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -11847,10 +10912,6 @@ var dataStructureTyped = (() => {
       y.left = x;
       x.parent = y;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -11938,10 +10999,6 @@ var dataStructureTyped = (() => {
     get count() {
       return this._count;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -12009,26 +11066,22 @@ var dataStructureTyped = (() => {
         return;
       if (this.isNode(keyOrNodeOrEntryOrRawElement))
         return keyOrNodeOrEntryOrRawElement;
-      if (this.toEntryFn) {
-        const [key, entryValue] = this.toEntryFn(keyOrNodeOrEntryOrRawElement);
-        if (key)
-          return this.createNode(key, entryValue != null ? entryValue : value, count);
-      }
       if (this.isEntry(keyOrNodeOrEntryOrRawElement)) {
-        const [key, value2] = keyOrNodeOrEntryOrRawElement;
+        const [key, entryValue] = keyOrNodeOrEntryOrRawElement;
         if (key === void 0 || key === null)
           return;
-        else
-          return this.createNode(key, value2, count);
+        if (this.isKey(key))
+          return this.createNode(key, value != null ? value : entryValue, count);
+      }
+      if (this.toEntryFn) {
+        const [key, entryValue] = this.toEntryFn(keyOrNodeOrEntryOrRawElement);
+        if (this.isKey(key))
+          return this.createNode(key, value != null ? value : entryValue, count);
       }
       if (this.isKey(keyOrNodeOrEntryOrRawElement))
         return this.createNode(keyOrNodeOrEntryOrRawElement, value, count);
       return;
     }
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -12057,10 +11110,6 @@ var dataStructureTyped = (() => {
       }
       return true;
     }
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -12109,7 +11158,7 @@ var dataStructureTyped = (() => {
             needBalanced = parent;
           }
         } else {
-          const leftSubTreeRightMost = curr.left ? this.getRightMost(curr.left) : void 0;
+          const leftSubTreeRightMost = curr.left ? this.getRightMost((node) => node, curr.left) : void 0;
           if (leftSubTreeRightMost) {
             const parentOfLeftSubTreeMax = leftSubTreeRightMost.parent;
             orgCurrent = this._swapProperties(curr, leftSubTreeRightMost);
@@ -12133,10 +11182,6 @@ var dataStructureTyped = (() => {
       }
       return deletedResult;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -12148,10 +11193,6 @@ var dataStructureTyped = (() => {
       super.clear();
       this._count = 0;
     }
-    /**
-     * Time Complexity: O(n log n)
-     * Space Complexity: O(log n)
-     */
     /**
      * Time Complexity: O(n log n)
      * Space Complexity: O(log n)
@@ -12199,10 +11240,6 @@ var dataStructureTyped = (() => {
         return true;
       }
     }
-    /**
-     * Time complexity: O(n)
-     * Space complexity: O(n)
-     */
     /**
      * Time complexity: O(n)
      * Space complexity: O(n)
@@ -12215,10 +11252,6 @@ var dataStructureTyped = (() => {
       this.bfs((node) => cloned.add(node.key, node.value, node.count));
       return cloned;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -12253,10 +11286,6 @@ var dataStructureTyped = (() => {
       }
       return void 0;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -12333,10 +11362,6 @@ var dataStructureTyped = (() => {
     get count() {
       return this._count;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -12396,17 +11421,17 @@ var dataStructureTyped = (() => {
         return;
       if (this.isNode(keyOrNodeOrEntryOrRawElement))
         return keyOrNodeOrEntryOrRawElement;
-      if (this.toEntryFn) {
-        const [key] = this.toEntryFn(keyOrNodeOrEntryOrRawElement);
-        if (key)
-          return this.getNodeByKey(key);
-      }
       if (this.isEntry(keyOrNodeOrEntryOrRawElement)) {
-        const [key, value2] = keyOrNodeOrEntryOrRawElement;
+        const [key, entryValue] = keyOrNodeOrEntryOrRawElement;
         if (key === void 0 || key === null)
           return;
-        else
-          return this.createNode(key, value2, "BLACK", count);
+        if (this.isKey(key))
+          return this.createNode(key, value != null ? value : entryValue, "BLACK", count);
+      }
+      if (this.toEntryFn) {
+        const [key, entryValue] = this.toEntryFn(keyOrNodeOrEntryOrRawElement);
+        if (this.isKey(key))
+          return this.createNode(key, value != null ? value : entryValue, "BLACK", count);
       }
       if (this.isKey(keyOrNodeOrEntryOrRawElement))
         return this.createNode(keyOrNodeOrEntryOrRawElement, value, "BLACK", count);
@@ -12422,10 +11447,6 @@ var dataStructureTyped = (() => {
     isNode(keyOrNodeOrEntryOrRawElement) {
       return keyOrNodeOrEntryOrRawElement instanceof TreeMultiMapNode;
     }
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -12453,10 +11474,6 @@ var dataStructureTyped = (() => {
         return false;
       }
     }
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -12509,7 +11526,7 @@ var dataStructureTyped = (() => {
           return results;
         }
       } else {
-        const successor = this.getLeftMost(nodeToDelete.right);
+        const successor = this.getLeftMost((node) => node, nodeToDelete.right);
         if (successor) {
           originalColor = successor.color;
           replacementNode = successor.right;
@@ -12555,10 +11572,6 @@ var dataStructureTyped = (() => {
       results.push({ deleted: nodeToDelete, needBalanced: void 0 });
       return results;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -12570,10 +11583,6 @@ var dataStructureTyped = (() => {
       super.clear();
       this._count = 0;
     }
-    /**
-     * Time Complexity: O(n log n)
-     * Space Complexity: O(log n)
-     */
     /**
      * Time Complexity: O(n log n)
      * Space Complexity: O(log n)
@@ -12622,10 +11631,6 @@ var dataStructureTyped = (() => {
         return true;
       }
     }
-    /**
-     * Time complexity: O(n)
-     * Space complexity: O(n)
-     */
     /**
      * Time complexity: O(n)
      * Space complexity: O(n)
@@ -12638,10 +11643,6 @@ var dataStructureTyped = (() => {
       this.bfs((node) => cloned.add(node.key, node.value, node.count));
       return cloned;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -12677,10 +11678,6 @@ var dataStructureTyped = (() => {
       }
       return void 0;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -13618,10 +12615,6 @@ var dataStructureTyped = (() => {
     get root() {
       return this._root;
     }
-    /**
-     * Time Complexity: O(l), where l is the length of the word being added.
-     * Space Complexity: O(l) - Each character in the word adds a TrieNode.
-     */
     /**
      * Time Complexity: O(l), where l is the length of the word being added.
      * Space Complexity: O(l) - Each character in the word adds a TrieNode.
@@ -13649,10 +12642,6 @@ var dataStructureTyped = (() => {
       }
       return isNewWord;
     }
-    /**
-     * Time Complexity: O(l), where l is the length of the input word.
-     * Space Complexity: O(1) - Constant space.
-     */
     /**
      * Time Complexity: O(l), where l is the length of the input word.
      * Space Complexity: O(1) - Constant space.
@@ -13672,10 +12661,6 @@ var dataStructureTyped = (() => {
       }
       return cur.isEnd;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -13686,10 +12671,6 @@ var dataStructureTyped = (() => {
     isEmpty() {
       return this.size === 0;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -13700,10 +12681,6 @@ var dataStructureTyped = (() => {
       this._size = 0;
       this._root = new TrieNode("");
     }
-    /**
-     * Time Complexity: O(l), where l is the length of the word being deleted.
-     * Space Complexity: O(n) - Due to the recursive DFS approach.
-     */
     /**
      * Time Complexity: O(l), where l is the length of the word being deleted.
      * Space Complexity: O(n) - Due to the recursive DFS approach.
@@ -13746,10 +12723,6 @@ var dataStructureTyped = (() => {
       }
       return isDeleted;
     }
-    /**
-     * Time Complexity: O(n), where n is the total number of nodes in the trie.
-     * Space Complexity: O(1) - Constant space.
-     */
     /**
      * Time Complexity: O(n), where n is the total number of nodes in the trie.
      * Space Complexity: O(1) - Constant space.
@@ -13774,10 +12747,6 @@ var dataStructureTyped = (() => {
       }
       return maxDepth;
     }
-    /**
-     * Time Complexity: O(l), where l is the length of the input prefix.
-     * Space Complexity: O(1) - Constant space.
-     */
     /**
      * Time Complexity: O(l), where l is the length of the input prefix.
      * Space Complexity: O(1) - Constant space.
@@ -13797,10 +12766,6 @@ var dataStructureTyped = (() => {
       }
       return !cur.isEnd;
     }
-    /**
-     * Time Complexity: O(l), where l is the length of the input prefix.
-     * Space Complexity: O(1) - Constant space.
-     */
     /**
      * Time Complexity: O(l), where l is the length of the input prefix.
      * Space Complexity: O(1) - Constant space.
@@ -13820,10 +12785,6 @@ var dataStructureTyped = (() => {
       }
       return true;
     }
-    /**
-     * Time Complexity: O(n), where n is the total number of nodes in the trie.
-     * Space Complexity: O(l), where l is the length of the input prefix.
-     */
     /**
      * Time Complexity: O(n), where n is the total number of nodes in the trie.
      * Space Complexity: O(l), where l is the length of the input prefix.
@@ -13849,10 +12810,6 @@ var dataStructureTyped = (() => {
       dfs(this.root);
       return commonPre === input;
     }
-    /**
-     * Time Complexity: O(n), where n is the total number of nodes in the trie.
-     * Space Complexity: O(l), where l is the length of the longest common prefix.
-     */
     /**
      * Time Complexity: O(n), where n is the total number of nodes in the trie.
      * Space Complexity: O(l), where l is the length of the longest common prefix.
@@ -13874,10 +12831,6 @@ var dataStructureTyped = (() => {
       dfs(this.root);
       return commonPre;
     }
-    /**
-     * Time Complexity: O(w * l), where w is the number of words retrieved, and l is the average length of the words.
-     * Space Complexity: O(w * l) - The space required for the output array.
-     */
     /**
      * Time Complexity: O(w * l), where w is the number of words retrieved, and l is the average length of the words.
      * Space Complexity: O(w * l) - The space required for the output array.
@@ -13922,10 +12875,6 @@ var dataStructureTyped = (() => {
         dfs(startNode, prefix);
       return words;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -13937,10 +12886,6 @@ var dataStructureTyped = (() => {
     clone() {
       return new _Trie(this, { caseSensitive: this.caseSensitive, toElementFn: this.toElementFn });
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -13966,10 +12911,6 @@ var dataStructureTyped = (() => {
       }
       return results;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -13997,10 +12938,6 @@ var dataStructureTyped = (() => {
       }
       return newTrie;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -14019,10 +12956,6 @@ var dataStructureTyped = (() => {
       }
       yield* __yieldStar(_dfs(this.root, ""));
     }
-    /**
-     * Time Complexity: O(l), where l is the length of the input string.
-     * Space Complexity: O(1) - Constant space.
-     */
     /**
      * Time Complexity: O(l), where l is the length of the input string.
      * Space Complexity: O(1) - Constant space.
@@ -14056,7 +12989,6 @@ var dataStructureTyped = (() => {
       __publicField(this, "_children");
       this._key = key;
       this._value = value || void 0;
-      this._children = children || [];
     }
     /**
      * The function returns the value of the protected variable _key.