data-structure-typed 1.48.9 → 1.49.1

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

@@ -444,80 +444,6 @@ var dataStructureTyped = (() => {
   __publicField(_HashTable, "LOAD_FACTOR", 0.75);
   var HashTable = _HashTable;
 
-  // src/utils/utils.ts
-  var uuidV4 = function() {
-    return "xxxxxxxx-xxxx-xxxx-xxxx-xxxxxxxxxxxx".replace(/[x]/g, function(c) {
-      const r = Math.random() * 16 | 0, v = c == "x" ? r : r & 3 | 8;
-      return v.toString(16);
-    });
-  };
-  var arrayRemove = function(array, predicate) {
-    let i = -1, len = array ? array.length : 0;
-    const result = [];
-    while (++i < len) {
-      const value = array[i];
-      if (predicate(value, i, array)) {
-        result.push(value);
-        Array.prototype.splice.call(array, i--, 1);
-        len--;
-      }
-    }
-    return result;
-  };
-  var THUNK_SYMBOL = Symbol("thunk");
-  var isThunk = (fnOrValue) => {
-    return typeof fnOrValue === "function" && fnOrValue.__THUNK__ === THUNK_SYMBOL;
-  };
-  var toThunk = (fn) => {
-    const thunk = () => fn();
-    thunk.__THUNK__ = THUNK_SYMBOL;
-    return thunk;
-  };
-  var trampoline = (fn) => {
-    const cont = (...args) => toThunk(() => fn(...args));
-    return Object.assign(
-      (...args) => {
-        let result = fn(...args);
-        while (isThunk(result) && typeof result === "function") {
-          result = result();
-        }
-        return result;
-      },
-      { cont }
-    );
-  };
-  var trampolineAsync = (fn) => {
-    const cont = (...args) => toThunk(() => fn(...args));
-    return Object.assign(
-      (...args) => __async(void 0, null, function* () {
-        let result = yield fn(...args);
-        while (isThunk(result) && typeof result === "function") {
-          result = yield result();
-        }
-        return result;
-      }),
-      { cont }
-    );
-  };
-  var getMSB = (value) => {
-    if (value <= 0) {
-      return 0;
-    }
-    return 1 << 31 - Math.clz32(value);
-  };
-  var rangeCheck = (index, min, max, message = "Index out of bounds.") => {
-    if (index < min || index > max)
-      throw new RangeError(message);
-  };
-  var throwRangeError = (message = "The value is off-limits.") => {
-    throw new RangeError(message);
-  };
-  var isWeakKey = (input) => {
-    const inputType = typeof input;
-    return inputType === "object" && input !== null || inputType === "function";
-  };
-  var calcMinUnitsRequired = (totalQuantity, unitSize) => Math.floor((totalQuantity + unitSize - 1) / unitSize);
-
   // src/data-structures/base/iterable-base.ts
   var IterableEntryBase = class {
     /**
@@ -827,6 +753,80 @@ var dataStructureTyped = (() => {
     }
   };
 
+  // src/utils/utils.ts
+  var uuidV4 = function() {
+    return "xxxxxxxx-xxxx-xxxx-xxxx-xxxxxxxxxxxx".replace(/[x]/g, function(c) {
+      const r = Math.random() * 16 | 0, v = c == "x" ? r : r & 3 | 8;
+      return v.toString(16);
+    });
+  };
+  var arrayRemove = function(array, predicate) {
+    let i = -1, len = array ? array.length : 0;
+    const result = [];
+    while (++i < len) {
+      const value = array[i];
+      if (predicate(value, i, array)) {
+        result.push(value);
+        Array.prototype.splice.call(array, i--, 1);
+        len--;
+      }
+    }
+    return result;
+  };
+  var THUNK_SYMBOL = Symbol("thunk");
+  var isThunk = (fnOrValue) => {
+    return typeof fnOrValue === "function" && fnOrValue.__THUNK__ === THUNK_SYMBOL;
+  };
+  var toThunk = (fn) => {
+    const thunk = () => fn();
+    thunk.__THUNK__ = THUNK_SYMBOL;
+    return thunk;
+  };
+  var trampoline = (fn) => {
+    const cont = (...args) => toThunk(() => fn(...args));
+    return Object.assign(
+      (...args) => {
+        let result = fn(...args);
+        while (isThunk(result) && typeof result === "function") {
+          result = result();
+        }
+        return result;
+      },
+      { cont }
+    );
+  };
+  var trampolineAsync = (fn) => {
+    const cont = (...args) => toThunk(() => fn(...args));
+    return Object.assign(
+      (...args) => __async(void 0, null, function* () {
+        let result = yield fn(...args);
+        while (isThunk(result) && typeof result === "function") {
+          result = yield result();
+        }
+        return result;
+      }),
+      { cont }
+    );
+  };
+  var getMSB = (value) => {
+    if (value <= 0) {
+      return 0;
+    }
+    return 1 << 31 - Math.clz32(value);
+  };
+  var rangeCheck = (index, min, max, message = "Index out of bounds.") => {
+    if (index < min || index > max)
+      throw new RangeError(message);
+  };
+  var throwRangeError = (message = "The value is off-limits.") => {
+    throw new RangeError(message);
+  };
+  var isWeakKey = (input) => {
+    const inputType = typeof input;
+    return inputType === "object" && input !== null || inputType === "function";
+  };
+  var calcMinUnitsRequired = (totalQuantity, unitSize) => Math.floor((totalQuantity + unitSize - 1) / unitSize);
+
   // src/data-structures/hash/hash-map.ts
   var HashMap = class _HashMap extends IterableEntryBase {
     /**
@@ -1171,6 +1171,13 @@ var dataStructureTyped = (() => {
         return hash in this._noObjMap;
       }
     }
+    hasValue(value) {
+      for (const [, elementValue] of this) {
+        if (elementValue === value)
+          return true;
+      }
+      return false;
+    }
     setMany(entries) {
       for (const entry of entries) {
         const [key, value] = entry;
@@ -3157,7 +3164,7 @@ var dataStructureTyped = (() => {
     pop() {
       if (this.isEmpty())
         return void 0;
-      return this.elements.pop() || void 0;
+      return this.elements.pop();
     }
     /**
      * Time Complexity: O(n)
@@ -3414,7 +3421,7 @@ var dataStructureTyped = (() => {
      * @param {E} value - The value parameter represents the value that you want to add to the queue.
      */
     enqueue(value) {
-      this.push(value);
+      return this.push(value);
     }
     /**
      * Time Complexity: O(n) - same as shift().
@@ -5175,43 +5182,6 @@ var dataStructureTyped = (() => {
     }
   };
 
-  // src/data-structures/priority-queue/priority-queue.ts
-  var PriorityQueue = class extends Heap {
-    constructor(elements, options) {
-      super(elements, options);
-    }
-  };
-
-  // src/data-structures/priority-queue/min-priority-queue.ts
-  var MinPriorityQueue = class extends PriorityQueue {
-    constructor(elements, options = {
-      comparator: (a, b) => {
-        if (!(typeof a === "number" && typeof b === "number")) {
-          throw new Error("The a, b params of compare function must be number");
-        } else {
-          return a - b;
-        }
-      }
-    }) {
-      super(elements, options);
-    }
-  };
-
-  // src/data-structures/priority-queue/max-priority-queue.ts
-  var MaxPriorityQueue = class extends PriorityQueue {
-    constructor(elements, options = {
-      comparator: (a, b) => {
-        if (!(typeof a === "number" && typeof b === "number")) {
-          throw new Error("The a, b params of compare function must be number");
-        } else {
-          return b - a;
-        }
-      }
-    }) {
-      super(elements, options);
-    }
-  };
-
   // src/data-structures/graph/abstract-graph.ts
   var AbstractVertex = class {
     /**
@@ -5638,13 +5608,7 @@ var dataStructureTyped = (() => {
      * shortest paths from the source vertex to all other vertexMap in the graph. If `genPaths
      * @returns The function `dijkstraWithoutHeap` returns an object of type `DijkstraResult<VO>`.
      */
-    dijkstraWithoutHeap(src, dest, getMinDist, genPaths) {
-      if (getMinDist === void 0)
-        getMinDist = false;
-      if (genPaths === void 0)
-        genPaths = false;
-      if (dest === void 0)
-        dest = void 0;
+    dijkstraWithoutHeap(src, dest = void 0, getMinDist = false, genPaths = false) {
       let minDist = Infinity;
       let minDest = void 0;
       let minPath = [];
@@ -5771,14 +5735,8 @@ var dataStructureTyped = (() => {
      * shortest paths from the source vertex to all other vertexMap in the graph. If `genPaths
      * @returns The function `dijkstra` returns an object of type `DijkstraResult<VO>`.
      */
-    dijkstra(src, dest, getMinDist, genPaths) {
+    dijkstra(src, dest = void 0, getMinDist = false, genPaths = false) {
       var _a;
-      if (getMinDist === void 0)
-        getMinDist = false;
-      if (genPaths === void 0)
-        genPaths = false;
-      if (dest === void 0)
-        dest = void 0;
       let minDist = Infinity;
       let minDest = void 0;
       let minPath = [];
@@ -5796,7 +5754,7 @@ var dataStructureTyped = (() => {
         if (vertexOrKey instanceof AbstractVertex)
           distMap.set(vertexOrKey, Infinity);
       }
-      const heap = new PriorityQueue([], { comparator: (a, b) => a.key - b.key });
+      const heap = new Heap([], { comparator: (a, b) => a.key - b.key });
       heap.add({ key: 0, value: srcVertex });
       distMap.set(srcVertex, 0);
       preMap.set(srcVertex, void 0);
@@ -6152,13 +6110,27 @@ var dataStructureTyped = (() => {
       }
       const cycles = /* @__PURE__ */ new Map();
       if (needCycles) {
-        let SCCs2 = /* @__PURE__ */ new Map();
-        if (SCCs2.size < 1) {
-          SCCs2 = getSCCs();
-        }
-        SCCs2.forEach((SCC, low) => {
-          if (SCC.length > 1) {
-            cycles.set(low, SCC);
+        const visitedMap = /* @__PURE__ */ new Map();
+        const stack = [];
+        const findCyclesDFS = (cur, parent) => {
+          visitedMap.set(cur, true);
+          stack.push(cur);
+          const neighbors = this.getNeighbors(cur);
+          for (const neighbor of neighbors) {
+            if (!visitedMap.get(neighbor)) {
+              findCyclesDFS(neighbor, cur);
+            } else if (stack.includes(neighbor) && neighbor !== parent) {
+              const cycleStartIndex = stack.indexOf(neighbor);
+              const cycle = stack.slice(cycleStartIndex);
+              const cycleLow = Math.min(...cycle.map((v) => dfnMap.get(v) || Infinity));
+              cycles.set(cycleLow, cycle);
+            }
+          }
+          stack.pop();
+        };
+        vertexMap.forEach((v) => {
+          if (!visitedMap.get(v)) {
+            findCyclesDFS(v, void 0);
           }
         });
       }
@@ -7285,23 +7257,6 @@ var dataStructureTyped = (() => {
     }
   };
 
-  // src/types/data-structures/binary-tree/binary-tree.ts
-  var IterationType = /* @__PURE__ */ ((IterationType3) => {
-    IterationType3["ITERATIVE"] = "ITERATIVE";
-    IterationType3["RECURSIVE"] = "RECURSIVE";
-    return IterationType3;
-  })(IterationType || {});
-  var FamilyPosition = /* @__PURE__ */ ((FamilyPosition2) => {
-    FamilyPosition2["ROOT"] = "ROOT";
-    FamilyPosition2["LEFT"] = "LEFT";
-    FamilyPosition2["RIGHT"] = "RIGHT";
-    FamilyPosition2["ROOT_LEFT"] = "ROOT_LEFT";
-    FamilyPosition2["ROOT_RIGHT"] = "ROOT_RIGHT";
-    FamilyPosition2["ISOLATED"] = "ISOLATED";
-    FamilyPosition2["MAL_NODE"] = "MAL_NODE";
-    return FamilyPosition2;
-  })(FamilyPosition || {});
-
   // src/types/data-structures/binary-tree/rb-tree.ts
   var RBTNColor = /* @__PURE__ */ ((RBTNColor2) => {
     RBTNColor2[RBTNColor2["RED"] = 1] = "RED";
@@ -7321,6 +7276,21 @@ var dataStructureTyped = (() => {
     CP2["gt"] = "gt";
     return CP2;
   })(CP || {});
+  var IterationType = /* @__PURE__ */ ((IterationType3) => {
+    IterationType3["ITERATIVE"] = "ITERATIVE";
+    IterationType3["RECURSIVE"] = "RECURSIVE";
+    return IterationType3;
+  })(IterationType || {});
+  var FamilyPosition = /* @__PURE__ */ ((FamilyPosition2) => {
+    FamilyPosition2["ROOT"] = "ROOT";
+    FamilyPosition2["LEFT"] = "LEFT";
+    FamilyPosition2["RIGHT"] = "RIGHT";
+    FamilyPosition2["ROOT_LEFT"] = "ROOT_LEFT";
+    FamilyPosition2["ROOT_RIGHT"] = "ROOT_RIGHT";
+    FamilyPosition2["ISOLATED"] = "ISOLATED";
+    FamilyPosition2["MAL_NODE"] = "MAL_NODE";
+    return FamilyPosition2;
+  })(FamilyPosition || {});
 
   // src/data-structures/binary-tree/binary-tree.ts
   var BinaryTreeNode = class {
@@ -7371,7 +7341,7 @@ var dataStructureTyped = (() => {
   var BinaryTree = class _BinaryTree extends IterableEntryBase {
     /**
      * The constructor function initializes a binary tree object with optional elements and options.
-     * @param [elements] - An optional iterable of BTNodeExemplar objects. These objects represent the
+     * @param [elements] - An optional iterable of BTNExemplar objects. These objects represent the
      * elements to be added to the binary tree.
      * @param [options] - The `options` parameter is an optional object that can contain additional
      * configuration options for the binary tree. In this case, it is of type
@@ -7428,7 +7398,7 @@ var dataStructureTyped = (() => {
     }
     /**
      * The function "isNode" checks if an exemplar is an instance of the BinaryTreeNode class.
-     * @param exemplar - The `exemplar` parameter is a variable of type `BTNodeExemplar<K, V,N>`.
+     * @param exemplar - The `exemplar` parameter is a variable of type `BTNExemplar<K, V,N>`.
      * @returns a boolean value indicating whether the exemplar is an instance of the class N.
      */
     isNode(exemplar) {
@@ -7436,7 +7406,7 @@ var dataStructureTyped = (() => {
     }
     /**
      * The function `exemplarToNode` converts an exemplar object into a node object.
-     * @param exemplar - The `exemplar` parameter is of type `BTNodeExemplar<K, V, N>`.
+     * @param exemplar - The `exemplar` parameter is of type `BTNExemplar<K, V, N>`.
      * @param {V} [value] - The `value` parameter is an optional value that can be passed to the
      * `exemplarToNode` function. It represents the value associated with the exemplar node. If no value
      * is provided, it will be `undefined`.
@@ -7468,7 +7438,7 @@ var dataStructureTyped = (() => {
     }
     /**
      * The function checks if a given value is an entry in a binary tree node.
-     * @param kne - BTNodeExemplar<K, V,N> - A generic type representing a node in a binary tree. It has
+     * @param kne - BTNExemplar<K, V,N> - A generic type representing a node in a binary tree. It has
      * two type parameters V and N, representing the value and node type respectively.
      * @returns a boolean value.
      */
@@ -7540,7 +7510,7 @@ var dataStructureTyped = (() => {
      *
      * The `addMany` function takes in a collection of nodes and an optional collection of values, and
      * adds each node with its corresponding value to the data structure.
-     * @param nodes - An iterable collection of BTNodeExemplar objects.
+     * @param nodes - An iterable collection of BTNExemplar objects.
      * @param [values] - An optional iterable of values that will be assigned to each node being added.
      * @returns The function `addMany` returns an array of `N`, `null`, or `undefined` values.
      */
@@ -7583,7 +7553,7 @@ var dataStructureTyped = (() => {
      * @param {C} callback - The `callback` parameter is a function that is used to determine the
      * identifier of the node to be deleted. It is optional and has a default value of
      * `this._defaultOneParamCallback`. The `callback` function should return the identifier of the node.
-     * @returns an array of `BiTreeDeleteResult<N>`.
+     * @returns an array of `BinaryTreeDeleteResult<N>`.
      */
     delete(identifier, callback = this._defaultOneParamCallback) {
       const deletedResult = [];
@@ -8248,7 +8218,7 @@ var dataStructureTyped = (() => {
      * @returns a boolean value.
      */
     isRealNode(node) {
-      return node instanceof BinaryTreeNode && node.key.toString() !== "NaN";
+      return node instanceof BinaryTreeNode && String(node.key) !== "NaN";
     }
     /**
      * The function checks if a given node is a BinaryTreeNode instance and has a key value of NaN.
@@ -8256,7 +8226,7 @@ var dataStructureTyped = (() => {
      * @returns a boolean value.
      */
     isNIL(node) {
-      return node instanceof BinaryTreeNode && node.key.toString() === "NaN";
+      return node instanceof BinaryTreeNode && String(node.key) === "NaN";
     }
     /**
      * The function checks if a given node is a real node or null.
@@ -8267,7 +8237,7 @@ var dataStructureTyped = (() => {
       return this.isRealNode(node) || node === null;
     }
     /**
-     * The function "isNotNodeInstance" checks if a potential key is a number.
+     * The function "isNotNodeInstance" checks if a potential key is a K.
      * @param {any} potentialKey - The potentialKey parameter is of type any, which means it can be any
      * data type.
      * @returns a boolean value indicating whether the potentialKey is of type number or not.
@@ -8535,19 +8505,23 @@ var dataStructureTyped = (() => {
       return levelsNodes;
     }
     /**
-     * The function `getPredecessor` returns the predecessor node of a given node in a binary tree.
-     * @param {K | N | null | undefined} node - The `node` parameter can be of type `K`, `N`,
-     * `null`, or `undefined`.
-     * @returns The function `getPredecessor` returns a value of type `N | undefined`.
+     * Time Complexity: O(log n)
+     * Space Complexity: O(1)
+     */
+    /**
+     * Time Complexity: O(log n)
+     * Space Complexity: O(1)
+     *
+     * The function returns the predecessor of a given node in a tree.
+     * @param {N} node - The parameter `node` is of type `RedBlackTreeNode`, which represents a node in a
+     * tree.
+     * @returns the predecessor of the given 'node'.
      */
     getPredecessor(node) {
-      node = this.ensureNode(node);
-      if (!this.isRealNode(node))
-        return void 0;
-      if (node.left) {
+      if (this.isRealNode(node.left)) {
         let predecessor = node.left;
         while (!this.isRealNode(predecessor) || this.isRealNode(predecessor.right) && predecessor.right !== node) {
-          if (predecessor) {
+          if (this.isRealNode(predecessor)) {
             predecessor = predecessor.right;
           }
         }
@@ -8564,13 +8538,13 @@ var dataStructureTyped = (() => {
      */
     getSuccessor(x) {
       x = this.ensureNode(x);
-      if (!x)
+      if (!this.isRealNode(x))
         return void 0;
-      if (x.right) {
+      if (this.isRealNode(x.right)) {
         return this.getLeftMost(x.right);
       }
       let y = x.parent;
-      while (y && y && x === y.right) {
+      while (this.isRealNode(y) && x === y.right) {
         x = y;
         y = y.parent;
       }
@@ -8985,7 +8959,7 @@ var dataStructureTyped = (() => {
     /**
      * This is the constructor function for a binary search tree class in TypeScript, which initializes
      * the tree with optional elements and options.
-     * @param [elements] - An optional iterable of BTNodeExemplar objects that will be added to the
+     * @param [elements] - An optional iterable of BTNExemplar objects that will be added to the
      * binary search tree.
      * @param [options] - The `options` parameter is an optional object that can contain additional
      * configuration options for the binary search tree. It can have the following properties:
@@ -9036,7 +9010,7 @@ var dataStructureTyped = (() => {
     }
     /**
      * The function checks if an exemplar is an instance of BSTNode.
-     * @param exemplar - The `exemplar` parameter is a variable of type `BTNodeExemplar<K, V, N>`.
+     * @param exemplar - The `exemplar` parameter is a variable of type `BTNExemplar<K, V, N>`.
      * @returns a boolean value indicating whether the exemplar is an instance of the BSTNode class.
      */
     isNode(exemplar) {
@@ -9045,7 +9019,7 @@ var dataStructureTyped = (() => {
     /**
      * The function `exemplarToNode` takes an exemplar and returns a node if the exemplar is valid,
      * otherwise it returns undefined.
-     * @param exemplar - The `exemplar` parameter is of type `BTNodeExemplar<K, V, N>`, where:
+     * @param exemplar - The `exemplar` parameter is of type `BTNExemplar<K, V, N>`, where:
      * @param {V} [value] - The `value` parameter is an optional value that can be passed to the
      * `exemplarToNode` function. It represents the value associated with the exemplar node.
      * @returns a node of type N or undefined.
@@ -9299,6 +9273,15 @@ var dataStructureTyped = (() => {
         }
       }
     }
+    /**
+     * The function "isNotNodeInstance" checks if a potential key is a K.
+     * @param {any} potentialKey - The potentialKey parameter is of type any, which means it can be any
+     * data type.
+     * @returns a boolean value indicating whether the potentialKey is of type number or not.
+     */
+    isNotNodeInstance(potentialKey) {
+      return !(potentialKey instanceof BSTNode);
+    }
     /**
      * Time Complexity: O(log n) - Average case for a balanced tree.
      * Space Complexity: O(log n) - Space for the recursive call stack in the worst case.
@@ -10027,7 +10010,7 @@ var dataStructureTyped = (() => {
   var AVLTree = class _AVLTree extends BST {
     /**
      * The constructor function initializes an AVLTree object with optional elements and options.
-     * @param [elements] - The `elements` parameter is an optional iterable of `BTNodeExemplar<K, V, N>`
+     * @param [elements] - The `elements` parameter is an optional iterable of `BTNExemplar<K, V, N>`
      * objects. It represents a collection of elements that will be added to the AVL tree during
      * initialization.
      * @param [options] - The `options` parameter is an optional object that allows you to customize the
@@ -10066,12 +10049,21 @@ var dataStructureTyped = (() => {
     }
     /**
      * The function checks if an exemplar is an instance of AVLTreeNode.
-     * @param exemplar - The `exemplar` parameter is of type `BTNodeExemplar<K, V, N>`.
+     * @param exemplar - The `exemplar` parameter is of type `BTNExemplar<K, V, N>`.
      * @returns a boolean value indicating whether the exemplar is an instance of the AVLTreeNode class.
      */
     isNode(exemplar) {
       return exemplar instanceof AVLTreeNode;
     }
+    /**
+     * The function "isNotNodeInstance" checks if a potential key is a K.
+     * @param {any} potentialKey - The potentialKey parameter is of type any, which means it can be any
+     * data type.
+     * @returns a boolean value indicating whether the potentialKey is of type number or not.
+     */
+    isNotNodeInstance(potentialKey) {
+      return !(potentialKey instanceof AVLTreeNode);
+    }
     /**
      * Time Complexity: O(log n) - logarithmic time, where "n" is the number of nodes in the tree. The add method of the superclass (BST) has logarithmic time complexity.
      * Space Complexity: O(1) - constant space, as it doesn't use additional data structures that scale with input size.
@@ -10113,7 +10105,7 @@ var dataStructureTyped = (() => {
      * that is deleted from the binary tree. It is an optional parameter and if not provided, it will
      * default to the `_defaultOneParamCallback` function. The `callback` function should have a single
      * parameter of type `N
-     * @returns The method is returning an array of `BiTreeDeleteResult<N>`.
+     * @returns The method is returning an array of `BinaryTreeDeleteResult<N>`.
      */
     delete(identifier, callback = this._defaultOneParamCallback) {
       if (identifier instanceof AVLTreeNode)
@@ -10443,7 +10435,7 @@ var dataStructureTyped = (() => {
     /**
      * This is the constructor function for a Red-Black Tree data structure in TypeScript, which
      * initializes the tree with optional elements and options.
-     * @param [elements] - The `elements` parameter is an optional iterable of `BTNodeExemplar<K, V, N>`
+     * @param [elements] - The `elements` parameter is an optional iterable of `BTNExemplar<K, V, N>`
      * objects. It represents the initial elements that will be added to the RBTree during its
      * construction. If this parameter is provided, the `addMany` method is called to add all the
      * elements to the
@@ -10496,16 +10488,25 @@ var dataStructureTyped = (() => {
     }
     /**
      * The function checks if an exemplar is an instance of the RedBlackTreeNode class.
-     * @param exemplar - The `exemplar` parameter is of type `BTNodeExemplar<K, V, N>`.
+     * @param exemplar - The `exemplar` parameter is of type `BTNExemplar<K, V, N>`.
      * @returns a boolean value indicating whether the exemplar is an instance of the RedBlackTreeNode
      * class.
      */
     isNode(exemplar) {
       return exemplar instanceof RedBlackTreeNode;
     }
+    /**
+     * The function "isNotNodeInstance" checks if a potential key is a K.
+     * @param {any} potentialKey - The potentialKey parameter is of type any, which means it can be any
+     * data type.
+     * @returns a boolean value indicating whether the potentialKey is of type number or not.
+     */
+    isNotNodeInstance(potentialKey) {
+      return !(potentialKey instanceof RedBlackTreeNode);
+    }
     /**
      * The function `exemplarToNode` takes an exemplar and converts it into a node object if possible.
-     * @param exemplar - The `exemplar` parameter is of type `BTNodeExemplar<K, V, N>`, where:
+     * @param exemplar - The `exemplar` parameter is of type `BTNExemplar<K, V, N>`, where:
      * @param {V} [value] - The `value` parameter is an optional value that can be passed to the
      * `exemplarToNode` function. It represents the value associated with the exemplar node. If a value
      * is provided, it will be used when creating the new node. If no value is provided, the new node
@@ -10607,7 +10608,7 @@ var dataStructureTyped = (() => {
      * @param {C} callback - The `callback` parameter is a function that takes a node of type `N` 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 `BiTreeDeleteResult<N>`.
+     * @returns an array of `BinaryTreeDeleteResult<N>`.
      */
     delete(identifier, callback = this._defaultOneParamCallback) {
       const ans = [];
@@ -10667,7 +10668,9 @@ var dataStructureTyped = (() => {
      * Space Complexity: O(1)
      */
     isRealNode(node) {
-      return node !== this.Sentinel && node !== void 0;
+      if (node === this.Sentinel || node === void 0)
+        return false;
+      return node instanceof RedBlackTreeNode;
     }
     /**
      * Time Complexity: O(log n) on average (where n is the number of nodes in the tree)
@@ -10696,41 +10699,17 @@ var dataStructureTyped = (() => {
      */
     getNode(identifier, callback = this._defaultOneParamCallback, beginRoot = this.root, iterationType = this.iterationType) {
       var _a;
-      if (identifier instanceof BinaryTreeNode)
+      if (identifier instanceof RedBlackTreeNode)
         callback = (node) => node;
       beginRoot = this.ensureNode(beginRoot);
       return (_a = this.getNodes(identifier, callback, true, beginRoot, iterationType)[0]) != null ? _a : void 0;
     }
     /**
-     * Time Complexity: O(log n) on average (where n is the number of nodes in the tree)
-     * Space Complexity: O(1)
-     */
-    /**
-     * Time Complexity: O(log n) on average (where n is the number of nodes in the tree)
-     * Space Complexity: O(1)
-     *
-     * The function returns the successor of a given node in a red-black tree.
-     * @param {RedBlackTreeNode} x - RedBlackTreeNode - The node for which we want to find the successor.
-     * @returns the successor of the given RedBlackTreeNode.
-     */
-    getSuccessor(x) {
-      var _a;
-      if (x.right !== this.Sentinel) {
-        return (_a = this.getLeftMost(x.right)) != null ? _a : void 0;
-      }
-      let y = x.parent;
-      while (y !== this.Sentinel && y !== void 0 && x === y.right) {
-        x = y;
-        y = y.parent;
-      }
-      return y;
-    }
-    /**
-     * Time Complexity: O(log n) on average (where n is the number of nodes in the tree)
+     * Time Complexity: O(log n)
      * Space Complexity: O(1)
      */
     /**
-     * Time Complexity: O(log n) on average (where n is the number of nodes in the tree)
+     * Time Complexity: O(log n)
      * Space Complexity: O(1)
      *
      * The function returns the predecessor of a given node in a red-black tree.
@@ -10739,11 +10718,11 @@ var dataStructureTyped = (() => {
      * @returns the predecessor of the given RedBlackTreeNode 'x'.
      */
     getPredecessor(x) {
-      if (x.left !== this.Sentinel) {
+      if (this.isRealNode(x.left)) {
         return this.getRightMost(x.left);
       }
       let y = x.parent;
-      while (y !== this.Sentinel && x === y.left) {
+      while (this.isRealNode(y) && x === y.left) {
         x = y;
         y = y.parent;
       }
@@ -11040,16 +11019,25 @@ var dataStructureTyped = (() => {
     }
     /**
      * The function checks if an exemplar is an instance of the TreeMultimapNode class.
-     * @param exemplar - The `exemplar` parameter is of type `BTNodeExemplar<K, V, N>`.
+     * @param exemplar - The `exemplar` parameter is of type `BTNExemplar<K, V, N>`.
      * @returns a boolean value indicating whether the exemplar is an instance of the TreeMultimapNode
      * class.
      */
     isNode(exemplar) {
       return exemplar instanceof TreeMultimapNode;
     }
+    /**
+     * The function "isNotNodeInstance" checks if a potential key is a K.
+     * @param {any} potentialKey - The potentialKey parameter is of type any, which means it can be any
+     * data type.
+     * @returns a boolean value indicating whether the potentialKey is of type number or not.
+     */
+    isNotNodeInstance(potentialKey) {
+      return !(potentialKey instanceof TreeMultimapNode);
+    }
     /**
      * The function `exemplarToNode` converts an exemplar object into a node object.
-     * @param exemplar - The `exemplar` parameter is of type `BTNodeExemplar<K, V, N>`, which means it
+     * @param exemplar - The `exemplar` parameter is of type `BTNExemplar<K, V, N>`, which means it
      * can be one of the following:
      * @param {V} [value] - The `value` parameter is an optional argument that represents the value
      * associated with the node. It is of type `V`, which can be any data type. If no value is provided,
@@ -11197,7 +11185,7 @@ var dataStructureTyped = (() => {
      * being deleted. If set to true, the count of the node will not be considered and the node will be
      * deleted regardless of its count. If set to false (default), the count of the node will be
      * decremented by 1 and
-     * @returns an array of `BiTreeDeleteResult<N>`.
+     * @returns an array of `BinaryTreeDeleteResult<N>`.
      */
     delete(identifier, callback = this._defaultOneParamCallback, ignoreCount = false) {
       var _a;
@@ -11393,6 +11381,43 @@ var dataStructureTyped = (() => {
     }
   };
 
+  // src/data-structures/priority-queue/priority-queue.ts
+  var PriorityQueue = class extends Heap {
+    constructor(elements, options) {
+      super(elements, options);
+    }
+  };
+
+  // src/data-structures/priority-queue/min-priority-queue.ts
+  var MinPriorityQueue = class extends PriorityQueue {
+    constructor(elements, options = {
+      comparator: (a, b) => {
+        if (!(typeof a === "number" && typeof b === "number")) {
+          throw new Error("The a, b params of compare function must be number");
+        } else {
+          return a - b;
+        }
+      }
+    }) {
+      super(elements, options);
+    }
+  };
+
+  // src/data-structures/priority-queue/max-priority-queue.ts
+  var MaxPriorityQueue = class extends PriorityQueue {
+    constructor(elements, options = {
+      comparator: (a, b) => {
+        if (!(typeof a === "number" && typeof b === "number")) {
+          throw new Error("The a, b params of compare function must be number");
+        } else {
+          return b - a;
+        }
+      }
+    }) {
+      super(elements, options);
+    }
+  };
+
   // src/data-structures/matrix/matrix.ts
   var MatrixNTI2D = class {
     /**