doubly-linked-list-typed 1.52.4 → 1.52.5

package/dist/data-structures/binary-tree/avl-tree.d.ts

@@ -80,11 +80,6 @@ export declare class AVLTree<K = any, V = any, R = BTNEntry<K, V>, NODE extends
      * an instance of the `AVLTreeNode` class.
      */
     isNode(keyOrNodeOrEntryOrRawElement: R | BTNKeyOrNodeOrEntry<K, V, NODE>): keyOrNodeOrEntryOrRawElement is NODE;
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     * logarithmic time, where "n" is the number of nodes in the tree. The add method of the superclass (BST) has logarithmic time complexity. constant space, as it doesn't use additional data structures that scale with input size.
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -99,10 +94,6 @@ export declare class AVLTree<K = any, V = any, R = BTNEntry<K, V>, NODE extends
      * @returns The method is returning a boolean value.
      */
     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)
@@ -117,10 +108,6 @@ export declare class AVLTree<K = any, V = any, R = BTNEntry<K, V>, NODE extends
      * @returns The method is returning an array of BinaryTreeDeleteResult<NODE> objects.
      */
     delete<C extends BTNCallback<NODE>>(identifier: ReturnType<C>, callback?: C): BinaryTreeDeleteResult<NODE>[];
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -135,10 +122,6 @@ export declare class AVLTree<K = any, V = any, R = BTNEntry<K, V>, NODE extends
      * `destNodeEnsured` are truthy. Otherwise, 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)
@@ -150,10 +133,6 @@ export declare class AVLTree<K = any, V = any, R = BTNEntry<K, V>, NODE extends
      * height of the left subtree from the height of the right subtree.
      */
     protected _balanceFactor(node: NODE): number;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -163,10 +142,6 @@ export declare class AVLTree<K = any, V = any, R = BTNEntry<K, V>, NODE extends
      * @param {NODE} node - The parameter "node" represents a node in a binary tree data structure.
      */
     protected _updateHeight(node: NODE): void;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -175,10 +150,6 @@ export declare class AVLTree<K = any, V = any, R = BTNEntry<K, V>, NODE extends
      * @param {NODE} A - A is a node in a binary tree.
      */
     protected _balanceLL(A: NODE): void;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -187,10 +158,6 @@ export declare class AVLTree<K = any, V = any, R = BTNEntry<K, V>, NODE extends
      * @param {NODE} A - A is a node in a binary tree.
      */
     protected _balanceLR(A: NODE): void;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -199,10 +166,6 @@ export declare class AVLTree<K = any, V = any, R = BTNEntry<K, V>, NODE extends
      * @param {NODE} A - A is a node in a binary tree.
      */
     protected _balanceRR(A: NODE): void;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -211,11 +174,6 @@ export declare class AVLTree<K = any, V = any, R = BTNEntry<K, V>, NODE extends
      * @param {NODE} A - A is a node in a binary tree.
      */
     protected _balanceRL(A: NODE): void;
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     * logarithmic time, where "n" is the number of nodes in the tree. The method traverses the path from the inserted node to the root. constant space, as it doesn't use additional data structures that scale with input size.
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -226,10 +184,6 @@ export declare class AVLTree<K = any, V = any, R = BTNEntry<K, V>, NODE extends
      * `BTNKeyOrNodeOrEntry<K, V, NODE>`.
      */
     protected _balancePath(node: R | BTNKeyOrNodeOrEntry<K, V, NODE>): void;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)

package/dist/data-structures/binary-tree/avl-tree.js

@@ -97,11 +97,6 @@ class AVLTree extends bst_1.BST {
     isNode(keyOrNodeOrEntryOrRawElement) {
         return keyOrNodeOrEntryOrRawElement instanceof AVLTreeNode;
     }
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     * logarithmic time, where "n" is the number of nodes in the tree. The add method of the superclass (BST) has logarithmic time complexity. constant space, as it doesn't use additional data structures that scale with input size.
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -123,10 +118,6 @@ class AVLTree extends bst_1.BST {
             this._balancePath(keyOrNodeOrEntryOrRawElement);
         return inserted;
     }
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -149,10 +140,6 @@ class AVLTree extends bst_1.BST {
         }
         return deletedResults;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -185,10 +172,6 @@ class AVLTree extends bst_1.BST {
         }
         return undefined;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -209,10 +192,6 @@ class AVLTree extends bst_1.BST {
         else
             return node.right.height - node.left.height;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -233,10 +212,6 @@ class AVLTree extends bst_1.BST {
         else
             node.height = 1 + Math.max(node.right.height, node.left.height);
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -274,10 +249,6 @@ class AVLTree extends bst_1.BST {
         if (B)
             this._updateHeight(B);
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -330,10 +301,6 @@ class AVLTree extends bst_1.BST {
         B && this._updateHeight(B);
         C && this._updateHeight(C);
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -372,10 +339,6 @@ class AVLTree extends bst_1.BST {
         this._updateHeight(A);
         B && this._updateHeight(B);
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -428,11 +391,6 @@ class AVLTree extends bst_1.BST {
         B && this._updateHeight(B);
         C && this._updateHeight(C);
     }
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     * logarithmic time, where "n" is the number of nodes in the tree. The method traverses the path from the inserted node to the root. constant space, as it doesn't use additional data structures that scale with input size.
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -482,10 +440,6 @@ class AVLTree extends bst_1.BST {
             // TODO So far, no sure if this is necessary that Recursive Repair: Once rotation operations are executed, it may cause imbalance issues at higher levels of the tree. Therefore, you need to recursively check and repair imbalance problems upwards until you reach the root node.
         }
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)