data-structure-typed 1.53.6 → 1.53.8

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

@@ -131,6 +131,7 @@ var dataStructureTyped = (() => {
     Navigator: () => Navigator,
     PriorityQueue: () => PriorityQueue,
     Queue: () => Queue,
+    Range: () => Range,
     RedBlackTree: () => RedBlackTree,
     RedBlackTreeNode: () => RedBlackTreeNode,
     SegmentTree: () => SegmentTree,
@@ -670,7 +671,7 @@ var dataStructureTyped = (() => {
   };
   function isPrimitiveComparable(value) {
     const valueType = typeof value;
-    if (valueType === "number") return !Number.isNaN(value);
+    if (valueType === "number") return true;
     return valueType === "bigint" || valueType === "string" || valueType === "boolean";
   }
   function tryObjectToPrimitive(obj) {
@@ -691,7 +692,7 @@ var dataStructureTyped = (() => {
     if (value === null || value === void 0) return false;
     if (isPrimitiveComparable(value)) return true;
     if (typeof value !== "object") return false;
-    if (value instanceof Date) return !Number.isNaN(value.getTime());
+    if (value instanceof Date) return true;
     if (isForceObjectComparable) return true;
     const comparableValue = tryObjectToPrimitive(value);
     if (comparableValue === null || comparableValue === void 0) return false;
@@ -770,6 +771,9 @@ var dataStructureTyped = (() => {
       return this._hashFn;
     }
     /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     *
      * The function checks if a given element is an array with exactly two elements.
      * @param {any} rawElement - The `rawElement` parameter is of type `any`, which means it can be any
      * data type.
@@ -779,6 +783,9 @@ var dataStructureTyped = (() => {
       return Array.isArray(rawElement) && rawElement.length === 2;
     }
     /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     *
      * The function checks if the size of an object is equal to zero and returns a boolean value.
      * @returns A boolean value indicating whether the size of the object is 0 or not.
      */
@@ -786,6 +793,9 @@ var dataStructureTyped = (() => {
       return this._size === 0;
     }
     /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     *
      * The clear() function resets the state of an object by clearing its internal store, object map, and
      * size.
      */
@@ -795,6 +805,9 @@ var dataStructureTyped = (() => {
       this._size = 0;
     }
     /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     *
      * The `set` function adds a key-value pair to a map-like data structure, incrementing the size if
      * the key is not already present.
      * @param {K} key - The key parameter is the key used to identify the value in the data structure. It
@@ -819,6 +832,9 @@ var dataStructureTyped = (() => {
       return true;
     }
     /**
+     * Time Complexity: O(k)
+     * Space Complexity: O(k)
+     *
      * The function `setMany` takes an iterable collection of objects, maps each object to a key-value
      * pair using a mapping function, and sets each key-value pair in the current object.
      * @param entryOrRawElements - The `entryOrRawElements` parameter is an iterable collection of elements of a type
@@ -842,6 +858,9 @@ var dataStructureTyped = (() => {
       return results;
     }
     /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     *
      * The `get` function retrieves a value from a map based on a given key, either from an object map or
      * a string map.
      * @param {K} key - The `key` parameter is the key used to retrieve a value from the map. It can be
@@ -859,6 +878,9 @@ var dataStructureTyped = (() => {
       }
     }
     /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     *
      * The `has` function checks if a given key exists in the `_objMap` or `_store` based on whether it
      * is an object key or not.
      * @param {K} key - The parameter "key" is of type K, which means it can be any type.
@@ -873,6 +895,9 @@ var dataStructureTyped = (() => {
       }
     }
     /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     *
      * The `delete` function removes an element from a map-like data structure based on the provided key.
      * @param {K} key - The `key` parameter is the key of the element that you want to delete from the
      * data structure.
@@ -1194,6 +1219,9 @@ var dataStructureTyped = (() => {
       return true;
     }
     /**
+     * Time Complexity: O(k)
+     * Space Complexity: O(k)
+     *
      * The function `setMany` takes an iterable collection, converts each element into a key-value pair
      * using a provided function, and sets each key-value pair in the current object, returning an array
      * of booleans indicating the success of each set operation.
@@ -1218,6 +1246,9 @@ var dataStructureTyped = (() => {
       return results;
     }
     /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     *
      * The function checks if a given key exists in a map, using different logic depending on whether the
      * key is a weak key or not.
      * @param {K} key - The `key` parameter is the key that is being checked for existence in the map.
@@ -1513,15 +1544,7 @@ var dataStructureTyped = (() => {
       __publicField(this, "_head");
       __publicField(this, "_tail");
       __publicField(this, "_size", 0);
-      if (elements) {
-        for (const el of elements) {
-          if (this.toElementFn) {
-            this.push(this.toElementFn(el));
-          } else {
-            this.push(el);
-          }
-        }
-      }
+      this.pushMany(elements);
     }
     /**
      * The `head` function returns the first node of a singly linked list.
@@ -1647,6 +1670,53 @@ var dataStructureTyped = (() => {
       this._size++;
       return true;
     }
+    /**
+     * Time Complexity: O(k)
+     * Space Complexity: O(k)
+     *
+     * The function `pushMany` iterates over elements and pushes them into a data structure, applying a
+     * transformation function if provided.
+     * @param {Iterable<E> | Iterable<R> | Iterable<SinglyLinkedListNode<E>>} elements - The `elements`
+     * parameter in the `pushMany` function can accept an iterable containing elements of type `E`, `R`,
+     * or `SinglyLinkedListNode<E>`.
+     * @returns The `pushMany` function returns an array of boolean values indicating whether each
+     * element was successfully pushed into the data structure.
+     */
+    pushMany(elements) {
+      const ans = [];
+      for (const el of elements) {
+        if (this.toElementFn) {
+          ans.push(this.push(this.toElementFn(el)));
+          continue;
+        }
+        ans.push(this.push(el));
+      }
+      return ans;
+    }
+    /**
+     * Time Complexity: O(k)
+     * Space Complexity: O(k)
+     *
+     * The function `unshiftMany` iterates over elements and adds them to a data structure, optionally
+     * converting them using a provided function.
+     * @param {Iterable<E> | Iterable<R> | Iterable<SinglyLinkedListNode<E>>} elements - The `elements`
+     * parameter in the `unshiftMany` function can accept an iterable containing elements of type `E`,
+     * `R`, or `SinglyLinkedListNode<E>`. The function iterates over each element in the iterable and
+     * performs an `unshift` operation on the linked list for each
+     * @returns The `unshiftMany` function is returning an array of boolean values, where each value
+     * represents the result of calling the `unshift` method on the current instance of the class.
+     */
+    unshiftMany(elements) {
+      const ans = [];
+      for (const el of elements) {
+        if (this.toElementFn) {
+          ans.push(this.unshift(this.toElementFn(el)));
+          continue;
+        }
+        ans.push(this.unshift(el));
+      }
+      return ans;
+    }
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -1659,7 +1729,7 @@ var dataStructureTyped = (() => {
      * @returns The `get` method returns the value of the first node in the singly linked list that
      * satisfies the provided predicate function. If no such node is found, it returns `undefined`.
      */
-    get(elementNodeOrPredicate) {
+    search(elementNodeOrPredicate) {
       const predicate = this._ensurePredicate(elementNodeOrPredicate);
       let current = this.head;
       while (current) {
@@ -1818,6 +1888,9 @@ var dataStructureTyped = (() => {
       return true;
     }
     /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     *
      * The function checks if the length of a data structure is equal to zero and returns a boolean value indicating
      * whether it is empty or not.
      * @returns A boolean value indicating whether the length of the object is equal to 0.
@@ -1826,6 +1899,9 @@ var dataStructureTyped = (() => {
       return this._size === 0;
     }
     /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     *
      * The `clear` function resets the linked list by setting the head, tail, and length to undefined and 0 respectively.
      */
     clear() {
@@ -2216,6 +2292,16 @@ var dataStructureTyped = (() => {
     }
   };
   var DoublyLinkedList = class _DoublyLinkedList extends IterableElementBase {
+    /**
+     * This TypeScript constructor initializes a DoublyLinkedList with optional elements and options.
+     * @param {Iterable<E> | Iterable<R>} elements - The `elements` parameter in the constructor is an
+     * iterable collection of elements of type `E` or `R`. It is used to initialize the DoublyLinkedList
+     * with the elements provided in the iterable. If no elements are provided, the default value is an
+     * empty iterable.
+     * @param [options] - The `options` parameter in the constructor is of type
+     * `DoublyLinkedListOptions<E, R>`. It is an optional parameter that allows you to pass additional
+     * configuration options to customize the behavior of the DoublyLinkedList.
+     */
     constructor(elements = [], options) {
       super(options);
       __publicField(this, "_head");
@@ -2224,13 +2310,7 @@ var dataStructureTyped = (() => {
       this._head = void 0;
       this._tail = void 0;
       this._size = 0;
-      if (elements) {
-        for (const el of elements) {
-          if (this.toElementFn) {
-            this.push(this.toElementFn(el));
-          } else this.push(el);
-        }
-      }
+      this.pushMany(elements);
     }
     /**
      * The `head` function returns the first node of a doubly linked list.
@@ -2378,6 +2458,55 @@ var dataStructureTyped = (() => {
       this._size++;
       return true;
     }
+    /**
+     * Time Complexity: O(k)
+     * Space Complexity: O(k)
+     *
+     * The function `pushMany` iterates over elements and pushes them into a data structure, applying a
+     * transformation function if provided.
+     * @param {Iterable<E> | Iterable<R> | Iterable<DoublyLinkedListNode<E>>} elements - The `elements`
+     * parameter in the `pushMany` function can accept an iterable containing elements of type `E`, `R`,
+     * or `DoublyLinkedListNode<E>`. The function iterates over each element in the iterable and pushes
+     * it onto the linked list. If a transformation function `to
+     * @returns The `pushMany` function is returning an array of boolean values (`ans`) which indicate
+     * the success or failure of pushing each element into the data structure.
+     */
+    pushMany(elements) {
+      const ans = [];
+      for (const el of elements) {
+        if (this.toElementFn) {
+          ans.push(this.push(this.toElementFn(el)));
+          continue;
+        }
+        ans.push(this.push(el));
+      }
+      return ans;
+    }
+    /**
+     * Time Complexity: O(k)
+     * Space Complexity: O(k)
+     *
+     * The function `unshiftMany` iterates through a collection of elements and adds them to the
+     * beginning of a Doubly Linked List, returning an array of boolean values indicating the success of
+     * each insertion.
+     * @param {Iterable<E> | Iterable<R> | Iterable<DoublyLinkedListNode<E>>} elements - The `elements`
+     * parameter in the `unshiftMany` function can accept an iterable containing elements of type `E`,
+     * `R`, or `DoublyLinkedListNode<E>`. The function iterates over each element in the iterable and
+     * performs an `unshift` operation on the doubly linked list
+     * @returns The `unshiftMany` function returns an array of boolean values indicating the success of
+     * each unshift operation performed on the elements passed as input.
+     */
+    unshiftMany(elements) {
+      const ans = [];
+      for (const el of elements) {
+        if (this.toElementFn) {
+          ans.push(this.unshift(this.toElementFn(el)));
+          continue;
+        }
+        ans.push(this.unshift(el));
+      }
+      return ans;
+    }
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -2495,7 +2624,7 @@ var dataStructureTyped = (() => {
      * node was not found.
      */
     addBefore(existingElementOrNode, newElementOrNode) {
-      const existingNode = this.getNode(existingElementOrNode);
+      const existingNode = this.isNode(existingElementOrNode) ? existingElementOrNode : this.getNode(existingElementOrNode);
       if (existingNode) {
         const newNode = this._ensureNode(newElementOrNode);
         newNode.prev = existingNode.prev;
@@ -2529,7 +2658,7 @@ var dataStructureTyped = (() => {
      * was not found in the linked list.
      */
     addAfter(existingElementOrNode, newElementOrNode) {
-      const existingNode = this.getNode(existingElementOrNode);
+      const existingNode = this.isNode(existingElementOrNode) ? existingElementOrNode : this.getNode(existingElementOrNode);
       if (existingNode) {
         const newNode = this._ensureNode(newElementOrNode);
         newNode.next = existingNode.next;
@@ -2662,7 +2791,7 @@ var dataStructureTyped = (() => {
      * @returns The `get` method returns the value of the first node in the doubly linked list that
      * satisfies the provided predicate function. If no such node is found, it returns `undefined`.
      */
-    get(elementNodeOrPredicate) {
+    search(elementNodeOrPredicate) {
       const predicate = this._ensurePredicate(elementNodeOrPredicate);
       let current = this.head;
       while (current) {
@@ -2814,6 +2943,12 @@ var dataStructureTyped = (() => {
      * Time Complexity: O(n)
      * Space Complexity: O(1)
      *
+     * The function `countOccurrences` iterates through a doubly linked list and counts the occurrences
+     * of a specified element or nodes that satisfy a given predicate.
+     * @param {E | DoublyLinkedListNode<E> | ((node: DoublyLinkedListNode<E>) => boolean)} elementOrNode
+     * - The `elementOrNode` parameter in the `countOccurrences` method can accept three types of values:
+     * @returns The `countOccurrences` method returns the number of occurrences of the specified element,
+     * node, or predicate function in the doubly linked list.
      */
     countOccurrences(elementOrNode) {
       const predicate = this._ensurePredicate(elementOrNode);
@@ -3133,15 +3268,7 @@ var dataStructureTyped = (() => {
     constructor(elements = [], options) {
       super(options);
       __publicField(this, "_elements", []);
-      if (elements) {
-        for (const el of elements) {
-          if (this.toElementFn) {
-            this.push(this.toElementFn(el));
-          } else {
-            this.push(el);
-          }
-        }
-      }
+      this.pushMany(elements);
     }
     /**
      * The elements function returns the elements of this set.
@@ -3157,10 +3284,6 @@ var dataStructureTyped = (() => {
     get size() {
       return this.elements.length;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -3174,6 +3297,9 @@ var dataStructureTyped = (() => {
       return new _Stack(elements);
     }
     /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     *
      * The function checks if an array is empty and returns a boolean value.
      * @returns A boolean value indicating whether the `_elements` array is empty or not.
      */
@@ -3216,18 +3342,46 @@ var dataStructureTyped = (() => {
       return this.elements.pop();
     }
     /**
-     * The delete function removes an element from the stack.
-     * @param element: E Specify the element to be deleted
-     * @return A boolean value indicating whether the element was successfully deleted or not
+     * Time Complexity: O(k)
+     * Space Complexity: O(1)
+     *
+     * The function `pushMany` iterates over elements and pushes them into an array after applying a
+     * transformation function if provided.
+     * @param {Iterable<E> | Iterable<R>} elements - The `elements` parameter in the `pushMany` function
+     * is an iterable containing elements of type `E` or `R`. The function iterates over each element in
+     * the iterable and pushes it into the data structure. If a transformation function `toElementFn` is
+     * provided, it is used to
+     * @returns The `pushMany` function is returning an array of boolean values indicating whether each
+     * element was successfully pushed into the data structure.
+     */
+    pushMany(elements) {
+      const ans = [];
+      for (const el of elements) {
+        if (this.toElementFn) {
+          ans.push(this.push(this.toElementFn(el)));
+        } else {
+          ans.push(this.push(el));
+        }
+      }
+      return ans;
+    }
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(1)
+     *
+     * The toArray function returns a copy of the elements in an array.
+     * @returns An array of type E.
      */
     delete(element) {
       const index = this.elements.indexOf(element);
       return this.deleteAt(index);
     }
     /**
-     * The deleteAt function deletes the element at a given index.
-     * @param index: number Determine the index of the element to be deleted
-     * @return A boolean value
+     * Time Complexity: O(n)
+     * Space Complexity: O(1)
+     *
+     * The toArray function returns a copy of the elements in an array.
+     * @returns An array of type E.
      */
     deleteAt(index) {
       const spliced = this.elements.splice(index, 1);
@@ -3340,12 +3494,7 @@ var dataStructureTyped = (() => {
         const { autoCompactRatio = 0.5 } = options;
         this._autoCompactRatio = autoCompactRatio;
       }
-      if (elements) {
-        for (const el of elements) {
-          if (this.toElementFn) this.push(this.toElementFn(el));
-          else this.push(el);
-        }
-      }
+      this.pushMany(elements);
     }
     /**
      * The elements function returns the elements of this set.
@@ -3430,6 +3579,25 @@ var dataStructureTyped = (() => {
       this.elements.push(element);
       return true;
     }
+    /**
+     * Time Complexity: O(k)
+     * Space Complexity: O(k)
+     *
+     * The `pushMany` function iterates over elements and pushes them into an array after applying a
+     * transformation function if provided.
+     * @param {Iterable<E> | Iterable<R>} elements - The `elements` parameter in the `pushMany` function
+     * is an iterable containing elements of type `E` or `R`.
+     * @returns The `pushMany` function is returning an array of boolean values indicating whether each
+     * element was successfully pushed into the data structure.
+     */
+    pushMany(elements) {
+      const ans = [];
+      for (const el of elements) {
+        if (this.toElementFn) ans.push(this.push(this.toElementFn(el)));
+        else ans.push(this.push(el));
+      }
+      return ans;
+    }
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -3446,6 +3614,9 @@ var dataStructureTyped = (() => {
       return first;
     }
     /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(1)
+     *
      * The delete function removes an element from the list.
      * @param {E} element - Specify the element to be deleted
      * @return A boolean value indicating whether the element was successfully deleted or not
@@ -3455,6 +3626,9 @@ var dataStructureTyped = (() => {
       return this.deleteAt(index);
     }
     /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(1)
+     *
      * The deleteAt function deletes the element at a given index.
      * @param {number} index - Determine the index of the element to be deleted
      * @return A boolean value
@@ -3467,7 +3641,12 @@ var dataStructureTyped = (() => {
      * Time Complexity: O(1)
      * Space Complexity: O(1)
      *
-     * @param index
+     * The `at` function returns the element at a specified index adjusted by an offset, or `undefined`
+     * if the index is out of bounds.
+     * @param {number} index - The `index` parameter represents the position of the element you want to
+     * retrieve from the data structure.
+     * @returns The `at` method is returning the element at the specified index adjusted by the offset
+     * `_offset`.
      */
     at(index) {
       return this.elements[index + this._offset];
@@ -3503,6 +3682,9 @@ var dataStructureTyped = (() => {
       this._offset = 0;
     }
     /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(1)
+     *
      * The `compact` function in TypeScript slices the elements array based on the offset and resets the
      * offset to zero.
      * @returns The `compact()` method is returning a boolean value of `true`.
@@ -3552,6 +3734,20 @@ var dataStructureTyped = (() => {
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
+     *
+     * The `map` function in TypeScript creates a new Queue by applying a callback function to each
+     * element in the original Queue.
+     * @param callback - The `callback` parameter is a function that will be applied to each element in
+     * the queue. It takes the current element, its index, and the queue itself as arguments, and returns
+     * a new element.
+     * @param [toElementFn] - The `toElementFn` parameter is an optional function that can be provided to
+     * convert a raw element of type `RM` to a new element of type `EM`. This function is used within the
+     * `map` method to transform each raw element before passing it to the `callback` function. If
+     * @param {any} [thisArg] - The `thisArg` parameter in the `map` function is used to specify the
+     * value of `this` when executing the `callback` function. It allows you to set the context (the
+     * value of `this`) within the callback function. If `thisArg` is provided, it will be
+     * @returns A new Queue object containing elements of type EM, which are the result of applying the
+     * callback function to each element in the original Queue object.
      */
     map(callback, toElementFn, thisArg) {
       const newDeque = new _Queue([], { toElementFn });
@@ -3632,13 +3828,7 @@ var dataStructureTyped = (() => {
       const needBucketNum = calcMinUnitsRequired(_size, this._bucketSize);
       this._bucketFirst = this._bucketLast = (this._bucketCount >> 1) - (needBucketNum >> 1);
       this._firstInBucket = this._lastInBucket = this._bucketSize - _size % this._bucketSize >> 1;
-      for (const el of elements) {
-        if (this.toElementFn) {
-          this.push(this.toElementFn(el));
-        } else {
-          this.push(el);
-        }
-      }
+      this.pushMany(elements);
     }
     /**
      * The bucketSize function returns the size of the bucket.
@@ -3776,6 +3966,32 @@ var dataStructureTyped = (() => {
       this._size -= 1;
       return element;
     }
+    /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     *
+     * The `shift()` function removes and returns the first element from a data structure, updating the
+     * internal state variables accordingly.
+     * @returns The element that is being removed from the beginning of the data structure is being
+     * returned.
+     */
+    shift() {
+      if (this._size === 0) return;
+      const element = this._buckets[this._bucketFirst][this._firstInBucket];
+      if (this._size !== 1) {
+        if (this._firstInBucket < this._bucketSize - 1) {
+          this._firstInBucket += 1;
+        } else if (this._bucketFirst < this._bucketCount - 1) {
+          this._bucketFirst += 1;
+          this._firstInBucket = 0;
+        } else {
+          this._bucketFirst = 0;
+          this._firstInBucket = 0;
+        }
+      }
+      this._size -= 1;
+      return element;
+    }
     /**
      * Time Complexity: Amortized O(1)
      * Space Complexity: O(n)
@@ -3805,30 +4021,53 @@ var dataStructureTyped = (() => {
       return true;
     }
     /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
+     * Time Complexity: O(k)
+     * Space Complexity: O(k)
      *
-     * The `shift()` function removes and returns the first element from a data structure, updating the
-     * internal state variables accordingly.
-     * @returns The element that is being removed from the beginning of the data structure is being
-     * returned.
+     * The function `pushMany` iterates over elements and pushes them into an array after applying a
+     * transformation function if provided.
+     * @param {IterableWithSizeOrLength<E> | IterableWithSizeOrLength<R>} elements - The `elements`
+     * parameter in the `pushMany` function is expected to be an iterable containing elements of type `E`
+     * or `R`. It can be either an `IterableWithSizeOrLength<E>` or an `IterableWithSizeOrLength<R>`. The
+     * function iterates over each element
+     * @returns The `pushMany` function is returning an array of boolean values, where each value
+     * represents the result of calling the `push` method on the current object instance with the
+     * corresponding element from the input `elements` iterable.
      */
-    shift() {
-      if (this._size === 0) return;
-      const element = this._buckets[this._bucketFirst][this._firstInBucket];
-      if (this._size !== 1) {
-        if (this._firstInBucket < this._bucketSize - 1) {
-          this._firstInBucket += 1;
-        } else if (this._bucketFirst < this._bucketCount - 1) {
-          this._bucketFirst += 1;
-          this._firstInBucket = 0;
+    pushMany(elements) {
+      const ans = [];
+      for (const el of elements) {
+        if (this.toElementFn) {
+          ans.push(this.push(this.toElementFn(el)));
         } else {
-          this._bucketFirst = 0;
-          this._firstInBucket = 0;
+          ans.push(this.push(el));
         }
       }
-      this._size -= 1;
-      return element;
+      return ans;
+    }
+    /**
+     * Time Complexity: O(k)
+     * Space Complexity: O(k)
+     *
+     * The `unshiftMany` function in TypeScript iterates over elements and adds them to the beginning of
+     * an array, optionally converting them using a provided function.
+     * @param {IterableWithSizeOrLength<E> | IterableWithSizeOrLength<R>} elements - The `elements`
+     * parameter in the `unshiftMany` function is an iterable containing elements of type `E` or `R`. It
+     * can be an array or any other iterable data structure that has a known size or length. The function
+     * iterates over each element in the `elements` iterable and
+     * @returns The `unshiftMany` function returns an array of boolean values indicating whether each
+     * element was successfully added to the beginning of the array.
+     */
+    unshiftMany(elements = []) {
+      const ans = [];
+      for (const el of elements) {
+        if (this.toElementFn) {
+          ans.push(this.unshift(this.toElementFn(el)));
+        } else {
+          ans.push(this.unshift(el));
+        }
+      }
+      return ans;
     }
     /**
      * Time Complexity: O(1)
@@ -4345,12 +4584,7 @@ var dataStructureTyped = (() => {
         const { comparator } = options;
         if (comparator) this._comparator = comparator;
       }
-      if (elements) {
-        for (const el of elements) {
-          if (this.toElementFn) this.add(this.toElementFn(el));
-          else this.add(el);
-        }
-      }
+      this.addMany(elements);
     }
     /**
      * The function returns an array of elements.
@@ -4386,13 +4620,40 @@ var dataStructureTyped = (() => {
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
      *
-     * Insert an element into the heap and maintain the heap properties.
-     * @param element - The element to be inserted.
+     * The add function pushes an element into an array and then triggers a bubble-up operation.
+     * @param {E} element - The `element` parameter represents the element that you want to add to the
+     * data structure.
+     * @returns The `add` method is returning a boolean value, which is the result of calling the
+     * `_bubbleUp` method with the index `this.elements.length - 1` as an argument.
      */
     add(element) {
       this._elements.push(element);
       return this._bubbleUp(this.elements.length - 1);
     }
+    /**
+     * Time Complexity: O(k log n)
+     * Space Complexity: O(1)
+     *
+     * The `addMany` function iterates over elements and adds them to a collection, returning an array of
+     * boolean values indicating success or failure.
+     * @param {Iterable<E> | Iterable<R>} elements - The `elements` parameter in the `addMany` method is
+     * an iterable containing elements of type `E` or `R`. The method iterates over each element in the
+     * iterable and adds them to the data structure. If a transformation function `_toElementFn` is
+     * provided, it transforms the element
+     * @returns The `addMany` method returns an array of boolean values indicating whether each element
+     * in the input iterable was successfully added to the data structure.
+     */
+    addMany(elements) {
+      const ans = [];
+      for (const el of elements) {
+        if (this._toElementFn) {
+          ans.push(this.add(this._toElementFn(el)));
+          continue;
+        }
+        ans.push(this.add(el));
+      }
+      return ans;
+    }
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -4586,7 +4847,7 @@ var dataStructureTyped = (() => {
       return filteredList;
     }
     /**
-     * Time Complexity: O(n log n)
+     * Time Complexity: O(n)
      * Space Complexity: O(n)
      *
      * The `map` function creates a new heap by applying a callback function to each element of the
@@ -7097,12 +7358,28 @@ var dataStructureTyped = (() => {
     }
   };
 
-  // src/constants/index.ts
+  // src/common/index.ts
   var DFSOperation = /* @__PURE__ */ ((DFSOperation2) => {
     DFSOperation2[DFSOperation2["VISIT"] = 0] = "VISIT";
     DFSOperation2[DFSOperation2["PROCESS"] = 1] = "PROCESS";
     return DFSOperation2;
   })(DFSOperation || {});
+  var Range = class {
+    constructor(low, high, includeLow = true, includeHigh = true) {
+      this.low = low;
+      this.high = high;
+      this.includeLow = includeLow;
+      this.includeHigh = includeHigh;
+      if (!(isComparable(low) && isComparable(high))) throw new RangeError("low or high is not comparable");
+      if (low > high) throw new RangeError("low must be less than or equal to high");
+    }
+    // Determine whether a key is within the range
+    isInRange(key, comparator) {
+      const lowCheck = this.includeLow ? comparator(key, this.low) >= 0 : comparator(key, this.low) > 0;
+      const highCheck = this.includeHigh ? comparator(key, this.high) <= 0 : comparator(key, this.high) < 0;
+      return lowCheck && highCheck;
+    }
+  };
 
   // src/data-structures/binary-tree/binary-tree.ts
   var BinaryTreeNode = class {
@@ -7235,7 +7512,7 @@ var dataStructureTyped = (() => {
      * input parameter (`keyNodeEntryOrRaw`) and processes it accordingly to return a node or null
      * value.
      */
-    keyValueNodeEntryRawToNodeAndValue(keyNodeEntryOrRaw, value) {
+    _keyValueNodeEntryRawToNodeAndValue(keyNodeEntryOrRaw, value) {
       if (keyNodeEntryOrRaw === void 0) return [void 0, void 0];
       if (keyNodeEntryOrRaw === null) return [null, void 0];
       if (this.isNode(keyNodeEntryOrRaw)) return [keyNodeEntryOrRaw, value];
@@ -7246,15 +7523,12 @@ var dataStructureTyped = (() => {
         const finalValue = value != null ? value : entryValue;
         return [this.createNode(key, finalValue), finalValue];
       }
-      if (this.isKey(keyNodeEntryOrRaw)) return [this.createNode(keyNodeEntryOrRaw, value), value];
       if (this.isRaw(keyNodeEntryOrRaw)) {
-        if (this._toEntryFn) {
-          const [key, entryValue] = this._toEntryFn(keyNodeEntryOrRaw);
-          const finalValue = value != null ? value : entryValue;
-          if (this.isKey(key)) return [this.createNode(key, finalValue), finalValue];
-        }
-        return [void 0, void 0];
+        const [key, entryValue] = this._toEntryFn(keyNodeEntryOrRaw);
+        const finalValue = value != null ? value : entryValue;
+        if (this.isKey(key)) return [this.createNode(key, finalValue), finalValue];
       }
+      if (this.isKey(keyNodeEntryOrRaw)) return [this.createNode(keyNodeEntryOrRaw, value), value];
       return [void 0, void 0];
     }
     /**
@@ -7281,13 +7555,13 @@ var dataStructureTyped = (() => {
         const key = keyNodeEntryOrRaw[0];
         if (key === null) return null;
         if (key === void 0) return;
-        return this.getNodeByKey(key, iterationType);
+        return this.getNode(key, this._root, iterationType);
       }
       if (this._toEntryFn) {
         const [key] = this._toEntryFn(keyNodeEntryOrRaw);
-        if (this.isKey(key)) return this.getNodeByKey(key);
+        if (this.isKey(key)) return this.getNode(key);
       }
-      if (this.isKey(keyNodeEntryOrRaw)) return this.getNodeByKey(keyNodeEntryOrRaw, iterationType);
+      if (this.isKey(keyNodeEntryOrRaw)) return this.getNode(keyNodeEntryOrRaw, this._root, iterationType);
       return;
     }
     /**
@@ -7304,8 +7578,15 @@ var dataStructureTyped = (() => {
     isNode(keyNodeEntryOrRaw) {
       return keyNodeEntryOrRaw instanceof BinaryTreeNode;
     }
+    /**
+     * The function `isRaw` checks if the input parameter is of type `R` by verifying if it is an object.
+     * @param {BTNRep<K, V, NODE> | R} keyNodeEntryOrRaw - BTNRep<K, V, NODE> | R
+     * @returns The function `isRaw` is checking if the `keyNodeEntryOrRaw` parameter is of type `R` by
+     * checking if it is an object. If the parameter is an object, the function will return `true`,
+     * indicating that it is of type `R`.
+     */
     isRaw(keyNodeEntryOrRaw) {
-      return typeof keyNodeEntryOrRaw === "object";
+      return this._toEntryFn !== void 0 && typeof keyNodeEntryOrRaw === "object";
     }
     /**
      * The function `isRealNode` checks if a given input is a valid node in a binary tree.
@@ -7343,6 +7624,9 @@ var dataStructureTyped = (() => {
     isNIL(keyNodeEntryOrRaw) {
       return keyNodeEntryOrRaw === this._NIL;
     }
+    isRange(keyNodeEntryRawOrPredicate) {
+      return keyNodeEntryRawOrPredicate instanceof Range;
+    }
     /**
      * The function determines whether a given key, node, entry, or raw data is a leaf node in a binary
      * tree.
@@ -7405,7 +7689,7 @@ var dataStructureTyped = (() => {
      * key was found and the node was replaced instead of inserted.
      */
     add(keyNodeEntryOrRaw, value) {
-      const [newNode, newValue] = this.keyValueNodeEntryRawToNodeAndValue(keyNodeEntryOrRaw, value);
+      const [newNode, newValue] = this._keyValueNodeEntryRawToNodeAndValue(keyNodeEntryOrRaw, value);
       if (newNode === void 0) return false;
       if (!this._root) {
         this._setRoot(newNode);
@@ -7481,6 +7765,17 @@ var dataStructureTyped = (() => {
       }
       return inserted;
     }
+    /**
+     * Time Complexity: O(k * n)
+     * Space Complexity: O(1)
+     *
+     * The `merge` function in TypeScript merges another binary tree into the current tree by adding all
+     * elements from the other tree.
+     * @param anotherTree - `BinaryTree<K, V, R, NODE, TREE>`
+     */
+    merge(anotherTree) {
+      this.addMany(anotherTree, []);
+    }
     /**
      * Time Complexity: O(k * n)
      * Space Complexity: O(1)
@@ -7555,34 +7850,37 @@ var dataStructureTyped = (() => {
      * Time Complexity: O(n)
      * Space Complexity: O(k + log n)
      *
-     * The function `getNodes` retrieves nodes from a binary tree based on a key, node, entry, raw data,
-     * or predicate, with options for recursive or iterative traversal.
-     * @param {BTNRep<K, V, NODE> | R | NodePredicate<NODE>} keyNodeEntryRawOrPredicate
-     * - The `getNodes` function you provided takes several parameters:
-     * @param [onlyOne=false] - The `onlyOne` parameter in the `getNodes` function is a boolean flag that
-     * determines whether to return only the first node that matches the criteria specified by the
-     * `keyNodeEntryRawOrPredicate` parameter. If `onlyOne` is set to `true`, the function will
-     * @param {BTNRep<K, V, NODE> | R} startNode - The `startNode` parameter in the
-     * `getNodes` function is used to specify the starting point for traversing the binary tree. It
-     * represents the root node of the binary tree or the node from which the traversal should begin. If
-     * not provided, the default value is set to `this._root
-     * @param {IterationType} iterationType - The `iterationType` parameter in the `getNodes` function
-     * determines the type of iteration to be performed when traversing the nodes of a binary tree. It
-     * can have two possible values:
-     * @returns The `getNodes` function returns an array of nodes that satisfy the provided condition
-     * based on the input parameters and the iteration type specified.
-     */
-    getNodes(keyNodeEntryRawOrPredicate, onlyOne = false, startNode = this._root, iterationType = this.iterationType) {
+     * The `search` function in TypeScript performs a depth-first or breadth-first search on a tree
+     * structure based on a given predicate or key, with options to return multiple results or just one.
+     * @param {BTNRep<K, V, NODE> | R | NodePredicate<NODE>} keyNodeEntryRawOrPredicate - The
+     * `keyNodeEntryRawOrPredicate` parameter in the `search` function can accept three types of values:
+     * @param [onlyOne=false] - The `onlyOne` parameter in the `search` function is a boolean flag that
+     * determines whether the search should stop after finding the first matching node. If `onlyOne` is
+     * set to `true`, the search will return as soon as a matching node is found. If `onlyOne` is
+     * @param {C} callback - The `callback` parameter in the `search` function is a callback function
+     * that will be called on each node that matches the search criteria. It is of type `C`, which
+     * extends `NodeCallback<NODE>`. The default value for `callback` is `this._DEFAULT_NODE_CALLBACK` if
+     * @param {BTNRep<K, V, NODE> | R} startNode - The `startNode` parameter in the `search` function is
+     * used to specify the node from which the search operation should begin. It represents the starting
+     * point in the binary tree where the search will be performed. If no specific `startNode` is
+     * provided, the search operation will start from the root
+     * @param {IterationType} iterationType - The `iterationType` parameter in the `search` function
+     * specifies the type of iteration to be used when searching for nodes in a binary tree. It can have
+     * two possible values:
+     * @returns The `search` function returns an array of values that match the provided criteria based
+     * on the search algorithm implemented within the function.
+     */
+    search(keyNodeEntryRawOrPredicate, onlyOne = false, callback = this._DEFAULT_NODE_CALLBACK, startNode = this._root, iterationType = this.iterationType) {
       if (keyNodeEntryRawOrPredicate === void 0) return [];
       if (keyNodeEntryRawOrPredicate === null) return [];
       startNode = this.ensureNode(startNode);
       if (!startNode) return [];
-      const callback = this._ensurePredicate(keyNodeEntryRawOrPredicate);
+      const predicate = this._ensurePredicate(keyNodeEntryRawOrPredicate);
       const ans = [];
       if (iterationType === "RECURSIVE") {
         const dfs = (cur) => {
-          if (callback(cur)) {
-            ans.push(cur);
+          if (predicate(cur)) {
+            ans.push(callback(cur));
             if (onlyOne) return;
           }
           if (!this.isRealNode(cur.left) && !this.isRealNode(cur.right)) return;
@@ -7595,8 +7893,8 @@ var dataStructureTyped = (() => {
         while (stack.length > 0) {
           const cur = stack.pop();
           if (this.isRealNode(cur)) {
-            if (callback(cur)) {
-              ans.push(cur);
+            if (predicate(cur)) {
+              ans.push(callback(cur));
               if (onlyOne) return ans;
             }
             if (this.isRealNode(cur.left)) stack.push(cur.left);
@@ -7606,6 +7904,30 @@ var dataStructureTyped = (() => {
       }
       return ans;
     }
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(k + log n)
+     *
+     * The function `getNodes` retrieves nodes from a binary tree based on a key, node, entry, raw data,
+     * or predicate, with options for recursive or iterative traversal.
+     * @param {BTNRep<K, V, NODE> | R | NodePredicate<NODE>} keyNodeEntryRawOrPredicate
+     * - The `getNodes` function you provided takes several parameters:
+     * @param [onlyOne=false] - The `onlyOne` parameter in the `getNodes` function is a boolean flag that
+     * determines whether to return only the first node that matches the criteria specified by the
+     * `keyNodeEntryRawOrPredicate` parameter. If `onlyOne` is set to `true`, the function will
+     * @param {BTNRep<K, V, NODE> | R} startNode - The `startNode` parameter in the
+     * `getNodes` function is used to specify the starting point for traversing the binary tree. It
+     * represents the root node of the binary tree or the node from which the traversal should begin. If
+     * not provided, the default value is set to `this._root
+     * @param {IterationType} iterationType - The `iterationType` parameter in the `getNodes` function
+     * determines the type of iteration to be performed when traversing the nodes of a binary tree. It
+     * can have two possible values:
+     * @returns The `getNodes` function returns an array of nodes that satisfy the provided condition
+     * based on the input parameters and the iteration type specified.
+     */
+    getNodes(keyNodeEntryRawOrPredicate, onlyOne = false, startNode = this._root, iterationType = this.iterationType) {
+      return this.search(keyNodeEntryRawOrPredicate, onlyOne, (node) => node, startNode, iterationType);
+    }
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(log n).
@@ -7628,23 +7950,7 @@ var dataStructureTyped = (() => {
      */
     getNode(keyNodeEntryRawOrPredicate, startNode = this._root, iterationType = this.iterationType) {
       var _a;
-      return (_a = this.getNodes(keyNodeEntryRawOrPredicate, true, startNode, iterationType)[0]) != null ? _a : null;
-    }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(log n)
-     *
-     * The function `getNodeByKey` retrieves a node by its key from a binary tree structure.
-     * @param {K} key - The `key` parameter is the value used to search for a specific node in a data
-     * structure.
-     * @param {IterationType} iterationType - The `iterationType` parameter is a type of iteration that
-     * specifies how the tree nodes should be traversed when searching for a node with the given key. It
-     * is an optional parameter with a default value of `this.iterationType`.
-     * @returns The `getNodeByKey` function is returning an optional binary tree node
-     * (`OptNodeOrNull<NODE>`).
-     */
-    getNodeByKey(key, iterationType = this.iterationType) {
-      return this.getNode(key, this._root, iterationType);
+      return (_a = this.search(keyNodeEntryRawOrPredicate, true, (node) => node, startNode, iterationType)[0]) != null ? _a : null;
     }
     /**
      * Time Complexity: O(n)
@@ -7671,7 +7977,7 @@ var dataStructureTyped = (() => {
     get(keyNodeEntryRawOrPredicate, startNode = this._root, iterationType = this.iterationType) {
       var _a;
       if (this._isMapMode) {
-        const key = this._getKey(keyNodeEntryRawOrPredicate);
+        const key = this._extractKey(keyNodeEntryRawOrPredicate);
         if (key === null || key === void 0) return;
         return this._store.get(key);
       }
@@ -7699,7 +8005,7 @@ var dataStructureTyped = (() => {
      * Otherwise, it returns `false`.
      */
     has(keyNodeEntryRawOrPredicate, startNode = this._root, iterationType = this.iterationType) {
-      return this.getNodes(keyNodeEntryRawOrPredicate, true, startNode, iterationType).length > 0;
+      return this.search(keyNodeEntryRawOrPredicate, true, (node) => node, startNode, iterationType).length > 0;
     }
     /**
      * Time Complexity: O(1)
@@ -7938,7 +8244,7 @@ var dataStructureTyped = (() => {
      * array is either in reverse order or in the original order based on the value of the `isReverse`
      * parameter.
      */
-    getPathToRoot(callback = this._DEFAULT_NODE_CALLBACK, beginNode, isReverse = true) {
+    getPathToRoot(beginNode, callback = this._DEFAULT_NODE_CALLBACK, isReverse = false) {
       const result = [];
       let beginNodeEnsured = this.ensureNode(beginNode);
       if (!beginNodeEnsured) return result;
@@ -8863,16 +9169,16 @@ var dataStructureTyped = (() => {
      * Time Complexity: O(1)
      * Space Complexity: O(1)
      *
-     * The function `_getKey` in TypeScript returns the key from a given input, which can be a node,
+     * The function `_extractKey` in TypeScript returns the key from a given input, which can be a node,
      * entry, raw data, or null/undefined.
-     * @param {BTNRep<K, V, NODE> | R} keyNodeEntryOrRaw - The `_getKey` method you provided is a
+     * @param {BTNRep<K, V, NODE> | R} keyNodeEntryOrRaw - The `_extractKey` method you provided is a
      * TypeScript method that takes in a parameter `keyNodeEntryOrRaw` of type `BTNRep<K, V, NODE> | R`,
      * where `BTNRep` is a generic type with keys `K`, `V`, and `NODE`, and `
-     * @returns The `_getKey` method returns the key value extracted from the `keyNodeEntryOrRaw`
+     * @returns The `_extractKey` method returns the key value extracted from the `keyNodeEntryOrRaw`
      * parameter. The return value can be a key value of type `K`, `null`, or `undefined`, depending on
      * the conditions checked in the method.
      */
-    _getKey(keyNodeEntryOrRaw) {
+    _extractKey(keyNodeEntryOrRaw) {
       if (keyNodeEntryOrRaw === null) return null;
       if (keyNodeEntryOrRaw === void 0) return;
       if (keyNodeEntryOrRaw === this._NIL) return;
@@ -8907,6 +9213,9 @@ var dataStructureTyped = (() => {
       return this._store.set(key, value);
     }
     /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     *
      * The _clearNodes function sets the root node to undefined and resets the size to 0.
      */
     _clearNodes() {
@@ -8914,6 +9223,9 @@ var dataStructureTyped = (() => {
       this._size = 0;
     }
     /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     *
      * The _clearValues function clears all values stored in the _store object.
      */
     _clearValues() {
@@ -8982,20 +9294,30 @@ var dataStructureTyped = (() => {
     constructor(keysNodesEntriesOrRaws = [], options) {
       super([], options);
       __publicField(this, "_root");
-      __publicField(this, "_DEFAULT_COMPARATOR", (a, b) => {
+      __publicField(this, "_isReverse", false);
+      __publicField(this, "_comparator", (a, b) => {
+        if (isComparable(a) && isComparable(b)) {
+          if (a > b) return 1;
+          if (a < b) return -1;
+          return 0;
+        }
+        if (this._extractComparable) {
+          if (this._extractComparable(a) > this._extractComparable(b)) return 1;
+          if (this._extractComparable(a) < this._extractComparable(b)) return -1;
+          return 0;
+        }
         if (typeof a === "object" || typeof b === "object") {
           throw TypeError(
-            `When comparing object types, a custom comparator must be defined in the constructor's options parameter.`
+            `When comparing object types, a custom extractComparable must be defined in the constructor's options parameter.`
           );
         }
-        if (a > b) return 1;
-        if (a < b) return -1;
         return 0;
       });
-      __publicField(this, "_comparator", this._DEFAULT_COMPARATOR);
+      __publicField(this, "_extractComparable");
       if (options) {
-        const { comparator } = options;
-        if (comparator) this._comparator = comparator;
+        const { extractComparable, isReverse } = options;
+        if (typeof extractComparable === "function") this._extractComparable = extractComparable;
+        if (isReverse !== void 0) this._isReverse = isReverse;
       }
       if (keysNodesEntriesOrRaws) this.addMany(keysNodesEntriesOrRaws);
     }
@@ -9006,6 +9328,14 @@ var dataStructureTyped = (() => {
     get root() {
       return this._root;
     }
+    /**
+     * The above function is a getter method in TypeScript that returns the value of the private property
+     * `_isReverse`.
+     * @returns The `isReverse` property of the object, which is a boolean value.
+     */
+    get isReverse() {
+      return this._isReverse;
+    }
     /**
      * The function creates a new BSTNode with the given key and value and returns it.
      * @param {K} key - The key parameter is of type K, which represents the type of the key for the node
@@ -9028,8 +9358,9 @@ var dataStructureTyped = (() => {
       return new _BST([], __spreadValues({
         iterationType: this.iterationType,
         isMapMode: this._isMapMode,
-        comparator: this._comparator,
-        toEntryFn: this._toEntryFn
+        extractComparable: this._extractComparable,
+        toEntryFn: this._toEntryFn,
+        isReverse: this._isReverse
       }, options));
     }
     /**
@@ -9041,8 +9372,8 @@ var dataStructureTyped = (() => {
      * value associated with a key in a key-value pair.
      * @returns either a NODE object or undefined.
      */
-    keyValueNodeEntryRawToNodeAndValue(keyNodeEntryOrRaw, value) {
-      const [node, entryValue] = super.keyValueNodeEntryRawToNodeAndValue(keyNodeEntryOrRaw, value);
+    _keyValueNodeEntryRawToNodeAndValue(keyNodeEntryOrRaw, value) {
+      const [node, entryValue] = super._keyValueNodeEntryRawToNodeAndValue(keyNodeEntryOrRaw, value);
       if (node === null) return [void 0, void 0];
       return [node, value != null ? value : entryValue];
     }
@@ -9080,11 +9411,11 @@ var dataStructureTyped = (() => {
      * @param {any} key - The `key` parameter is a value that will be checked to determine if it is of
      * type `K`.
      * @returns The `override isKey(key: any): key is K` function is returning a boolean value based on
-     * the result of the `isComparable` function with the condition `this.comparator !==
+     * the result of the `isComparable` function with the condition `this._compare !==
      * this._DEFAULT_COMPARATOR`.
      */
     isKey(key) {
-      return isComparable(key, this.comparator !== this._DEFAULT_COMPARATOR);
+      return isComparable(key, this._extractComparable !== void 0);
     }
     /**
      * Time Complexity: O(log n)
@@ -9098,7 +9429,7 @@ var dataStructureTyped = (() => {
      * @returns a boolean value.
      */
     add(keyNodeEntryOrRaw, value) {
-      const [newNode, newValue] = this.keyValueNodeEntryRawToNodeAndValue(keyNodeEntryOrRaw, value);
+      const [newNode, newValue] = this._keyValueNodeEntryRawToNodeAndValue(keyNodeEntryOrRaw, value);
       if (newNode === void 0) return false;
       if (this._root === void 0) {
         this._setRoot(newNode);
@@ -9108,11 +9439,11 @@ var dataStructureTyped = (() => {
       }
       let current = this._root;
       while (current !== void 0) {
-        if (this.comparator(current.key, newNode.key) === 0) {
+        if (this._compare(current.key, newNode.key) === 0) {
           this._replaceNode(current, newNode);
           if (this._isMapMode) this._setValue(current.key, newValue);
           return true;
-        } else if (this.comparator(current.key, newNode.key) > 0) {
+        } else if (this._compare(current.key, newNode.key) > 0) {
           if (current.left === void 0) {
             current.left = newNode;
             if (this._isMapMode) this._setValue(newNode == null ? void 0 : newNode.key, newValue);
@@ -9190,7 +9521,7 @@ var dataStructureTyped = (() => {
           keyB = b;
         }
         if (keyA !== void 0 && keyA !== null && keyB !== void 0 && keyB !== null) {
-          return this.comparator(keyA, keyB);
+          return this._compare(keyA, keyB);
         }
         return 0;
       });
@@ -9226,48 +9557,92 @@ var dataStructureTyped = (() => {
       }
       return inserted;
     }
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(1)
+     *
+     * The `merge` function overrides the base class method by adding elements from another
+     * binary search tree.
+     * @param anotherTree - `anotherTree` is an instance of a Binary Search Tree (BST) with key type `K`,
+     * value type `V`, return type `R`, node type `NODE`, and tree type `TREE`.
+     */
+    merge(anotherTree) {
+      this.addMany(anotherTree, [], false);
+    }
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(k + log n)
      *
-     * The function `getNodes` in TypeScript overrides the base class method to retrieve nodes based on a
-     * given keyNodeEntryRawOrPredicate and iteration type.
-     * @param {BTNRep<K, V, NODE> | R | NodePredicate<NODE>} keyNodeEntryRawOrPredicate - The `keyNodeEntryRawOrPredicate`
-     * parameter in the `getNodes` method is used to filter the nodes that will be returned. It can be a
-     * key, a node, an entry, or a custom keyNodeEntryRawOrPredicate function that determines whether a node should be
-     * included in the result.
-     * @param [onlyOne=false] - The `onlyOne` parameter in the `getNodes` method is a boolean flag that
-     * determines whether to return only the first node that matches the keyNodeEntryRawOrPredicate (`true`) or all nodes
-     * that match the keyNodeEntryRawOrPredicate (`false`). If `onlyOne` is set to `true`, the method will stop iterating
-     * and
-     * @param {BTNRep<K, V, NODE> | R} startNode - The `startNode` parameter in the
-     * `getNodes` method is used to specify the starting point for traversing the tree when searching for
-     * nodes that match a given keyNodeEntryRawOrPredicate. It represents the root node of the subtree where the search
-     * should begin. If not explicitly provided, the default value for `begin
-     * @param {IterationType} iterationType - The `iterationType` parameter in the `getNodes` method
-     * specifies the type of iteration to be performed when traversing the nodes of a binary tree. It can
-     * have two possible values:
-     * @returns The `getNodes` method returns an array of nodes that satisfy the given keyNodeEntryRawOrPredicate.
+     * The function `search` in TypeScript overrides the search behavior in a binary tree structure based
+     * on specified criteria.
+     * @param {BTNRep<K, V, NODE> | R | NodePredicate<NODE>} keyNodeEntryRawOrPredicate - The
+     * `keyNodeEntryRawOrPredicate` parameter in the `override search` method can accept one of the
+     * following types:
+     * @param [onlyOne=false] - The `onlyOne` parameter is a boolean flag that determines whether the
+     * search should stop after finding the first matching node. If `onlyOne` is set to `true`, the
+     * search will return as soon as a matching node is found. If `onlyOne` is set to `false`, the
+     * @param {C} callback - The `callback` parameter in the `override search` function is a function
+     * that will be called on each node that matches the search criteria. It is of type `C`, which
+     * extends `NodeCallback<NODE>`. The callback function should accept a node of type `NODE` as its
+     * argument and
+     * @param {BTNRep<K, V, NODE> | R} startNode - The `startNode` parameter in the `override search`
+     * method represents the node from which the search operation will begin. It is the starting point
+     * for searching within the tree data structure. The method ensures that the `startNode` is a valid
+     * node before proceeding with the search operation. If the `
+     * @param {IterationType} iterationType - The `iterationType` parameter in the `override search`
+     * function determines the type of iteration to be used during the search operation. It can have two
+     * possible values:
+     * @returns The `override search` method returns an array of values that match the search criteria
+     * specified by the input parameters. The method performs a search operation on a binary tree
+     * structure based on the provided key, predicate, and other options. The search results are
+     * collected in an array and returned as the output of the method.
      */
-    getNodes(keyNodeEntryRawOrPredicate, onlyOne = false, startNode = this._root, iterationType = this.iterationType) {
+    search(keyNodeEntryRawOrPredicate, onlyOne = false, callback = this._DEFAULT_NODE_CALLBACK, startNode = this._root, iterationType = this.iterationType) {
       if (keyNodeEntryRawOrPredicate === void 0) return [];
       if (keyNodeEntryRawOrPredicate === null) return [];
       startNode = this.ensureNode(startNode);
       if (!startNode) return [];
-      const callback = this._ensurePredicate(keyNodeEntryRawOrPredicate);
+      let predicate;
+      const isRange = this.isRange(keyNodeEntryRawOrPredicate);
+      if (isRange) {
+        predicate = (node) => keyNodeEntryRawOrPredicate.isInRange(node.key, this._comparator);
+      } else {
+        predicate = this._ensurePredicate(keyNodeEntryRawOrPredicate);
+      }
+      const isToLeftByRange = (cur) => {
+        if (isRange) {
+          const range = keyNodeEntryRawOrPredicate;
+          const leftS = this.isReverse ? range.high : range.low;
+          const leftI = this.isReverse ? range.includeHigh : range.includeLow;
+          return leftI && this._compare(cur.key, leftS) >= 0 || !leftI && this._compare(cur.key, leftS) > 0;
+        }
+        return false;
+      };
+      const isToRightByRange = (cur) => {
+        if (isRange) {
+          const range = keyNodeEntryRawOrPredicate;
+          const rightS = this.isReverse ? range.low : range.high;
+          const rightI = this.isReverse ? range.includeLow : range.includeLow;
+          return rightI && this._compare(cur.key, rightS) <= 0 || !rightI && this._compare(cur.key, rightS) < 0;
+        }
+        return false;
+      };
       const ans = [];
       if (iterationType === "RECURSIVE") {
         const dfs = (cur) => {
-          if (callback(cur)) {
-            ans.push(cur);
+          if (predicate(cur)) {
+            ans.push(callback(cur));
             if (onlyOne) return;
           }
           if (!this.isRealNode(cur.left) && !this.isRealNode(cur.right)) return;
-          if (!this._isPredicate(keyNodeEntryRawOrPredicate)) {
-            const benchmarkKey = this._getKey(keyNodeEntryRawOrPredicate);
-            if (this.isRealNode(cur.left) && benchmarkKey !== null && benchmarkKey !== void 0 && this.comparator(cur.key, benchmarkKey) > 0)
+          if (isRange) {
+            if (this.isRealNode(cur.left) && isToLeftByRange(cur)) dfs(cur.left);
+            if (this.isRealNode(cur.right) && isToRightByRange(cur)) dfs(cur.right);
+          } else if (!this._isPredicate(keyNodeEntryRawOrPredicate)) {
+            const benchmarkKey = this._extractKey(keyNodeEntryRawOrPredicate);
+            if (this.isRealNode(cur.left) && benchmarkKey !== null && benchmarkKey !== void 0 && this._compare(cur.key, benchmarkKey) > 0)
               dfs(cur.left);
-            if (this.isRealNode(cur.right) && benchmarkKey !== null && benchmarkKey !== void 0 && this.comparator(cur.key, benchmarkKey) < 0)
+            if (this.isRealNode(cur.right) && benchmarkKey !== null && benchmarkKey !== void 0 && this._compare(cur.key, benchmarkKey) < 0)
               dfs(cur.right);
           } else {
             if (this.isRealNode(cur.left)) dfs(cur.left);
@@ -9279,15 +9654,18 @@ var dataStructureTyped = (() => {
         const stack = [startNode];
         while (stack.length > 0) {
           const cur = stack.pop();
-          if (callback(cur)) {
-            ans.push(cur);
+          if (predicate(cur)) {
+            ans.push(callback(cur));
             if (onlyOne) return ans;
           }
-          if (!this._isPredicate(keyNodeEntryRawOrPredicate)) {
-            const benchmarkKey = this._getKey(keyNodeEntryRawOrPredicate);
-            if (this.isRealNode(cur.right) && benchmarkKey !== null && benchmarkKey !== void 0 && this.comparator(cur.key, benchmarkKey) < 0)
+          if (isRange) {
+            if (this.isRealNode(cur.left) && isToLeftByRange(cur)) stack.push(cur.left);
+            if (this.isRealNode(cur.right) && isToRightByRange(cur)) stack.push(cur.right);
+          } else if (!this._isPredicate(keyNodeEntryRawOrPredicate)) {
+            const benchmarkKey = this._extractKey(keyNodeEntryRawOrPredicate);
+            if (this.isRealNode(cur.right) && benchmarkKey !== null && benchmarkKey !== void 0 && this._compare(cur.key, benchmarkKey) < 0)
               stack.push(cur.right);
-            if (this.isRealNode(cur.left) && benchmarkKey !== null && benchmarkKey !== void 0 && this.comparator(cur.key, benchmarkKey) > 0)
+            if (this.isRealNode(cur.left) && benchmarkKey !== null && benchmarkKey !== void 0 && this._compare(cur.key, benchmarkKey) > 0)
               stack.push(cur.left);
           } else {
             if (this.isRealNode(cur.right)) stack.push(cur.right);
@@ -9297,6 +9675,31 @@ var dataStructureTyped = (() => {
       }
       return ans;
     }
+    /**
+     * Time Complexity: O(log n)
+     * Space Complexity: O(n)
+     *
+     * The `rangeSearch` function searches for nodes within a specified range in a binary search tree.
+     * @param {Range<K> | [K, K]} range - The `range` parameter in the `rangeSearch` function can be
+     * either a `Range` object or an array of two elements representing the range boundaries.
+     * @param {C} callback - The `callback` parameter in the `rangeSearch` function is a callback
+     * function that is used to process each node that is found within the specified range during the
+     * search operation. It is of type `NodeCallback<NODE>`, where `NODE` is the type of nodes in the
+     * data structure.
+     * @param {BTNRep<K, V, NODE> | R} startNode - The `startNode` parameter in the `rangeSearch`
+     * function represents the node from which the search for nodes within the specified range will
+     * begin. It is the starting point for the range search operation.
+     * @param {IterationType} iterationType - The `iterationType` parameter in the `rangeSearch` function
+     * is used to specify the type of iteration to be performed during the search operation. It has a
+     * default value of `this.iterationType`, which suggests that it is likely a property of the class or
+     * object that the `rangeSearch`
+     * @returns The `rangeSearch` function is returning the result of calling the `search` method with
+     * the specified parameters.
+     */
+    rangeSearch(range, callback = this._DEFAULT_NODE_CALLBACK, startNode = this._root, iterationType = this.iterationType) {
+      const searchRange = range instanceof Range ? range : new Range(range[0], range[1]);
+      return this.search(searchRange, false, callback, startNode, iterationType);
+    }
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -9321,22 +9724,6 @@ var dataStructureTyped = (() => {
       var _a;
       return (_a = this.getNodes(keyNodeEntryRawOrPredicate, true, startNode, iterationType)[0]) != null ? _a : void 0;
     }
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     *
-     * The function `getNodeByKey` returns a node with a specific key from a tree data structure.
-     * @param {K} key - The key parameter is the value used to search for a specific node in the tree. It
-     * is typically a unique identifier or a value that can be used to determine the position of the node
-     * in the tree structure.
-     * @param {IterationType} [iterationType=ITERATIVE] - The `iterationType` parameter is an optional
-     * parameter that specifies the type of iteration to be used when searching for a node in the tree.
-     * It has a default value of `'ITERATIVE'`.
-     * @returns The method is returning a NODE object or undefined.
-     */
-    getNodeByKey(key, iterationType = this.iterationType) {
-      return this.getNode(key, this._root, iterationType);
-    }
     /**
      * Time complexity: O(n)
      * Space complexity: O(n)
@@ -9430,7 +9817,7 @@ var dataStructureTyped = (() => {
       const targetKey = targetNodeEnsured.key;
       if (iterationType === "RECURSIVE") {
         const dfs = (cur) => {
-          const compared = this.comparator(cur.key, targetKey);
+          const compared = this._compare(cur.key, targetKey);
           if (Math.sign(compared) === lesserOrGreater) ans.push(callback(cur));
           if (this.isRealNode(cur.left)) dfs(cur.left);
           if (this.isRealNode(cur.right)) dfs(cur.right);
@@ -9442,7 +9829,7 @@ var dataStructureTyped = (() => {
         while (queue.size > 0) {
           const cur = queue.shift();
           if (this.isRealNode(cur)) {
-            const compared = this.comparator(cur.key, targetKey);
+            const compared = this._compare(cur.key, targetKey);
             if (Math.sign(compared) === lesserOrGreater) ans.push(callback(cur));
             if (this.isRealNode(cur.left)) queue.push(cur.left);
             if (this.isRealNode(cur.right)) queue.push(cur.right);
@@ -9554,6 +9941,14 @@ var dataStructureTyped = (() => {
     get comparator() {
       return this._comparator;
     }
+    /**
+     * This function returns the value of the `_extractComparable` property.
+     * @returns The method `extractComparable()` is being returned, which is a getter method for the
+     * `_extractComparable` property.
+     */
+    get extractComparable() {
+      return this._extractComparable;
+    }
     /**
      * The function sets the root of a tree-like structure and updates the parent property of the new
      * root.
@@ -9565,6 +9960,9 @@ var dataStructureTyped = (() => {
       }
       this._root = v;
     }
+    _compare(a, b) {
+      return this._isReverse ? -this._comparator(a, b) : this._comparator(a, b);
+    }
   };
 
   // src/data-structures/binary-tree/binary-indexed-tree.ts
@@ -10200,8 +10598,9 @@ var dataStructureTyped = (() => {
       return new _AVLTree([], __spreadValues({
         iterationType: this.iterationType,
         isMapMode: this._isMapMode,
-        comparator: this._comparator,
-        toEntryFn: this._toEntryFn
+        extractComparable: this._extractComparable,
+        toEntryFn: this._toEntryFn,
+        isReverse: this._isReverse
       }, options));
     }
     /**
@@ -10487,7 +10886,7 @@ var dataStructureTyped = (() => {
      */
     _balancePath(node) {
       node = this.ensureNode(node);
-      const path = this.getPathToRoot((node2) => node2, node, false);
+      const path = this.getPathToRoot(node, (node2) => node2, false);
       for (let i = 0; i < path.length; i++) {
         const A = path[i];
         if (A) {
@@ -10533,7 +10932,7 @@ var dataStructureTyped = (() => {
     }
   };
 
-  // src/data-structures/binary-tree/rb-tree.ts
+  // src/data-structures/binary-tree/red-black-tree.ts
   var RedBlackTreeNode = class extends BSTNode {
     /**
      * The constructor function initializes a Red-Black Tree Node with a key, an optional value, and a
@@ -10619,7 +11018,7 @@ var dataStructureTyped = (() => {
       return new _RedBlackTree([], __spreadValues({
         iterationType: this.iterationType,
         isMapMode: this._isMapMode,
-        comparator: this._comparator,
+        extractComparable: this._extractComparable,
         toEntryFn: this._toEntryFn
       }, options));
     }
@@ -10698,7 +11097,7 @@ var dataStructureTyped = (() => {
      * returns true. If the node cannot be added or updated, the method returns false.
      */
     add(keyNodeEntryOrRaw, value) {
-      const [newNode, newValue] = this.keyValueNodeEntryRawToNodeAndValue(keyNodeEntryOrRaw, value);
+      const [newNode, newValue] = this._keyValueNodeEntryRawToNodeAndValue(keyNodeEntryOrRaw, value);
       if (!this.isRealNode(newNode)) return false;
       const insertStatus = this._insert(newNode);
       if (insertStatus === "CREATED") {
@@ -10828,7 +11227,7 @@ var dataStructureTyped = (() => {
       let parent = void 0;
       while (this.isRealNode(current)) {
         parent = current;
-        const compared = this.comparator(node.key, current.key);
+        const compared = this._compare(node.key, current.key);
         if (compared < 0) {
           current = (_a = current.left) != null ? _a : this.NIL;
         } else if (compared > 0) {
@@ -11143,8 +11542,9 @@ var dataStructureTyped = (() => {
       return new _AVLTreeMultiMap([], __spreadValues({
         iterationType: this.iterationType,
         isMapMode: this._isMapMode,
-        comparator: this._comparator,
-        toEntryFn: this._toEntryFn
+        extractComparable: this._extractComparable,
+        toEntryFn: this._toEntryFn,
+        isReverse: this._isReverse
       }, options));
     }
     /**
@@ -11169,7 +11569,7 @@ var dataStructureTyped = (() => {
      * times the key-value pair should be added to the data structure. If not provided, it defaults to 1.
      * @returns either a NODE object or undefined.
      */
-    keyValueNodeEntryRawToNodeAndValue(keyNodeEntryOrRaw, value, count = 1) {
+    _keyValueNodeEntryRawToNodeAndValue(keyNodeEntryOrRaw, value, count = 1) {
       if (keyNodeEntryOrRaw === void 0 || keyNodeEntryOrRaw === null) return [void 0, void 0];
       if (this.isNode(keyNodeEntryOrRaw)) return [keyNodeEntryOrRaw, value];
       if (this.isEntry(keyNodeEntryOrRaw)) {
@@ -11178,15 +11578,12 @@ var dataStructureTyped = (() => {
         const finalValue = value != null ? value : entryValue;
         return [this.createNode(key, finalValue, count), finalValue];
       }
-      if (this.isKey(keyNodeEntryOrRaw)) return [this.createNode(keyNodeEntryOrRaw, value, count), value];
       if (this.isRaw(keyNodeEntryOrRaw)) {
-        if (this._toEntryFn) {
-          const [key, entryValue] = this._toEntryFn(keyNodeEntryOrRaw);
-          const finalValue = value != null ? value : entryValue;
-          if (this.isKey(key)) return [this.createNode(key, finalValue, count), finalValue];
-        }
-        return [void 0, void 0];
+        const [key, entryValue] = this._toEntryFn(keyNodeEntryOrRaw);
+        const finalValue = value != null ? value : entryValue;
+        if (this.isKey(key)) return [this.createNode(key, finalValue, count), finalValue];
       }
+      if (this.isKey(keyNodeEntryOrRaw)) return [this.createNode(keyNodeEntryOrRaw, value, count), value];
       return [void 0, void 0];
     }
     /**
@@ -11207,7 +11604,7 @@ var dataStructureTyped = (() => {
      * @returns a boolean value.
      */
     add(keyNodeEntryOrRaw, value, count = 1) {
-      const [newNode, newValue] = this.keyValueNodeEntryRawToNodeAndValue(keyNodeEntryOrRaw, value, count);
+      const [newNode, newValue] = this._keyValueNodeEntryRawToNodeAndValue(keyNodeEntryOrRaw, value, count);
       if (newNode === void 0) return false;
       const orgNodeCount = (newNode == null ? void 0 : newNode.count) || 0;
       const inserted = super.add(newNode, newValue);
@@ -11505,7 +11902,7 @@ var dataStructureTyped = (() => {
       return new _TreeMultiMap([], __spreadValues({
         iterationType: this.iterationType,
         isMapMode: this._isMapMode,
-        comparator: this._comparator,
+        extractComparable: this._extractComparable,
         toEntryFn: this._toEntryFn
       }, options));
     }
@@ -11521,7 +11918,7 @@ var dataStructureTyped = (() => {
      * times the key-value pair should be added to the data structure. If not provided, it defaults to 1.
      * @returns either a NODE object or undefined.
      */
-    keyValueNodeEntryRawToNodeAndValue(keyNodeEntryOrRaw, value, count = 1) {
+    _keyValueNodeEntryRawToNodeAndValue(keyNodeEntryOrRaw, value, count = 1) {
       if (keyNodeEntryOrRaw === void 0 || keyNodeEntryOrRaw === null) return [void 0, void 0];
       if (this.isNode(keyNodeEntryOrRaw)) return [keyNodeEntryOrRaw, value];
       if (this.isEntry(keyNodeEntryOrRaw)) {
@@ -11530,7 +11927,7 @@ var dataStructureTyped = (() => {
         const finalValue = value != null ? value : entryValue;
         if (this.isKey(key)) return [this.createNode(key, finalValue, "BLACK", count), finalValue];
       }
-      if (this._toEntryFn) {
+      if (this.isRaw(keyNodeEntryOrRaw)) {
         const [key, entryValue] = this._toEntryFn(keyNodeEntryOrRaw);
         const finalValue = value != null ? value : entryValue;
         if (this.isKey(key)) return [this.createNode(key, finalValue, "BLACK", count), finalValue];
@@ -11565,7 +11962,7 @@ var dataStructureTyped = (() => {
      * was successful, and false otherwise.
      */
     add(keyNodeEntryOrRaw, value, count = 1) {
-      const [newNode, newValue] = this.keyValueNodeEntryRawToNodeAndValue(keyNodeEntryOrRaw, value, count);
+      const [newNode, newValue] = this._keyValueNodeEntryRawToNodeAndValue(keyNodeEntryOrRaw, value, count);
       const orgCount = (newNode == null ? void 0 : newNode.count) || 0;
       const isSuccessAdded = super.add(newNode, newValue);
       if (isSuccessAdded) {
@@ -12649,10 +13046,16 @@ var dataStructureTyped = (() => {
   };
   var Trie = class _Trie extends IterableElementBase {
     /**
-     * The constructor function for the Trie class.
-     * @param words: Iterable string Initialize the trie with a set of words
-     * @param options?: TrieOptions Allow the user to pass in options for the trie
-     * @return This
+     * The constructor initializes a Trie data structure with optional options and words provided as
+     * input.
+     * @param {Iterable<string> | Iterable<R>} words - The `words` parameter in the constructor is an
+     * iterable containing either strings or elements of type `R`. It is used to initialize the Trie with
+     * a list of words or elements. If no `words` are provided, an empty iterable is used as the default
+     * value.
+     * @param [options] - The `options` parameter in the constructor is an optional object that can
+     * contain configuration options for the Trie data structure. One of the options it can have is
+     * `caseSensitive`, which is a boolean value indicating whether the Trie should be case-sensitive or
+     * not. If `caseSensitive` is set to `
      */
     constructor(words = [], options) {
       super(options);
@@ -12664,13 +13067,7 @@ var dataStructureTyped = (() => {
         if (caseSensitive !== void 0) this._caseSensitive = caseSensitive;
       }
       if (words) {
-        for (const word of words) {
-          if (this.toElementFn) {
-            this.add(this.toElementFn(word));
-          } else {
-            this.add(word);
-          }
-        }
+        this.addMany(words);
       }
     }
     /**
@@ -12721,6 +13118,29 @@ var dataStructureTyped = (() => {
       }
       return isNewWord;
     }
+    /**
+     * Time Complexity: O(n * l)
+     * Space Complexity: O(1)
+     *
+     * The `addMany` function in TypeScript takes an iterable of strings or elements of type R, converts
+     * them using a provided function if available, and adds them to a data structure while returning an
+     * array of boolean values indicating success.
+     * @param {Iterable<string> | Iterable<R>} words - The `words` parameter in the `addMany` function is
+     * an iterable that contains either strings or elements of type `R`.
+     * @returns The `addMany` method returns an array of boolean values indicating whether each word in
+     * the input iterable was successfully added to the data structure.
+     */
+    addMany(words) {
+      const ans = [];
+      for (const word of words) {
+        if (this.toElementFn) {
+          ans.push(this.add(this.toElementFn(word)));
+        } else {
+          ans.push(this.add(word));
+        }
+      }
+      return ans;
+    }
     /**
      * Time Complexity: O(l), where l is the length of the input word.
      * Space Complexity: O(1) - Constant space.
@@ -12802,9 +13222,14 @@ 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)
+     * Space Complexity: O(1)
      *
+     * The function `getHeight` calculates the height of a trie data structure starting from the root
+     * node.
+     * @returns The `getHeight` method returns the maximum depth or height of the trie tree starting from
+     * the root node. It calculates the depth using a breadth-first search (BFS) traversal of the trie
+     * tree and returns the maximum depth found.
      */
     getHeight() {
       const startNode = this.root;