data-structure-typed 1.50.4 → 1.50.6

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

@@ -178,10 +178,6 @@ var dataStructureTyped = (() => {
 
   // src/data-structures/base/iterable-base.ts
   var IterableEntryBase = class {
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -299,6 +295,10 @@ var dataStructureTyped = (() => {
      * Time Complexity: O(n)
      * Space Complexity: O(1)
      */
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(1)
+     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -413,10 +413,6 @@ var dataStructureTyped = (() => {
       }
       return;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -513,6 +509,10 @@ var dataStructureTyped = (() => {
      * Time Complexity: O(n)
      * Space Complexity: O(1)
      */
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(1)
+     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -587,10 +587,6 @@ var dataStructureTyped = (() => {
       }
       return;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -1663,6 +1659,24 @@ var dataStructureTyped = (() => {
     get tail() {
       return this._tail;
     }
+    /**
+     * The above function returns the value of the first element in a linked list, or undefined if the
+     * list is empty.
+     * @returns The value of the first node in the linked list, or undefined if the linked list is empty.
+     */
+    get first() {
+      var _a;
+      return (_a = this.head) == null ? void 0 : _a.value;
+    }
+    /**
+     * The function returns the value of the last element in a linked list, or undefined if the list is
+     * empty.
+     * @returns The value of the last node in the linked list, or undefined if the linked list is empty.
+     */
+    get last() {
+      var _a;
+      return (_a = this.tail) == null ? void 0 : _a.value;
+    }
     /**
      * The function returns the size of an object.
      * @returns The size of the object, which is a number.
@@ -1695,19 +1709,18 @@ var dataStructureTyped = (() => {
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
-     * Constant time, as it involves basic pointer adjustments.
-     * Constant space, as it only creates a new node.
      */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
      *
-     * The `push` function adds a new node with the given value to the end of a singly linked list.
-     * @param {E} value - The "value" parameter represents the value that you want to add to the linked list. It can be of
-     * any type (E) as specified in the generic type declaration of the class or function.
+     * The push function adds a new element to the end of a singly linked list.
+     * @param {E} element - The "element" parameter represents the value of the element that you want to
+     * add to the linked list.
+     * @returns The `push` method is returning a boolean value, `true`.
      */
-    push(value) {
-      const newNode = new SinglyLinkedListNode(value);
+    push(element) {
+      const newNode = new SinglyLinkedListNode(element);
       if (!this.head) {
         this._head = newNode;
         this._tail = newNode;
@@ -1718,21 +1731,6 @@ var dataStructureTyped = (() => {
       this._size++;
       return true;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The `push` function adds a new node with the given value to the end of a singly linked list.
-     * @param {E} value - The "value" parameter represents the value that you want to add to the linked list. It can be of
-     * any type (E) as specified in the generic type declaration of the class or function.
-     */
-    addLast(value) {
-      return this.push(value);
-    }
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -1742,10 +1740,9 @@ var dataStructureTyped = (() => {
      * Time Complexity: O(n)
      * Space Complexity: O(1)
      *
-     * The `pop()` function removes and returns the value of the last element in a linked list, updating the head and tail
-     * pointers accordingly.
-     * @returns The method `pop()` returns the value of the node that is being removed from the end of the linked list. If
-     * the linked list is empty, it returns `undefined`.
+     * 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 element that is being popped from the end of the
+     * list.
      */
     pop() {
       if (!this.head)
@@ -1767,22 +1764,6 @@ var dataStructureTyped = (() => {
       this._size--;
       return value;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     *
-     * The `pollLast()` function removes and returns the value of the last element in a linked list, updating the head and tail
-     * pointers accordingly.
-     * @returns The method `pop()` returns the value of the node that is being removed from the end of the linked list. If
-     * the linked list is empty, it returns `undefined`.
-     */
-    pollLast() {
-      return this.pop();
-    }
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -1791,8 +1772,8 @@ var dataStructureTyped = (() => {
      * Time Complexity: O(1)
      * Space Complexity: O(1)
      *
-     * The `shift()` function removes and returns the value of the first node in a linked list.
-     * @returns The value of the node that is being removed from the beginning of the linked list.
+     * The `shift()` function removes and returns the value of the first element in a linked list.
+     * @returns The value of the removed node.
      */
     shift() {
       if (!this.head)
@@ -1810,26 +1791,13 @@ var dataStructureTyped = (() => {
      * Time Complexity: O(1)
      * Space Complexity: O(1)
      *
-     * The `pollFirst()` function removes and returns the value of the first node in a linked list.
-     * @returns The value of the node that is being removed from the beginning of the linked list.
+     * The unshift function adds a new element to the beginning of a singly linked list.
+     * @param {E} element - The "element" parameter represents the value of the element that you want to
+     * add to the beginning of the singly linked list.
+     * @returns The `unshift` method is returning a boolean value, `true`.
      */
-    pollFirst() {
-      return this.shift();
-    }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The unshift function adds a new node with the given value to the beginning of a singly linked list.
-     * @param {E} value - The parameter "value" represents the value of the new node that will be added to the beginning of the
-     * linked list.
-     */
-    unshift(value) {
-      const newNode = new SinglyLinkedListNode(value);
+    unshift(element) {
+      const newNode = new SinglyLinkedListNode(element);
       if (!this.head) {
         this._head = newNode;
         this._tail = newNode;
@@ -1840,25 +1808,9 @@ var dataStructureTyped = (() => {
       this._size++;
       return true;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The addFirst function adds a new node with the given value to the beginning of a singly linked list.
-     * @param {E} value - The parameter "value" represents the value of the new node that will be added to the beginning of the
-     * linked list.
-     */
-    addFirst(value) {
-      return this.unshift(value);
-    }
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
-     * Linear time, where n is the index, as it may need to traverse the list to find the desired node.
      */
     /**
      * Time Complexity: O(n)
@@ -2467,14 +2419,13 @@ var dataStructureTyped = (() => {
      * Space Complexity: O(1)
      */
     /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The push function adds a new node with the given value to the end of the doubly linked list.
-     * @param {E} value - The value to be added to the linked list.
+     * 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.
+     * @returns The `push` method is returning a boolean value, `true`.
      */
-    push(value) {
-      const newNode = new DoublyLinkedListNode(value);
+    push(element) {
+      const newNode = new DoublyLinkedListNode(element);
       if (!this.head) {
         this._head = newNode;
         this._tail = newNode;
@@ -2491,12 +2442,8 @@ var dataStructureTyped = (() => {
      * Space Complexity: O(1)
      */
     /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The `pop()` function removes and returns the value of the last node in a doubly linked list.
-     * @returns The method is returning the value of the removed node (removedNode.value) if the list is not empty. If the
-     * list is empty, it returns undefined.
+     * 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.
      */
     pop() {
       if (!this.tail)
@@ -2517,12 +2464,8 @@ var dataStructureTyped = (() => {
      * Space Complexity: O(1)
      */
     /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The `shift()` function removes and returns the value of the first node in a doubly linked list.
-     * @returns The method `shift()` returns the value of the node that is removed from the beginning of the doubly linked
-     * list.
+     * The `shift()` function removes and returns the value of the first element in a doubly linked list.
+     * @returns The value of the removed node.
      */
     shift() {
       if (!this.head)
@@ -2543,15 +2486,13 @@ var dataStructureTyped = (() => {
      * Space Complexity: O(1)
      */
     /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The unshift function adds a new node with the given value to the beginning of a doubly linked list.
-     * @param {E} value - The `value` parameter represents the value of the new node that will be added to the beginning of the
-     * doubly linked list.
+     * 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.
+     * @returns The `unshift` method is returning a boolean value, `true`.
      */
-    unshift(value) {
-      const newNode = new DoublyLinkedListNode(value);
+    unshift(element) {
+      const newNode = new DoublyLinkedListNode(element);
       if (!this.head) {
         this._head = newNode;
         this._tail = newNode;
@@ -3035,65 +2976,6 @@ var dataStructureTyped = (() => {
       }
       return mappedList;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The addLast function adds a new node with the given value to the end of the doubly linked list.
-     * @param {E} value - The value to be added to the linked list.
-     */
-    addLast(value) {
-      return this.push(value);
-    }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The `pollLast()` function removes and returns the value of the last node in a doubly linked list.
-     * @returns The method is returning the value of the removed node (removedNode.value) if the list is not empty. If the
-     * list is empty, it returns undefined.
-     */
-    pollLast() {
-      return this.pop();
-    }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The `pollFirst()` function removes and returns the value of the first node in a doubly linked list.
-     * @returns The method `shift()` returns the value of the node that is removed from the beginning of the doubly linked
-     * list.
-     */
-    pollFirst() {
-      return this.shift();
-    }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The addFirst function adds a new node with the given value to the beginning of a doubly linked list.
-     * @param {E} value - The `value` parameter represents the value of the new node that will be added to the beginning of the
-     * doubly linked list.
-     */
-    addFirst(value) {
-      this.unshift(value);
-    }
     /**
      * The function returns an iterator that iterates over the values of a linked list.
      */
@@ -3760,64 +3642,6 @@ var dataStructureTyped = (() => {
       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)
-     *
-     * The `peek` function returns the first element of the array `_elements` if it exists, otherwise it returns `undefined`.
-     * @returns The `peek()` method returns the first element of the data structure, represented by the `_elements` array at
-     * the `_offset` index. If the data structure is empty (size is 0), it returns `undefined`.
-     */
-    peek() {
-      return this.first;
-    }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The `peekLast` function returns the last element in an array-like data structure, or undefined if the structure is empty.
-     * @returns The method `peekLast()` returns the last element of the `_elements` array if the array is not empty. If the
-     * array is empty, it returns `undefined`.
-     */
-    peekLast() {
-      return this.last;
-    }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The enqueue function adds a value to the end of a queue.
-     * @param {E} value - The value parameter represents the value that you want to add to the queue.
-     */
-    enqueue(value) {
-      return this.push(value);
-    }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The `dequeue` function removes and returns the first element from a queue, or returns undefined if the queue is empty.
-     * @returns The method is returning a value of type E or undefined.
-     */
-    dequeue() {
-      return this.shift();
-    }
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -3963,35 +3787,6 @@ var dataStructureTyped = (() => {
     }
   };
   var LinkedListQueue = class _LinkedListQueue extends SinglyLinkedList {
-    /**
-     * The `get first` function returns the value of the head node in a linked list, or `undefined` if the list is empty.
-     * @returns The `get first()` method is returning the value of the `head` node if it exists, otherwise it returns `undefined`.
-     */
-    get first() {
-      var _a;
-      return (_a = this.head) == null ? void 0 : _a.value;
-    }
-    /**
-     * The enqueue function adds a value to the end of an array.
-     * @param {E} value - The value parameter represents the value that you want to add to the queue.
-     */
-    enqueue(value) {
-      return this.push(value);
-    }
-    /**
-     * The `dequeue` function removes and returns the first element from a queue, or returns undefined if the queue is empty.
-     * @returns The method is returning the element at the front of the queue, or undefined if the queue is empty.
-     */
-    dequeue() {
-      return this.shift();
-    }
-    /**
-     * The `peek` function returns the value of the head node in a linked list, or `undefined` if the list is empty.
-     * @returns The `peek()` method is returning the value of the `head` node if it exists, otherwise it returns `undefined`.
-     */
-    peek() {
-      return this.first;
-    }
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -4753,67 +4548,6 @@ var dataStructureTyped = (() => {
       }
       return newDeque;
     }
-    /**
-     * Time Complexity: Amortized O(1) - Similar to push, resizing leads to O(n).
-     * Space Complexity: O(n) - Due to potential resizing.
-     */
-    /**
-     * Time Complexity: Amortized O(1) - Similar to push, resizing leads to O(n).
-     * Space Complexity: O(n) - Due to potential resizing.
-     *
-     * The addLast function adds an element to the end of an array.
-     * @param {E} element - The element parameter represents the element that you want to add to the end of the
-     * data structure.
-     */
-    addLast(element) {
-      return this.push(element);
-    }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The function "pollLast" removes and returns the last element of an array.
-     * @returns The last element of the array is being returned.
-     */
-    pollLast() {
-      return this.pop();
-    }
-    /**
-       * Time Complexity: O(1)
-       * Space Complexity: O(1)
-       * /
-    
-       /**
-       * Time Complexity: O(1)
-       * Space Complexity: O(1)
-       *
-       * The "addFirst" function adds an element to the beginning of an array.
-       * @param {E} element - The parameter "element" represents the element that you want to add to the
-       * beginning of the data structure.
-       */
-    addFirst(element) {
-      return this.unshift(element);
-    }
-    /**
-       * Time Complexity: O(1)
-       * Space Complexity: O(1)
-       * /
-    
-       /**
-       * Time Complexity: O(1)
-       * Space Complexity: O(1)
-       *
-       * The function "pollFirst" removes and returns the first element of an array.
-       * @returns The method `pollFirst()` is returning the first element of the array after removing it
-       * from the beginning. If the array is empty, it will return `undefined`.
-       */
-    pollFirst() {
-      return this.shift();
-    }
     /**
        * Time Complexity: O(n)
        * Space Complexity: O(1)
@@ -5786,6 +5520,9 @@ var dataStructureTyped = (() => {
     set vertexMap(v) {
       this._vertexMap = v;
     }
+    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.
@@ -8649,7 +8386,7 @@ var dataStructureTyped = (() => {
         return true;
       if (iterationType === "RECURSIVE" /* RECURSIVE */) {
         const dfs = (cur, min, max) => {
-          if (!cur)
+          if (!this.isRealNode(cur))
             return true;
           const numKey = this.extractor(cur.key);
           if (numKey <= min || numKey >= max)
@@ -8664,14 +8401,14 @@ var dataStructureTyped = (() => {
           const stack = [];
           let prev = checkMax ? Number.MAX_SAFE_INTEGER : Number.MIN_SAFE_INTEGER;
           let curr = beginRoot;
-          while (curr || stack.length > 0) {
-            while (curr) {
+          while (this.isRealNode(curr) || stack.length > 0) {
+            while (this.isRealNode(curr)) {
               stack.push(curr);
               curr = curr.left;
             }
             curr = stack.pop();
             const numKey = this.extractor(curr.key);
-            if (!curr || !checkMax && prev >= numKey || checkMax && prev <= numKey)
+            if (!this.isRealNode(curr) || !checkMax && prev >= numKey || checkMax && prev <= numKey)
               return false;
             prev = numKey;
             curr = curr.right;
@@ -8736,7 +8473,7 @@ var dataStructureTyped = (() => {
         return -1;
       if (iterationType === "RECURSIVE" /* RECURSIVE */) {
         const _getMaxHeight = (cur) => {
-          if (!cur)
+          if (!this.isRealNode(cur))
             return -1;
           const leftHeight = _getMaxHeight(cur.left);
           const rightHeight = _getMaxHeight(cur.right);
@@ -8748,9 +8485,9 @@ var dataStructureTyped = (() => {
         let maxHeight = 0;
         while (stack.length > 0) {
           const { node, depth } = stack.pop();
-          if (node.left)
+          if (this.isRealNode(node.left))
             stack.push({ node: node.left, depth: depth + 1 });
-          if (node.right)
+          if (this.isRealNode(node.right))
             stack.push({ node: node.right, depth: depth + 1 });
           maxHeight = Math.max(maxHeight, depth);
         }
@@ -9015,45 +8752,45 @@ var dataStructureTyped = (() => {
           switch (pattern) {
             case "in":
               if (includeNull) {
-                if (node && this.isNodeOrNull(node.left))
+                if (this.isRealNode(node) && this.isNodeOrNull(node.left))
                   _traverse(node.left);
                 this.isNodeOrNull(node) && ans.push(callback(node));
-                if (node && this.isNodeOrNull(node.right))
+                if (this.isRealNode(node) && this.isNodeOrNull(node.right))
                   _traverse(node.right);
               } else {
-                if (node && node.left)
+                if (this.isRealNode(node) && this.isRealNode(node.left))
                   _traverse(node.left);
                 this.isRealNode(node) && ans.push(callback(node));
-                if (node && node.right)
+                if (this.isRealNode(node) && this.isRealNode(node.right))
                   _traverse(node.right);
               }
               break;
             case "pre":
               if (includeNull) {
                 this.isNodeOrNull(node) && ans.push(callback(node));
-                if (node && this.isNodeOrNull(node.left))
+                if (this.isRealNode(node) && this.isNodeOrNull(node.left))
                   _traverse(node.left);
-                if (node && this.isNodeOrNull(node.right))
+                if (this.isRealNode(node) && this.isNodeOrNull(node.right))
                   _traverse(node.right);
               } else {
                 this.isRealNode(node) && ans.push(callback(node));
-                if (node && node.left)
+                if (this.isRealNode(node) && this.isRealNode(node.left))
                   _traverse(node.left);
-                if (node && node.right)
+                if (this.isRealNode(node) && this.isRealNode(node.right))
                   _traverse(node.right);
               }
               break;
             case "post":
               if (includeNull) {
-                if (node && this.isNodeOrNull(node.left))
+                if (this.isRealNode(node) && this.isNodeOrNull(node.left))
                   _traverse(node.left);
-                if (node && this.isNodeOrNull(node.right))
+                if (this.isRealNode(node) && this.isNodeOrNull(node.right))
                   _traverse(node.right);
                 this.isNodeOrNull(node) && ans.push(callback(node));
               } else {
-                if (node && node.left)
+                if (this.isRealNode(node) && this.isRealNode(node.left))
                   _traverse(node.left);
-                if (node && node.right)
+                if (this.isRealNode(node) && this.isRealNode(node.right))
                   _traverse(node.right);
                 this.isRealNode(node) && ans.push(callback(node));
               }
@@ -11424,7 +11161,7 @@ var dataStructureTyped = (() => {
     }
     /**
      * The function returns the color value of a variable.
-     * @returns The color value stored in the protected variable `_color`.
+     * @returns The color value stored in the private variable `_color`.
      */
     get color() {
       return this._color;
@@ -11439,35 +11176,35 @@ var dataStructureTyped = (() => {
   };
   var RedBlackTree = class _RedBlackTree extends BST {
     /**
-     * This is the constructor function for a Red-Black Tree data structure in TypeScript, which
-     * initializes the tree with optional nodes and options.
-     * @param [keysOrNodesOrEntries] - The `keysOrNodesOrEntries` parameter is an optional iterable of `KeyOrNodeOrEntry<K, V, NODE>`
-     * objects. It represents the initial nodes that will be added to the RBTree during its
-     * construction. If this parameter is provided, the `addMany` method is called to add all the
-     * nodes to the
-     * @param [options] - The `options` parameter is an optional object that allows you to customize the
-     * behavior of the RBTree. It is of type `Partial<RBTreeOptions>`, which means that you can provide
-     * only a subset of the properties defined in the `RBTreeOptions` interface.
+     * This is the constructor function for a Red-Black Tree data structure in TypeScript.
+     * @param keysOrNodesOrEntries - The `keysOrNodesOrEntries` parameter is an iterable object that can
+     * contain keys, nodes, or entries. It is used to initialize the RBTree with the provided keys,
+     * nodes, or entries.
+     * @param [options] - The `options` parameter is an optional object that can be passed to the
+     * constructor. It allows you to customize the behavior of the RBTree. It can include properties such
+     * as `compareKeys`, `compareValues`, `allowDuplicates`, etc. These properties define how the RBTree
+     * should compare keys and
      */
     constructor(keysOrNodesOrEntries = [], options) {
       super([], options);
-      __publicField(this, "_Sentinel", new RedBlackTreeNode(NaN));
+      __publicField(this, "_SENTINEL", new RedBlackTreeNode(NaN));
       __publicField(this, "_root");
       __publicField(this, "_size", 0);
-      this._root = this._Sentinel;
-      if (keysOrNodesOrEntries)
-        super.addMany(keysOrNodesOrEntries);
+      this._root = this.SENTINEL;
+      if (keysOrNodesOrEntries) {
+        this.addMany(keysOrNodesOrEntries);
+      }
     }
     /**
-     * The function returns the value of the `_Sentinel` property.
-     * @returns The method is returning the value of the `_Sentinel` property.
+     * The function returns the value of the _SENTINEL property.
+     * @returns The method is returning the value of the `_SENTINEL` property.
      */
-    get Sentinel() {
-      return this._Sentinel;
+    get SENTINEL() {
+      return this._SENTINEL;
     }
     /**
-     * The function returns the root node.
-     * @returns The root node of the data structure.
+     * The function returns the root node of a tree or undefined if there is no root.
+     * @returns The root node of the tree structure, or undefined if there is no root node.
      */
     get root() {
       return this._root;
@@ -11481,13 +11218,13 @@ var dataStructureTyped = (() => {
     }
     /**
      * The function creates a new Red-Black Tree node with the specified key, value, and color.
-     * @param {K} key - The key parameter is the key value associated with the node. It is used to
-     * identify and compare nodes in the Red-Black Tree.
+     * @param {K} key - The key parameter represents the key of the node being created. It is of type K,
+     * which is a generic type representing the key's data type.
      * @param {V} [value] - The `value` parameter is an optional parameter that represents the value
-     * associated with the node. It is of type `V`, which is a generic type that can be replaced with any
-     * specific type when using the `createNode` method.
+     * associated with the key in the node. It is not required and can be omitted if not needed.
      * @param {RBTNColor} color - The "color" parameter is used to specify the color of the node in a
-     * Red-Black Tree. It can be either "RED" or "BLACK". By default, the color is set to "BLACK".
+     * Red-Black Tree. It is an optional parameter with a default value of "RBTNColor.BLACK". The color
+     * can be either "RBTNColor.RED" or "RBTNColor.BLACK".
      * @returns The method is returning a new instance of a RedBlackTreeNode with the specified key,
      * value, and color.
      */
@@ -11495,10 +11232,10 @@ var dataStructureTyped = (() => {
       return new RedBlackTreeNode(key, value, color);
     }
     /**
-     * The function creates a Red-Black Tree with the specified options and returns it.
-     * @param {RBTreeOptions} [options] - The `options` parameter is an optional object that can be
-     * passed to the `createTree` function. It is used to customize the behavior of the `RedBlackTree`
-     * class.
+     * The function creates a Red-Black Tree with the given options and returns it.
+     * @param [options] - The `options` parameter is an optional object that contains configuration
+     * options for creating the Red-Black Tree. It is of type `RBTreeOptions<K>`, where `K` represents
+     * the type of keys in the tree.
      * @returns a new instance of a RedBlackTree object.
      */
     createTree(options) {
@@ -11507,12 +11244,18 @@ var dataStructureTyped = (() => {
       }, options));
     }
     /**
-     * The function `keyValueOrEntryToNode` takes an keyOrNodeOrEntry and converts it into a node object if possible.
-     * @param keyOrNodeOrEntry - The `keyOrNodeOrEntry` parameter is of type `KeyOrNodeOrEntry<K, V, NODE>`, where:
-     * @param {V} [value] - The `value` parameter is an optional value that can be passed to the
-     * `keyValueOrEntryToNode` function. It represents the value associated with the keyOrNodeOrEntry node. If a value
-     * is provided, it will be used when creating the new node. If no value is provided, the new node
-     * @returns a node of type NODE or undefined.
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     */
+    /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     *
+     * The function `keyValueOrEntryToNode` takes a key, value, or entry and returns a node if it is
+     * valid, otherwise it returns undefined.
+     * @param {KeyOrNodeOrEntry<K, V, NODE>} keyOrNodeOrEntry - The key, value, or entry to convert.
+     * @param {V} [value] - The value associated with the key (if `keyOrNodeOrEntry` is a key).
+     * @returns {NODE | undefined} - The corresponding Red-Black Tree node, or `undefined` if conversion fails.
      */
     keyValueOrEntryToNode(keyOrNodeOrEntry, value) {
       let node;
@@ -11535,183 +11278,63 @@ var dataStructureTyped = (() => {
       return node;
     }
     /**
-     * The function checks if an keyOrNodeOrEntry is an instance of the RedBlackTreeNode class.
-     * @param keyOrNodeOrEntry - The `keyOrNodeOrEntry` parameter is of type `KeyOrNodeOrEntry<K, V, NODE>`.
-     * @returns a boolean value indicating whether the keyOrNodeOrEntry is an instance of the RedBlackTreeNode
-     * class.
-     */
+       * Time Complexity: O(1)
+       * Space Complexity: O(1)
+       * /
+    
+       /**
+       * Time Complexity: O(1)
+       * Space Complexity: O(1)
+       *
+       * The function checks if the input is an instance of the RedBlackTreeNode class.
+       * @param {KeyOrNodeOrEntry<K, V, NODE>} keyOrNodeOrEntry - The object to check.
+       * @returns {boolean} - `true` if the object is a Red-Black Tree node, `false` otherwise.
+       */
     isNode(keyOrNodeOrEntry) {
       return keyOrNodeOrEntry instanceof RedBlackTreeNode;
     }
     /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     */
+    /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     *
      * The function checks if a given node is a real node in a Red-Black Tree.
      * @param {NODE | undefined} node - The `node` parameter is of type `NODE | undefined`, which means
      * it can either be of type `NODE` or `undefined`.
      * @returns a boolean value.
      */
     isRealNode(node) {
-      if (node === this._Sentinel || node === void 0)
+      if (node === this._SENTINEL || node === void 0)
         return false;
       return node instanceof RedBlackTreeNode;
     }
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
-     * On average (where n is the number of nodes in the tree)
      */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
      *
-     * The `add` function adds a new node to a binary search tree and performs necessary rotations and
-     * color changes to maintain the red-black tree properties.
-     * @param keyOrNodeOrEntry - The `keyOrNodeOrEntry` parameter can be either a key, a node, or an
-     * entry.
-     * @param {V} [value] - The `value` parameter represents the value associated with the key that is
-     * being added to the binary search tree.
-     * @returns The method `add` returns either the newly added node (`NODE`) or `undefined`.
-     */
-    add(keyOrNodeOrEntry, value) {
-      const newNode = this.keyValueOrEntryToNode(keyOrNodeOrEntry, value);
-      if (newNode === void 0)
-        return false;
-      newNode.left = this._Sentinel;
-      newNode.right = this._Sentinel;
-      let y = void 0;
-      let x = this.root;
-      while (x !== this._Sentinel) {
-        y = x;
-        if (x) {
-          if (newNode.key < x.key) {
-            x = x.left;
-          } else if (newNode.key > x.key) {
-            x = x == null ? void 0 : x.right;
-          } else {
-            if (newNode !== x) {
-              this._replaceNode(x, newNode);
-            }
-            return false;
-          }
-        }
-      }
-      newNode.parent = y;
-      if (y === void 0) {
-        this._setRoot(newNode);
-      } else if (newNode.key < y.key) {
-        y.left = newNode;
-      } else {
-        y.right = newNode;
-      }
-      if (newNode.parent === void 0) {
-        newNode.color = 0 /* BLACK */;
-        this._size++;
-        return false;
-      }
-      if (newNode.parent.parent === void 0) {
-        this._size++;
-        return false;
-      }
-      this._fixInsert(newNode);
-      this._size++;
-      return true;
-    }
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     *
-     * The `delete` function removes a node from a binary tree based on a given identifier and updates
-     * the tree accordingly.
-     * @param {ReturnType<C> | null | undefined} identifier - The `identifier` parameter is the value
-     * that you want to use to identify the node that you want to delete from the binary tree. It can be
-     * of any type that is returned by the callback function `C`. It can also be `null` or `undefined` if
-     * you don't want to
-     * @param {C} callback - The `callback` parameter is a function that takes a node of type `NODE` and
-     * returns a value of type `ReturnType<C>`. It is used to determine if a node should be deleted based
-     * on its identifier. The `callback` function is optional and defaults to `this._defaultOneParam
-     * @returns an array of `BinaryTreeDeleteResult<NODE>`.
-     */
-    delete(identifier, callback = this._defaultOneParamCallback) {
-      const ans = [];
-      if (identifier === null)
-        return ans;
-      const helper = (node) => {
-        let z = this._Sentinel;
-        let x, y;
-        while (node !== this._Sentinel) {
-          if (node && callback(node) === identifier) {
-            z = node;
-          }
-          if (node && identifier && callback(node) <= identifier) {
-            node = node.right;
-          } else {
-            node = node == null ? void 0 : node.left;
-          }
-        }
-        if (z === this._Sentinel) {
-          this._size--;
-          return;
-        }
-        y = z;
-        let yOriginalColor = y.color;
-        if (z.left === this._Sentinel) {
-          x = z.right;
-          this._rbTransplant(z, z.right);
-        } else if (z.right === this._Sentinel) {
-          x = z.left;
-          this._rbTransplant(z, z.left);
-        } else {
-          y = this.getLeftMost(z.right);
-          yOriginalColor = y.color;
-          x = y.right;
-          if (y.parent === z) {
-            x.parent = y;
-          } else {
-            this._rbTransplant(y, y.right);
-            y.right = z.right;
-            y.right.parent = y;
-          }
-          this._rbTransplant(z, y);
-          y.left = z.left;
-          y.left.parent = y;
-          y.color = z.color;
-        }
-        if (yOriginalColor === 0 /* BLACK */) {
-          this._fixDelete(x);
-        }
-        this._size--;
-        ans.push({ deleted: z, needBalanced: void 0 });
-      };
-      helper(this.root);
-      return ans;
-    }
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     *
-     * The function `getNode` retrieves a single node from a binary tree based on a given identifier and
+     * The `getNode` function retrieves a node from a Red-Black Tree based on the provided identifier and
      * callback function.
-     * @param {ReturnType<C> | undefined} identifier - The `identifier` parameter is the value used to
-     * identify the node you want to retrieve. It can be of any type that is the return type of the `C`
-     * callback function. If the `identifier` is `undefined`, it means you want to retrieve the first
-     * node that matches the other criteria
+     * @param {ReturnType<C> | undefined} identifier - The `identifier` parameter is the value or key
+     * that you want to search for in the binary search tree. It can be of any type that is compatible
+     * with the type of nodes in the tree.
      * @param {C} callback - The `callback` parameter is a function that will be called for each node in
-     * the binary tree. It is used to determine if a node matches the given identifier. The `callback`
-     * function should take a single parameter of type `NODE` (the type of the nodes in the binary tree) and
-     * @param {K | NODE | undefined} beginRoot - The `beginRoot` parameter is the starting point for
-     * searching for a node in a binary tree. It can be either a key value or a node object. If it is not
-     * provided, the search will start from the root of the binary tree.
-     * @param iterationType - The `iterationType` parameter is a variable that determines the type of
-     * iteration to be performed when searching for nodes in the binary tree. It is used in the
-     * `getNodes` method, which is called within the `getNode` method.
-     * @returns a value of type `NODE`, `null`, or `undefined`.
+     * the tree. It is used to determine whether a node matches the given identifier. The `callback`
+     * function should take a node as its parameter and return a value that can be compared to the
+     * `identifier` parameter.
+     * @param beginRoot - The `beginRoot` parameter is the starting point for the search in the binary
+     * search tree. It can be either a key or a node. If it is a key, it will be converted to a node
+     * using the `ensureNode` method. If it is not provided, the `root`
+     * @param iterationType - The `iterationType` parameter is used to specify the type of iteration to
+     * be performed when searching for nodes in the binary search tree. It is an optional parameter and
+     * its default value is taken from the `iterationType` property of the class.
+     * @returns The method is returning a value of type `NODE | null | undefined`.
      */
     getNode(identifier, callback = this._defaultOneParamCallback, beginRoot = this.root, iterationType = this.iterationType) {
       var _a;
@@ -11728,10 +11351,11 @@ var dataStructureTyped = (() => {
      * Time Complexity: O(1)
      * Space Complexity: O(1)
      *
-     * The "clear" function sets the root node to the sentinel node and resets the size to 0.
+     * The "clear" function sets the root node of a data structure to a sentinel value and resets the
+     * size counter to zero.
      */
     clear() {
-      this._root = this._Sentinel;
+      this._root = this.SENTINEL;
       this._size = 0;
     }
     /**
@@ -11742,27 +11366,102 @@ var dataStructureTyped = (() => {
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
      *
-     * The function returns the predecessor of a given node in a red-black tree.
-     * @param {RedBlackTreeNode} x - The parameter `x` is of type `RedBlackTreeNode`, which represents a node in a
-     * Red-Black Tree.
-     * @returns the predecessor of the given RedBlackTreeNode 'x'.
+     * The function adds a new node to a Red-Black Tree data structure and returns a boolean indicating
+     * whether the operation was successful.
+     * @param keyOrNodeOrEntry - The `keyOrNodeOrEntry` parameter can be either a key, a node, or an
+     * entry.
+     * @param {V} [value] - The `value` parameter is the value associated with the key that is being
+     * added to the tree.
+     * @returns The method is returning a boolean value. It returns true if the node was successfully
+     * added or updated, and false otherwise.
+     */
+    add(keyOrNodeOrEntry, value) {
+      const newNode = this.keyValueOrEntryToNode(keyOrNodeOrEntry, value);
+      if (!this.isRealNode(newNode))
+        return false;
+      const insertStatus = this._insert(newNode);
+      if (insertStatus === "inserted") {
+        if (this.isRealNode(this._root)) {
+          this._root.color = 0 /* BLACK */;
+        } else {
+          return false;
+        }
+        this._size++;
+        return true;
+      } else
+        return insertStatus === "updated";
+    }
+    /**
+     * Time Complexity: O(log n)
+     * Space Complexity: O(1)
+     */
+    /**
+     * Time Complexity: O(log n)
+     * Space Complexity: O(1)
+     *
+     * The function `delete` in a binary tree class deletes a node from the tree and fixes the tree if
+     * necessary.
+     * @param {ReturnType<C> | null | undefined} identifier - The `identifier` parameter is the
+     * identifier of the node that needs to be deleted from the binary tree. It can be of any type that
+     * is returned by the callback function `C`. It can also be `null` or `undefined` if the node to be
+     * deleted is not found.
+     * @param {C} callback - The `callback` parameter is a function that is used to retrieve a node from
+     * the binary tree based on its identifier. It is an optional parameter and if not provided, the
+     * `_defaultOneParamCallback` function is used as the default callback. The callback function should
+     * return the identifier of the node to
+     * @returns an array of BinaryTreeDeleteResult<NODE> objects.
      */
-    getPredecessor(x) {
-      if (this.isRealNode(x.left)) {
-        return this.getRightMost(x.left);
+    delete(identifier, callback = this._defaultOneParamCallback) {
+      if (identifier === null)
+        return [];
+      const results = [];
+      const nodeToDelete = this.isRealNode(identifier) ? identifier : this.getNode(identifier, callback);
+      if (!nodeToDelete) {
+        return results;
+      }
+      let originalColor = nodeToDelete.color;
+      let replacementNode;
+      if (!this.isRealNode(nodeToDelete.left)) {
+        replacementNode = nodeToDelete.right;
+        this._transplant(nodeToDelete, nodeToDelete.right);
+      } else if (!this.isRealNode(nodeToDelete.right)) {
+        replacementNode = nodeToDelete.left;
+        this._transplant(nodeToDelete, nodeToDelete.left);
+      } else {
+        const successor = this.getLeftMost(nodeToDelete.right);
+        if (successor) {
+          originalColor = successor.color;
+          replacementNode = successor.right;
+          if (successor.parent === nodeToDelete) {
+            if (this.isRealNode(replacementNode)) {
+              replacementNode.parent = successor;
+            }
+          } else {
+            this._transplant(successor, successor.right);
+            successor.right = nodeToDelete.right;
+            if (this.isRealNode(successor.right)) {
+              successor.right.parent = successor;
+            }
+          }
+          this._transplant(nodeToDelete, successor);
+          successor.left = nodeToDelete.left;
+          if (this.isRealNode(successor.left)) {
+            successor.left.parent = successor;
+          }
+          successor.color = nodeToDelete.color;
+        }
       }
-      let y = x.parent;
-      while (this.isRealNode(y) && x === y.left) {
-        x = y;
-        y = y.parent;
+      this._size--;
+      if (originalColor === 0 /* BLACK */) {
+        this._deleteFixup(replacementNode);
       }
-      return y;
+      results.push({ deleted: nodeToDelete, needBalanced: void 0 });
+      return results;
     }
     /**
-     * The function sets the root node of a tree structure and updates the parent property of the new
-     * root node.
-     * @param {NODE} v - The parameter "v" is of type "NODE", which represents a node in a data
-     * structure.
+     * The function sets the root of a tree-like structure and updates the parent property of the new
+     * root.
+     * @param {NODE | undefined} v - v is a parameter of type NODE or undefined.
      */
     _setRoot(v) {
       if (v) {
@@ -11778,28 +11477,61 @@ var dataStructureTyped = (() => {
      * Time Complexity: O(1)
      * Space Complexity: O(1)
      *
-     * The function performs a left rotation on a binary tree node.
-     * @param {RedBlackTreeNode} x - The parameter `x` is of type `NODE`, which likely represents a node in a binary tree.
+     * The function replaces an old node with a new node while preserving the color of the old node.
+     * @param {NODE} oldNode - The `oldNode` parameter represents the node that needs to be replaced in
+     * the data structure.
+     * @param {NODE} newNode - The `newNode` parameter is the new node that will replace the old node in
+     * the data structure.
+     * @returns The method is returning the result of calling the `_replaceNode` method from the
+     * superclass, with the `oldNode` and `newNode` parameters.
      */
-    _leftRotate(x) {
-      if (x.right) {
-        const y = x.right;
-        x.right = y.left;
-        if (y.left !== this._Sentinel) {
-          if (y.left)
-            y.left.parent = x;
-        }
-        y.parent = x.parent;
-        if (x.parent === void 0) {
-          this._setRoot(y);
-        } else if (x === x.parent.left) {
-          x.parent.left = y;
+    _replaceNode(oldNode, newNode) {
+      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)
+     *
+     * The `_insert` function inserts or updates a node in a binary search tree and performs necessary
+     * fix-ups to maintain the red-black tree properties.
+     * @param {NODE} node - The `node` parameter represents the node that needs to be inserted into a
+     * binary search tree. It contains a `key` property that is used to determine the position of the
+     * node in the tree.
+     * @returns {'inserted' | 'updated'} - The result of the insertion.
+     */
+    _insert(node) {
+      var _a, _b;
+      let current = this.root;
+      let parent = void 0;
+      while (this.isRealNode(current)) {
+        parent = current;
+        if (node.key < current.key) {
+          current = (_a = current.left) != null ? _a : this.SENTINEL;
+        } else if (node.key > current.key) {
+          current = (_b = current.right) != null ? _b : this.SENTINEL;
         } else {
-          x.parent.right = y;
+          this._replaceNode(current, node);
+          return "updated";
         }
-        y.left = x;
-        x.parent = y;
       }
+      node.parent = parent;
+      if (!parent) {
+        this._setRoot(node);
+      } else if (node.key < parent.key) {
+        parent.left = node;
+      } else {
+        parent.right = node;
+      }
+      node.left = this.SENTINEL;
+      node.right = this.SENTINEL;
+      node.color = 1 /* RED */;
+      this._insertFixup(node);
+      return "inserted";
     }
     /**
      * Time Complexity: O(1)
@@ -11809,28 +11541,21 @@ var dataStructureTyped = (() => {
      * Time Complexity: O(1)
      * Space Complexity: O(1)
      *
-     * The function performs a right rotation on a red-black tree node.
-     * @param {RedBlackTreeNode} x - x is a RedBlackTreeNode, which represents the node that needs to be right
-     * rotated.
+     * The function `_transplant` is used to replace a node `u` with another node `v` in a binary tree.
+     * @param {NODE} u - The parameter "u" represents a node in a binary tree.
+     * @param {NODE | undefined} v - The parameter `v` is of type `NODE | undefined`, which means it can
+     * either be a `NODE` object or `undefined`.
      */
-    _rightRotate(x) {
-      if (x.left) {
-        const y = x.left;
-        x.left = y.right;
-        if (y.right !== this._Sentinel) {
-          if (y.right)
-            y.right.parent = x;
-        }
-        y.parent = x.parent;
-        if (x.parent === void 0) {
-          this._setRoot(y);
-        } else if (x === x.parent.right) {
-          x.parent.right = y;
-        } else {
-          x.parent.left = y;
-        }
-        y.right = x;
-        x.parent = y;
+    _transplant(u, v) {
+      if (!u.parent) {
+        this._setRoot(v);
+      } else if (u === u.parent.left) {
+        u.parent.left = v;
+      } else {
+        u.parent.right = v;
+      }
+      if (v) {
+        v.parent = u.parent;
       }
     }
     /**
@@ -11841,55 +11566,53 @@ var dataStructureTyped = (() => {
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
      *
-     * The `_fixInsert` function is used to fix the red-black tree after an insertion operation.
-     * @param {RedBlackTreeNode} k - The parameter `k` is a RedBlackTreeNode object, which represents a node in a
-     * red-black tree.
-     */
-    _fixInsert(k) {
-      let u;
-      while (k.parent && k.parent.color === 1 /* RED */) {
-        if (k.parent.parent && k.parent === k.parent.parent.right) {
-          u = k.parent.parent.left;
-          if (u && u.color === 1 /* RED */) {
-            k.parent.color = 0 /* BLACK */;
-            u.color = 0 /* BLACK */;
-            k.parent.parent.color = 1 /* RED */;
-            k = k.parent.parent;
+     * The `_insertFixup` function is used to fix the Red-Black Tree after inserting a new node.
+     * @param {NODE | undefined} z - The parameter `z` represents a node in the Red-Black Tree. It can
+     * either be a valid node object or `undefined`.
+     */
+    _insertFixup(z) {
+      var _a, _b, _c, _d;
+      while (((_a = z == null ? void 0 : z.parent) == null ? void 0 : _a.color) === 1 /* RED */) {
+        if (z.parent === ((_b = z.parent.parent) == null ? void 0 : _b.left)) {
+          const y = z.parent.parent.right;
+          if ((y == null ? void 0 : y.color) === 1 /* RED */) {
+            z.parent.color = 0 /* BLACK */;
+            y.color = 0 /* BLACK */;
+            z.parent.parent.color = 1 /* RED */;
+            z = z.parent.parent;
           } else {
-            if (k === k.parent.left) {
-              k = k.parent;
-              this._rightRotate(k);
+            if (z === z.parent.right) {
+              z = z.parent;
+              this._leftRotate(z);
             }
-            if (k.parent.color === 1 /* RED */) {
-              k.parent.color = 0 /* BLACK */;
-              k.parent.parent.color = 1 /* RED */;
+            if (z && this.isRealNode(z.parent) && this.isRealNode(z.parent.parent)) {
+              z.parent.color = 0 /* BLACK */;
+              z.parent.parent.color = 1 /* RED */;
+              this._rightRotate(z.parent.parent);
             }
-            this._leftRotate(k.parent.parent);
           }
         } else {
-          u = k.parent.parent.right;
-          if (u && u.color === 1 /* RED */) {
-            k.parent.color = 0 /* BLACK */;
-            u.color = 0 /* BLACK */;
-            k.parent.parent.color = 1 /* RED */;
-            k = k.parent.parent;
+          const y = (_d = (_c = z == null ? void 0 : z.parent) == null ? void 0 : _c.parent) == null ? void 0 : _d.left;
+          if ((y == null ? void 0 : y.color) === 1 /* RED */) {
+            z.parent.color = 0 /* BLACK */;
+            y.color = 0 /* BLACK */;
+            z.parent.parent.color = 1 /* RED */;
+            z = z.parent.parent;
           } else {
-            if (k === k.parent.right) {
-              k = k.parent;
-              this._leftRotate(k);
+            if (z === z.parent.left) {
+              z = z.parent;
+              this._rightRotate(z);
             }
-            if (k.parent.color === 1 /* RED */) {
-              k.parent.color = 0 /* BLACK */;
-              k.parent.parent.color = 1 /* RED */;
+            if (z && this.isRealNode(z.parent) && this.isRealNode(z.parent.parent)) {
+              z.parent.color = 0 /* BLACK */;
+              z.parent.parent.color = 1 /* RED */;
+              this._leftRotate(z.parent.parent);
             }
-            this._rightRotate(k.parent.parent);
           }
         }
-        if (k === this.root) {
-          break;
-        }
       }
-      this.root.color = 0 /* BLACK */;
+      if (this.isRealNode(this._root))
+        this._root.color = 0 /* BLACK */;
     }
     /**
      * Time Complexity: O(log n)
@@ -11899,69 +11622,75 @@ var dataStructureTyped = (() => {
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
      *
-     * The function `_fixDelete` is used to fix the red-black tree after a node deletion.
-     * @param {RedBlackTreeNode} x - The parameter `x` represents a node in a Red-Black Tree (RBT).
+     * The `_deleteFixup` function is used to fix the red-black tree after a node deletion by adjusting
+     * the colors and performing rotations.
+     * @param {NODE | undefined} node - The `node` parameter represents a node in a Red-Black Tree data
+     * structure. It can be either a valid node object or `undefined`.
+     * @returns The function does not return any value. It has a return type of `void`.
      */
-    _fixDelete(x) {
-      let s;
-      while (x !== this.root && x.color === 0 /* BLACK */) {
-        if (x.parent && x === x.parent.left) {
-          s = x.parent.right;
-          if (s.color === 1) {
-            s.color = 0 /* BLACK */;
-            x.parent.color = 1 /* RED */;
-            this._leftRotate(x.parent);
-            s = x.parent.right;
+    _deleteFixup(node) {
+      var _a, _b, _c, _d;
+      if (!node || node === this.root || node.color === 0 /* BLACK */) {
+        if (node) {
+          node.color = 0 /* BLACK */;
+        }
+        return;
+      }
+      while (node && node !== this.root && node.color === 0 /* BLACK */) {
+        const parent = node.parent;
+        if (!parent) {
+          break;
+        }
+        if (node === parent.left) {
+          let sibling = parent.right;
+          if ((sibling == null ? void 0 : sibling.color) === 1 /* RED */) {
+            sibling.color = 0 /* BLACK */;
+            parent.color = 1 /* RED */;
+            this._leftRotate(parent);
+            sibling = parent.right;
           }
-          if (s.left !== void 0 && s.left.color === 0 /* BLACK */ && s.right && s.right.color === 0 /* BLACK */) {
-            s.color = 1 /* RED */;
-            x = x.parent;
+          if (((_b = (_a = sibling == null ? void 0 : sibling.left) == null ? void 0 : _a.color) != null ? _b : 0 /* BLACK */) === 0 /* BLACK */) {
+            if (sibling)
+              sibling.color = 1 /* RED */;
+            node = parent;
           } else {
-            if (s.right && s.right.color === 0 /* BLACK */) {
-              if (s.left)
-                s.left.color = 0 /* BLACK */;
-              s.color = 1 /* RED */;
-              this._rightRotate(s);
-              s = x.parent.right;
-            }
-            if (s)
-              s.color = x.parent.color;
-            x.parent.color = 0 /* BLACK */;
-            if (s && s.right)
-              s.right.color = 0 /* BLACK */;
-            this._leftRotate(x.parent);
-            x = this.root;
+            if (sibling == null ? void 0 : sibling.left)
+              sibling.left.color = 0 /* BLACK */;
+            if (sibling)
+              sibling.color = parent.color;
+            parent.color = 0 /* BLACK */;
+            this._rightRotate(parent);
+            node = this.root;
           }
         } else {
-          s = x.parent.left;
-          if (s.color === 1) {
-            s.color = 0 /* BLACK */;
-            x.parent.color = 1 /* RED */;
-            this._rightRotate(x.parent);
-            s = x.parent.left;
+          let sibling = parent.left;
+          if ((sibling == null ? void 0 : sibling.color) === 1 /* RED */) {
+            sibling.color = 0 /* BLACK */;
+            if (parent)
+              parent.color = 1 /* RED */;
+            this._rightRotate(parent);
+            if (parent)
+              sibling = parent.left;
           }
-          if (s && s.right && s.right.color === 0 /* BLACK */ && s.right.color === 0 /* BLACK */) {
-            s.color = 1 /* RED */;
-            x = x.parent;
+          if (((_d = (_c = sibling == null ? void 0 : sibling.right) == null ? void 0 : _c.color) != null ? _d : 0 /* BLACK */) === 0 /* BLACK */) {
+            if (sibling)
+              sibling.color = 1 /* RED */;
+            node = parent;
           } else {
-            if (s && s.left && s.left.color === 0 /* BLACK */) {
-              if (s.right)
-                s.right.color = 0 /* BLACK */;
-              s.color = 1 /* RED */;
-              this._leftRotate(s);
-              s = x.parent.left;
-            }
-            if (s)
-              s.color = x.parent.color;
-            x.parent.color = 0 /* BLACK */;
-            if (s && s.left)
-              s.left.color = 0 /* BLACK */;
-            this._rightRotate(x.parent);
-            x = this.root;
+            if (sibling == null ? void 0 : sibling.right)
+              sibling.right.color = 0 /* BLACK */;
+            if (sibling)
+              sibling.color = parent.color;
+            if (parent)
+              parent.color = 0 /* BLACK */;
+            this._leftRotate(parent);
+            node = this.root;
           }
         }
       }
-      x.color = 0 /* BLACK */;
+      if (node) {
+        node.color = 0 /* BLACK */;
+      }
     }
     /**
      * Time Complexity: O(1)
@@ -11971,32 +11700,63 @@ var dataStructureTyped = (() => {
      * Time Complexity: O(1)
      * Space Complexity: O(1)
      *
-     * The function `_rbTransplant` replaces one node in a red-black tree with another node.
-     * @param {RedBlackTreeNode} u - The parameter "u" represents a RedBlackTreeNode object.
-     * @param {RedBlackTreeNode} v - The parameter "v" is a RedBlackTreeNode object.
+     * The `_leftRotate` function performs a left rotation on a given node in a binary tree.
+     * @param {NODE | undefined} x - The parameter `x` is of type `NODE | undefined`. It represents a
+     * node in a binary tree or `undefined` if there is no node.
+     * @returns void, which means it does not return any value.
      */
-    _rbTransplant(u, v) {
-      if (u.parent === void 0) {
-        this._setRoot(v);
-      } else if (u === u.parent.left) {
-        u.parent.left = v;
+    _leftRotate(x) {
+      if (!x || !x.right) {
+        return;
+      }
+      const y = x.right;
+      x.right = y.left;
+      if (this.isRealNode(y.left)) {
+        y.left.parent = x;
+      }
+      y.parent = x.parent;
+      if (!x.parent) {
+        this._setRoot(y);
+      } else if (x === x.parent.left) {
+        x.parent.left = y;
       } else {
-        u.parent.right = v;
+        x.parent.right = y;
       }
-      v.parent = u.parent;
+      y.left = x;
+      x.parent = y;
     }
     /**
-     * The function replaces an old node with a new node while preserving the color of the old node.
-     * @param {NODE} oldNode - The `oldNode` parameter represents the node that needs to be replaced in a
-     * data structure. It is of type `NODE`, which is the type of the nodes in the data structure.
-     * @param {NODE} newNode - The `newNode` parameter is the node that will replace the `oldNode` in the
-     * data structure.
-     * @returns The method is returning the result of calling the `_replaceNode` method from the
-     * superclass, passing in the `oldNode` and `newNode` as arguments.
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
      */
-    _replaceNode(oldNode, newNode) {
-      newNode.color = oldNode.color;
-      return super._replaceNode(oldNode, newNode);
+    /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     *
+     * The `_rightRotate` function performs a right rotation on a given node in a binary tree.
+     * @param {NODE | undefined} y - The parameter `y` is of type `NODE | undefined`. It represents a
+     * node in a binary tree or `undefined` if there is no node.
+     * @returns void, which means it does not return any value.
+     */
+    _rightRotate(y) {
+      if (!y || !y.left) {
+        return;
+      }
+      const x = y.left;
+      y.left = x.right;
+      if (this.isRealNode(x.right)) {
+        x.right.parent = y;
+      }
+      x.parent = y.parent;
+      if (!y.parent) {
+        this._setRoot(x);
+      } else if (y === y.parent.left) {
+        y.parent.left = x;
+      } else {
+        y.parent.right = x;
+      }
+      x.right = y;
+      y.parent = x;
     }
   };
 
@@ -12403,6 +12163,9 @@ var dataStructureTyped = (() => {
      * @returns the sum of the count property of all nodes in the tree.
      */
     get count() {
+      return this._count;
+    }
+    getMutableCount() {
       let sum = 0;
       this.dfs((node) => sum += node.count);
       return sum;
@@ -12495,14 +12258,14 @@ var dataStructureTyped = (() => {
      */
     add(keyOrNodeOrEntry, value, count = 1) {
       const newNode = this.keyValueOrEntryToNode(keyOrNodeOrEntry, value, count);
-      if (newNode === void 0)
+      const orgCount = (newNode == null ? void 0 : newNode.count) || 0;
+      const isSuccessAdded = super.add(newNode);
+      if (isSuccessAdded) {
+        this._count += orgCount;
+        return true;
+      } else {
         return false;
-      const orgNodeCount = (newNode == null ? void 0 : newNode.count) || 0;
-      const inserted = super.add(newNode);
-      if (inserted) {
-        this._count += orgNodeCount;
       }
-      return true;
     }
     /**
      * Time Complexity: O(log n)
@@ -12529,63 +12292,83 @@ var dataStructureTyped = (() => {
      * @returns an array of BinaryTreeDeleteResult<NODE> objects.
      */
     delete(identifier, callback = this._defaultOneParamCallback, ignoreCount = false) {
-      const deleteResults = [];
       if (identifier === null)
-        return deleteResults;
-      const deleteHelper = (node) => {
-        let targetNode = this._Sentinel;
-        let currentNode;
-        while (node !== this._Sentinel) {
-          if (node && callback(node) === identifier) {
-            targetNode = node;
-          }
-          if (node && identifier && callback(node) <= identifier) {
-            node = node.right;
-          } else {
-            node = node == null ? void 0 : node.left;
-          }
-        }
-        if (targetNode === this._Sentinel) {
-          return;
+        return [];
+      const results = [];
+      const nodeToDelete = this.isRealNode(identifier) ? identifier : this.getNode(identifier, callback);
+      if (!nodeToDelete) {
+        return results;
+      }
+      let originalColor = nodeToDelete.color;
+      let replacementNode;
+      if (!this.isRealNode(nodeToDelete.left)) {
+        replacementNode = nodeToDelete.right;
+        if (ignoreCount || nodeToDelete.count <= 1) {
+          this._transplant(nodeToDelete, nodeToDelete.right);
+          this._count -= nodeToDelete.count;
+        } else {
+          nodeToDelete.count--;
+          this._count--;
+          results.push({ deleted: nodeToDelete, needBalanced: void 0 });
+          return results;
+        }
+      } else if (!this.isRealNode(nodeToDelete.right)) {
+        replacementNode = nodeToDelete.left;
+        if (ignoreCount || nodeToDelete.count <= 1) {
+          this._transplant(nodeToDelete, nodeToDelete.left);
+          this._count -= nodeToDelete.count;
+        } else {
+          nodeToDelete.count--;
+          this._count--;
+          results.push({ deleted: nodeToDelete, needBalanced: void 0 });
+          return results;
         }
-        if (ignoreCount || targetNode.count <= 1) {
-          let parentNode = targetNode;
-          let parentNodeOriginalColor = parentNode.color;
-          if (targetNode.left === this._Sentinel) {
-            currentNode = targetNode.right;
-            this._rbTransplant(targetNode, targetNode.right);
-          } else if (targetNode.right === this._Sentinel) {
-            currentNode = targetNode.left;
-            this._rbTransplant(targetNode, targetNode.left);
+      } else {
+        const successor = this.getLeftMost(nodeToDelete.right);
+        if (successor) {
+          originalColor = successor.color;
+          replacementNode = successor.right;
+          if (successor.parent === nodeToDelete) {
+            if (this.isRealNode(replacementNode)) {
+              replacementNode.parent = successor;
+            }
           } else {
-            parentNode = this.getLeftMost(targetNode.right);
-            parentNodeOriginalColor = parentNode.color;
-            currentNode = parentNode.right;
-            if (parentNode.parent === targetNode) {
-              currentNode.parent = parentNode;
+            if (ignoreCount || nodeToDelete.count <= 1) {
+              this._transplant(successor, successor.right);
+              this._count -= nodeToDelete.count;
             } else {
-              this._rbTransplant(parentNode, parentNode.right);
-              parentNode.right = targetNode.right;
-              parentNode.right.parent = parentNode;
+              nodeToDelete.count--;
+              this._count--;
+              results.push({ deleted: nodeToDelete, needBalanced: void 0 });
+              return results;
+            }
+            successor.right = nodeToDelete.right;
+            if (this.isRealNode(successor.right)) {
+              successor.right.parent = successor;
             }
-            this._rbTransplant(targetNode, parentNode);
-            parentNode.left = targetNode.left;
-            parentNode.left.parent = parentNode;
-            parentNode.color = targetNode.color;
           }
-          if (parentNodeOriginalColor === 0 /* BLACK */) {
-            this._fixDelete(currentNode);
+          if (ignoreCount || nodeToDelete.count <= 1) {
+            this._transplant(nodeToDelete, successor);
+            this._count -= nodeToDelete.count;
+          } else {
+            nodeToDelete.count--;
+            this._count--;
+            results.push({ deleted: nodeToDelete, needBalanced: void 0 });
+            return results;
           }
-          this._size--;
-          this._count -= targetNode.count;
-          deleteResults.push({ deleted: targetNode, needBalanced: void 0 });
-        } else {
-          targetNode.count--;
-          this._count--;
+          successor.left = nodeToDelete.left;
+          if (this.isRealNode(successor.left)) {
+            successor.left.parent = successor;
+          }
+          successor.color = nodeToDelete.color;
         }
-      };
-      deleteHelper(this.root);
-      return deleteResults;
+      }
+      this._size--;
+      if (originalColor === 0 /* BLACK */) {
+        this._deleteFixup(replacementNode);
+      }
+      results.push({ deleted: nodeToDelete, needBalanced: void 0 });
+      return results;
     }
     /**
      * Time Complexity: O(1)