data-structure-typed 1.52.4 → 1.52.6

package/dist/mjs/data-structures/binary-tree/bst.d.ts

@@ -114,6 +114,7 @@ export declare class BST<K = any, V = any, R = BTNEntry<K, V>, NODE extends BSTN
      * an instance of the `BSTNode` class.
      */
     isNode(keyOrNodeOrEntryOrRawElement: R | BTNKeyOrNodeOrEntry<K, V, NODE>): keyOrNodeOrEntryOrRawElement is NODE;
+    isKey(key: any): key is K;
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -126,10 +127,6 @@ export declare class BST<K = any, V = any, R = BTNEntry<K, V>, NODE extends BSTN
      * @returns a boolean value.
      */
     add(keyOrNodeOrEntryOrRawElement: R | BTNKeyOrNodeOrEntry<K, V, NODE>, value?: V): boolean;
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(log n)
-     */
     /**
      * Time Complexity: O(k log n)
      * Space Complexity: O(k + log n)
@@ -175,10 +172,6 @@ export declare class BST<K = any, V = any, R = BTNEntry<K, V>, NODE extends BSTN
      * @returns The method `getNodes` returns an array of `NODE` objects.
      */
     getNodes<C extends BTNCallback<NODE>>(identifier: ReturnType<C> | undefined, callback?: C, onlyOne?: boolean, beginRoot?: R | BTNKeyOrNodeOrEntry<K, V, NODE>, iterationType?: IterationType): NODE[];
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -201,10 +194,6 @@ export declare class BST<K = any, V = any, R = BTNEntry<K, V>, NODE extends BSTN
      * @returns The method is returning a NODE object or undefined.
      */
     getNode<C extends BTNCallback<NODE>>(identifier: ReturnType<C> | undefined, callback?: C, beginRoot?: R | BSTNKeyOrNode<K, NODE>, iterationType?: IterationType): OptBSTN<NODE>;
-    /**
-     * Time Complexity: O(k log n)
-     * Space Complexity: O(k + log n)
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -219,10 +208,6 @@ export declare class BST<K = any, V = any, R = BTNEntry<K, V>, NODE extends BSTN
      * @returns The method is returning a NODE object or undefined.
      */
     getNodeByKey(key: K, iterationType?: IterationType): OptBSTN<NODE>;
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(k + log n)
-     */
     /**
      * Time complexity: O(n)
      * Space complexity: O(n)
@@ -244,10 +229,6 @@ export declare class BST<K = any, V = any, R = BTNEntry<K, V>, NODE extends BSTN
      * @returns The method is returning an array of the return type of the callback function.
      */
     dfs<C extends BTNCallback<NODE>>(callback?: C, pattern?: DFSOrderPattern, beginRoot?: R | BTNKeyOrNodeOrEntry<K, V, NODE>, iterationType?: IterationType): ReturnType<C>[];
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time complexity: O(n)
      * Space complexity: O(n)
@@ -266,10 +247,6 @@ export declare class BST<K = any, V = any, R = BTNEntry<K, V>, NODE extends BSTN
      * @returns an array of the return type of the callback function.
      */
     bfs<C extends BTNCallback<NODE>>(callback?: C, beginRoot?: R | BTNKeyOrNodeOrEntry<K, V, NODE>, iterationType?: IterationType): ReturnType<C>[];
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time complexity: O(n)
      * Space complexity: O(n)
@@ -289,10 +266,6 @@ export declare class BST<K = any, V = any, R = BTNEntry<K, V>, NODE extends BSTN
      * function.
      */
     listLevels<C extends BTNCallback<NODE>>(callback?: C, beginRoot?: R | BTNKeyOrNodeOrEntry<K, V, NODE>, iterationType?: IterationType): ReturnType<C>[][];
-    /**
-     * Time complexity: O(n)
-     * Space complexity: O(n)
-     */
     /**
      * Time complexity: O(n)
      * Space complexity: O(n)
@@ -315,10 +288,6 @@ export declare class BST<K = any, V = any, R = BTNEntry<K, V>, NODE extends BSTN
      * `ReturnType<C>`, which is the return type of the callback function passed as an argument.
      */
     lesserOrGreaterTraverse<C extends BTNCallback<NODE>>(callback?: C, lesserOrGreater?: CP, targetNode?: R | BTNKeyOrNodeOrEntry<K, V, NODE>, iterationType?: IterationType): ReturnType<C>[];
-    /**
-     * Time complexity: O(n)
-     * Space complexity: O(n)
-     */
     /**
      * Time complexity: O(n)
      * Space complexity: O(n)
@@ -332,10 +301,6 @@ export declare class BST<K = any, V = any, R = BTNEntry<K, V>, NODE extends BSTN
      * @returns The function `perfectlyBalance` returns a boolean value.
      */
     perfectlyBalance(iterationType?: IterationType): boolean;
-    /**
-     * Time complexity: O(n)
-     * Space complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(log n)
@@ -351,10 +316,6 @@ export declare class BST<K = any, V = any, R = BTNEntry<K, V>, NODE extends BSTN
     isAVLBalanced(iterationType?: IterationType): boolean;
     protected _DEFAULT_COMPARATOR: (a: K, b: K) => number;
     protected _comparator: Comparator<K>;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(log n)
-     */
     /**
      * The function returns the value of the _comparator property.
      * @returns The `_comparator` property is being returned.

package/dist/mjs/data-structures/binary-tree/bst.js

@@ -1,5 +1,6 @@
 import { BinaryTree, BinaryTreeNode } from './binary-tree';
 import { Queue } from '../queue';
+import { isComparable } from '../../utils';
 export class BSTNode extends BinaryTreeNode {
     parent;
     constructor(key, value) {
@@ -136,7 +137,7 @@ export class BST extends BinaryTree {
      * @returns The method is returning either the node that was ensured or `undefined` if the node could
      * not be ensured.
      */
-    ensureNode(keyOrNodeOrEntryOrRawElement, iterationType = 'ITERATIVE') {
+    ensureNode(keyOrNodeOrEntryOrRawElement, iterationType = this.iterationType) {
         return super.ensureNode(keyOrNodeOrEntryOrRawElement, iterationType) ?? undefined;
     }
     /**
@@ -149,6 +150,9 @@ export class BST extends BinaryTree {
     isNode(keyOrNodeOrEntryOrRawElement) {
         return keyOrNodeOrEntryOrRawElement instanceof BSTNode;
     }
+    isKey(key) {
+        return isComparable(key, this.comparator !== this._DEFAULT_COMPARATOR);
+    }
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -194,10 +198,6 @@ export class BST extends BinaryTree {
         }
         return false;
     }
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(log n)
-     */
     /**
      * Time Complexity: O(k log n)
      * Space Complexity: O(k + log n)
@@ -327,6 +327,10 @@ export class BST extends BinaryTree {
      * @returns The method `getNodes` returns an array of `NODE` objects.
      */
     getNodes(identifier, callback = this._DEFAULT_CALLBACK, onlyOne = false, beginRoot = this.root, iterationType = this.iterationType) {
+        if (identifier === undefined)
+            return [];
+        if (identifier === null)
+            return [];
         beginRoot = this.ensureNode(beginRoot);
         if (!beginRoot)
             return [];
@@ -387,10 +391,6 @@ export class BST extends BinaryTree {
         }
         return ans;
     }
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -415,10 +415,6 @@ export class BST extends BinaryTree {
     getNode(identifier, callback = this._DEFAULT_CALLBACK, beginRoot = this.root, iterationType = this.iterationType) {
         return this.getNodes(identifier, callback, true, beginRoot, iterationType)[0] ?? undefined;
     }
-    /**
-     * Time Complexity: O(k log n)
-     * Space Complexity: O(k + log n)
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -432,13 +428,9 @@ export class BST extends BinaryTree {
      * It has a default value of `'ITERATIVE'`.
      * @returns The method is returning a NODE object or undefined.
      */
-    getNodeByKey(key, iterationType = 'ITERATIVE') {
+    getNodeByKey(key, iterationType = this.iterationType) {
         return this.getNode(key, this._DEFAULT_CALLBACK, this.root, iterationType);
     }
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(k + log n)
-     */
     /**
      * Time complexity: O(n)
      * Space complexity: O(n)
@@ -459,13 +451,9 @@ export class BST extends BinaryTree {
      * following values:
      * @returns The method is returning an array of the return type of the callback function.
      */
-    dfs(callback = this._DEFAULT_CALLBACK, pattern = 'IN', beginRoot = this.root, iterationType = 'ITERATIVE') {
-        return super.dfs(callback, pattern, beginRoot, iterationType, false);
+    dfs(callback = this._DEFAULT_CALLBACK, pattern = 'IN', beginRoot = this.root, iterationType = this.iterationType) {
+        return super.dfs(callback, pattern, beginRoot, iterationType);
     }
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time complexity: O(n)
      * Space complexity: O(n)
@@ -486,10 +474,6 @@ export class BST extends BinaryTree {
     bfs(callback = this._DEFAULT_CALLBACK, beginRoot = this.root, iterationType = this.iterationType) {
         return super.bfs(callback, beginRoot, iterationType, false);
     }
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time complexity: O(n)
      * Space complexity: O(n)
@@ -511,10 +495,6 @@ export class BST extends BinaryTree {
     listLevels(callback = this._DEFAULT_CALLBACK, beginRoot = this.root, iterationType = this.iterationType) {
         return super.listLevels(callback, beginRoot, iterationType, false);
     }
-    /**
-     * Time complexity: O(n)
-     * Space complexity: O(n)
-     */
     /**
      * Time complexity: O(n)
      * Space complexity: O(n)
@@ -574,10 +554,6 @@ export class BST extends BinaryTree {
             return ans;
         }
     }
-    /**
-     * Time complexity: O(n)
-     * Space complexity: O(n)
-     */
     /**
      * Time complexity: O(n)
      * Space complexity: O(n)
@@ -626,10 +602,6 @@ export class BST extends BinaryTree {
             return true;
         }
     }
-    /**
-     * Time complexity: O(n)
-     * Space complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(log n)
@@ -698,10 +670,6 @@ export class BST extends BinaryTree {
         return 0;
     };
     _comparator = this._DEFAULT_COMPARATOR;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(log n)
-     */
     /**
      * The function returns the value of the _comparator property.
      * @returns The `_comparator` property is being returned.

package/dist/mjs/data-structures/binary-tree/rb-tree.d.ts

@@ -67,10 +67,6 @@ export declare class RedBlackTree<K = any, V = any, R = BTNEntry<K, V>, NODE ext
      * @returns a new instance of a RedBlackTree object.
      */
     createTree(options?: RBTreeOptions<K, V, R>): TREE;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -82,10 +78,6 @@ export declare class RedBlackTree<K = any, V = any, R = BTNEntry<K, V>, NODE ext
      * an instance of the `RedBlackTreeNode` class.
      */
     isNode(keyOrNodeOrEntryOrRawElement: R | BTNKeyOrNodeOrEntry<K, V, NODE>): keyOrNodeOrEntryOrRawElement is NODE;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -94,10 +86,6 @@ export declare class RedBlackTree<K = any, V = any, R = BTNEntry<K, V>, NODE ext
      * size counter to zero.
      */
     clear(): void;
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -114,10 +102,6 @@ export declare class RedBlackTree<K = any, V = any, R = BTNEntry<K, V>, NODE ext
      * returns true. If the node cannot be added or updated, the method returns false.
      */
     add(keyOrNodeOrEntryOrRawElement: R | BTNKeyOrNodeOrEntry<K, V, NODE>, value?: V): boolean;
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -135,10 +119,6 @@ export declare class RedBlackTree<K = any, V = any, R = BTNEntry<K, V>, NODE ext
      * @returns an array of BinaryTreeDeleteResult<NODE> objects.
      */
     delete<C extends BTNCallback<NODE>>(identifier: ReturnType<C> | null | undefined, callback?: C): BinaryTreeDeleteResult<NODE>[];
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -148,10 +128,6 @@ export declare class RedBlackTree<K = any, V = any, R = BTNEntry<K, V>, NODE ext
      * @param {NODE | undefined} v - v is a parameter of type NODE or undefined.
      */
     protected _setRoot(v: NODE | undefined): void;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -165,10 +141,6 @@ export declare class RedBlackTree<K = any, V = any, R = BTNEntry<K, V>, NODE ext
      * superclass, with the `oldNode` and `newNode` parameters.
      */
     protected _replaceNode(oldNode: NODE, newNode: NODE): NODE;
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -182,10 +154,6 @@ export declare class RedBlackTree<K = any, V = any, R = BTNEntry<K, V>, NODE ext
      * was created and inserted into the tree.
      */
     protected _insert(node: NODE): CRUD;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -196,10 +164,6 @@ export declare class RedBlackTree<K = any, V = any, R = BTNEntry<K, V>, NODE ext
      * either be a `NODE` object or `undefined`.
      */
     protected _transplant(u: NODE, v: NODE | undefined): void;
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -209,10 +173,6 @@ export declare class RedBlackTree<K = any, V = any, R = BTNEntry<K, V>, NODE ext
      * structure. It can either be a valid node or `undefined`.
      */
     protected _insertFixup(z: NODE | undefined): void;
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -225,10 +185,6 @@ export declare class RedBlackTree<K = any, V = any, R = BTNEntry<K, V>, NODE ext
      * does not return anything.
      */
     protected _deleteFixup(node: NODE | undefined): void;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -239,10 +195,6 @@ export declare class RedBlackTree<K = any, V = any, R = BTNEntry<K, V>, NODE ext
      * @returns void, which means it does not return any value.
      */
     protected _leftRotate(x: NODE | undefined): void;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)

package/dist/mjs/data-structures/binary-tree/rb-tree.js

@@ -86,10 +86,6 @@ export class RedBlackTree extends BST {
             ...options
         });
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -125,7 +121,7 @@ export class RedBlackTree extends BST {
     //
     //   if (this.toEntryFn) {
     //     const [key, entryValue] = this.toEntryFn(keyOrNodeOrEntryOrRawElement as R);
-    //     if (key) return this.createNode(key, entryValue ?? value, 'RED');
+    //     if (this.isKey(key)) return this.createNode(key, entryValue ?? value, 'RED');
     //   }
     //
     //   if (this.isEntry(keyOrNodeOrEntryOrRawElement)) {
@@ -138,10 +134,6 @@ export class RedBlackTree extends BST {
     //
     //   return ;
     // }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -153,10 +145,6 @@ export class RedBlackTree extends BST {
         super.clear();
         this._root = this.NIL;
     }
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -191,10 +179,6 @@ export class RedBlackTree extends BST {
         else
             return insertStatus === 'UPDATED';
     }
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -231,7 +215,7 @@ export class RedBlackTree extends BST {
             this._transplant(nodeToDelete, nodeToDelete.left);
         }
         else {
-            const successor = this.getLeftMost(nodeToDelete.right);
+            const successor = this.getLeftMost(node => node, nodeToDelete.right);
             if (successor) {
                 originalColor = successor.color;
                 replacementNode = successor.right;
@@ -263,10 +247,6 @@ export class RedBlackTree extends BST {
         results.push({ deleted: nodeToDelete, needBalanced: undefined });
         return results;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -281,10 +261,6 @@ export class RedBlackTree extends BST {
         }
         this._root = v;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -301,10 +277,6 @@ export class RedBlackTree extends BST {
         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)
@@ -350,10 +322,6 @@ export class RedBlackTree extends BST {
         this._insertFixup(node);
         return 'CREATED';
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -377,10 +345,6 @@ export class RedBlackTree extends BST {
             v.parent = u.parent;
         }
     }
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -447,10 +411,6 @@ export class RedBlackTree extends BST {
         if (this.isRealNode(this._root))
             this._root.color = 'BLACK';
     }
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -537,10 +497,6 @@ export class RedBlackTree extends BST {
             node.color = 'BLACK';
         }
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -572,10 +528,6 @@ export class RedBlackTree extends BST {
         y.left = x;
         x.parent = y;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)

package/dist/mjs/data-structures/binary-tree/tree-multi-map.d.ts

@@ -53,10 +53,6 @@ export declare class TreeMultiMap<K = any, V = any, R = BTNEntry<K, V>, NODE ext
      * @returns the sum of the count property of all nodes in the tree.
      */
     get count(): number;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -110,10 +106,6 @@ export declare class TreeMultiMap<K = any, V = any, R = BTNEntry<K, V>, NODE ext
      * an instance of the `TreeMultiMapNode` class.
      */
     isNode(keyOrNodeOrEntryOrRawElement: R | BTNKeyOrNodeOrEntry<K, V, NODE>): keyOrNodeOrEntryOrRawElement is NODE;
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -131,10 +123,6 @@ export declare class TreeMultiMap<K = any, V = any, R = BTNEntry<K, V>, NODE ext
      * was successful, and false otherwise.
      */
     add(keyOrNodeOrEntryOrRawElement: R | BTNKeyOrNodeOrEntry<K, V, NODE>, value?: V, count?: number): boolean;
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -154,10 +142,6 @@ export declare class TreeMultiMap<K = any, V = any, R = BTNEntry<K, V>, NODE ext
      * @returns an array of BinaryTreeDeleteResult<NODE> objects.
      */
     delete<C extends BTNCallback<NODE>>(identifier: ReturnType<C> | null | undefined, callback?: C, ignoreCount?: boolean): BinaryTreeDeleteResult<NODE>[];
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -166,10 +150,6 @@ export declare class TreeMultiMap<K = any, V = any, R = BTNEntry<K, V>, NODE ext
      * zero.
      */
     clear(): void;
-    /**
-     * Time Complexity: O(n log n)
-     * Space Complexity: O(log n)
-     */
     /**
      * Time Complexity: O(n log n)
      * Space Complexity: O(log n)
@@ -184,10 +164,6 @@ export declare class TreeMultiMap<K = any, V = any, R = BTNEntry<K, V>, NODE ext
      * balancing operation is successful, and `false` if there are no nodes to balance.
      */
     perfectlyBalance(iterationType?: IterationType): boolean;
-    /**
-     * Time complexity: O(n)
-     * Space complexity: O(n)
-     */
     /**
      * Time complexity: O(n)
      * Space complexity: O(n)
@@ -196,10 +172,6 @@ export declare class TreeMultiMap<K = any, V = any, R = BTNEntry<K, V>, NODE ext
      * @returns The `clone()` method is returning a cloned instance of the `TREE` object.
      */
     clone(): TREE;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -215,10 +187,6 @@ export declare class TreeMultiMap<K = any, V = any, R = BTNEntry<K, V>, NODE ext
      * If either `srcNode` or `destNode` is undefined, it returns undefined.
      */
     protected _swapProperties(srcNode: R | BSTNKeyOrNode<K, NODE>, destNode: R | BSTNKeyOrNode<K, NODE>): NODE | undefined;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)