min-heap-typed 1.50.1 → 1.50.2

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

@@ -28,7 +28,7 @@ exports.AVLTreeNode = AVLTreeNode;
 class AVLTree extends bst_1.BST {
     /**
      * The constructor function initializes an AVLTree object with optional keysOrNodesOrEntries and options.
-     * @param [keysOrNodesOrEntries] - The `keysOrNodesOrEntries` parameter is an optional iterable of `KeyOrNodeOrEntry<K, V, N>`
+     * @param [keysOrNodesOrEntries] - The `keysOrNodesOrEntries` parameter is an optional iterable of `KeyOrNodeOrEntry<K, V, NODE>`
      * objects. It represents a collection of nodes 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
@@ -46,7 +46,7 @@ class AVLTree extends bst_1.BST {
      * the new node. It is used to determine the position of the node in the binary search tree.
      * @param [value] - The parameter `value` is an optional value that can be assigned to the node. It is of
      * type `V`, which means it can be any value that is assignable to the `value` property of the
-     * node type `N`.
+     * node type `NODE`.
      * @returns a new AVLTreeNode object with the specified key and value.
      */
     createNode(key, value) {
@@ -64,7 +64,7 @@ class AVLTree extends bst_1.BST {
     }
     /**
      * The function checks if an keyOrNodeOrEntry is an instance of AVLTreeNode.
-     * @param keyOrNodeOrEntry - The `keyOrNodeOrEntry` parameter is of type `KeyOrNodeOrEntry<K, V, N>`.
+     * @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 AVLTreeNode class.
      */
     isNode(keyOrNodeOrEntry) {
@@ -111,8 +111,8 @@ class AVLTree extends bst_1.BST {
      * @param {C} callback - The `callback` parameter is a function that will be called for each node
      * 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 `BinaryTreeDeleteResult<N>`.
+     * parameter of type `NODE
+     * @returns The method is returning an array of `BinaryTreeDeleteResult<NODE>`.
      */
     delete(identifier, callback = this._defaultOneParamCallback) {
         if (identifier instanceof AVLTreeNode)
@@ -128,9 +128,9 @@ class AVLTree extends bst_1.BST {
     /**
      * The `_swapProperties` function swaps the key, value, and height properties between two nodes in a binary
      * tree.
-     * @param {K | N | undefined} srcNode - The `srcNode` parameter represents the source node that
-     * needs to be swapped with the destination node. It can be of type `K`, `N`, or `undefined`.
-     * @param {K | N  | undefined} destNode - The `destNode` parameter represents the destination
+     * @param {K | NODE | undefined} srcNode - The `srcNode` parameter represents the source node that
+     * needs to be swapped with the destination node. It can be of type `K`, `NODE`, or `undefined`.
+     * @param {K | NODE  | undefined} destNode - The `destNode` parameter represents the destination
      * node where the values from the source node will be swapped to.
      * @returns either the `destNode` object if both `srcNode` and `destNode` are defined, or `undefined`
      * if either `srcNode` or `destNode` is undefined.
@@ -157,14 +157,13 @@ class AVLTree extends bst_1.BST {
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
-     * constant time, as it performs a fixed number of operations. constant space, as it only uses a constant amount of memory.
      */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
      *
      * The function calculates the balance factor of a node in a binary tree.
-     * @param {N} node - The parameter "node" represents a node in a binary tree data structure.
+     * @param {NODE} node - The parameter "node" represents a node in a binary tree data structure.
      * @returns the balance factor of a given node. The balance factor is calculated by subtracting the
      * height of the left subtree from the height of the right subtree.
      */
@@ -181,7 +180,6 @@ class AVLTree extends bst_1.BST {
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
-     * constant time, as it performs a fixed number of operations. constant space, as it only uses a constant amount of memory.
      */
     /**
      * Time Complexity: O(1)
@@ -189,7 +187,7 @@ class AVLTree extends bst_1.BST {
      *
      * The function updates the height of a node in a binary tree based on the heights of its left and
      * right children.
-     * @param {N} node - The parameter "node" represents a node in a binary tree data structure.
+     * @param {NODE} node - The parameter "node" represents a node in a binary tree data structure.
      */
     _updateHeight(node) {
         if (!node.left && !node.right)
@@ -203,71 +201,16 @@ class AVLTree extends bst_1.BST {
         else
             node.height = 1 + Math.max(node.right.height, node.left.height);
     }
-    /**
-     * 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)
-     *
-     * The `_balancePath` function is used to update the heights of nodes and perform rotation operations
-     * to restore balance in an AVL tree after inserting a node.
-     * @param {N} node - The `node` parameter in the `_balancePath` function represents the node in the
-     * AVL tree that needs to be balanced.
-     */
-    _balancePath(node) {
-        node = this.ensureNode(node);
-        const path = this.getPathToRoot(node, false); // first O(log n) + O(log n)
-        for (let i = 0; i < path.length; i++) {
-            // second O(log n)
-            const A = path[i];
-            // Update Heights: After inserting a node, backtrack from the insertion point to the root node, updating the height of each node along the way.
-            this._updateHeight(A); // first O(1)
-            // Check Balance: Simultaneously with height updates, check if each node violates the balance property of an AVL tree.
-            // Balance Restoration: If a balance issue is discovered after inserting a node, it requires balance restoration operations. Balance restoration includes four basic cases where rotation operations need to be performed to fix the balance:
-            switch (this._balanceFactor(A) // second O(1)
-            ) {
-                case -2:
-                    if (A && A.left) {
-                        if (this._balanceFactor(A.left) <= 0) {
-                            // second O(1)
-                            // Left Rotation (LL Rotation): When the inserted node is in the left subtree of the left subtree, causing an imbalance.
-                            this._balanceLL(A);
-                        }
-                        else {
-                            // Left-Right Rotation (LR Rotation): When the inserted node is in the right subtree of the left subtree, causing an imbalance.
-                            this._balanceLR(A);
-                        }
-                    }
-                    break;
-                case +2:
-                    if (A && A.right) {
-                        if (this._balanceFactor(A.right) >= 0) {
-                            // Right Rotation (RR Rotation): When the inserted node is in the right subtree of the right subtree, causing an imbalance.
-                            this._balanceRR(A);
-                        }
-                        else {
-                            // Right-Left Rotation (RL Rotation): When the inserted node is in the left subtree of the right subtree, causing an imbalance.
-                            this._balanceRL(A);
-                        }
-                    }
-            }
-            // 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)
-     * constant time, as these methods perform a fixed number of operations. constant space, as they only use a constant amount of memory.
      */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
      *
      * The function `_balanceLL` performs a left-left rotation to balance a binary tree.
-     * @param {N} A - A is a node in a binary tree.
+     * @param {NODE} A - A is a node in a binary tree.
      */
     _balanceLL(A) {
         const parentOfA = A.parent;
@@ -308,7 +251,7 @@ class AVLTree extends bst_1.BST {
      * Space Complexity: O(1)
      *
      * The `_balanceLR` function performs a left-right rotation to balance a binary tree.
-     * @param {N} A - A is a node in a binary tree.
+     * @param {NODE} A - A is a node in a binary tree.
      */
     _balanceLR(A) {
         const parentOfA = A.parent;
@@ -364,7 +307,7 @@ class AVLTree extends bst_1.BST {
      * Space Complexity: O(1)
      *
      * The function `_balanceRR` performs a right-right rotation to balance a binary tree.
-     * @param {N} A - A is a node in a binary tree.
+     * @param {NODE} A - A is a node in a binary tree.
      */
     _balanceRR(A) {
         const parentOfA = A.parent;
@@ -406,7 +349,7 @@ class AVLTree extends bst_1.BST {
      * Space Complexity: O(1)
      *
      * The function `_balanceRL` performs a right-left rotation to balance a binary tree.
-     * @param {N} A - A is a node in a binary tree.
+     * @param {NODE} A - A is a node in a binary tree.
      */
     _balanceRL(A) {
         const parentOfA = A.parent;
@@ -453,6 +396,60 @@ 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)
+     *
+     * The `_balancePath` function is used to update the heights of nodes and perform rotation operations
+     * to restore balance in an AVL tree after inserting a node.
+     * @param {NODE} node - The `node` parameter in the `_balancePath` function represents the node in the
+     * AVL tree that needs to be balanced.
+     */
+    _balancePath(node) {
+        node = this.ensureNode(node);
+        const path = this.getPathToRoot(node, false); // first O(log n) + O(log n)
+        for (let i = 0; i < path.length; i++) {
+            // second O(log n)
+            const A = path[i];
+            // Update Heights: After inserting a node, backtrack from the insertion point to the root node, updating the height of each node along the way.
+            this._updateHeight(A); // first O(1)
+            // Check Balance: Simultaneously with height updates, check if each node violates the balance property of an AVL tree.
+            // Balance Restoration: If a balance issue is discovered after inserting a node, it requires balance restoration operations. Balance restoration includes four basic cases where rotation operations need to be performed to fix the balance:
+            switch (this._balanceFactor(A) // second O(1)
+            ) {
+                case -2:
+                    if (A && A.left) {
+                        if (this._balanceFactor(A.left) <= 0) {
+                            // second O(1)
+                            // Left Rotation (LL Rotation): When the inserted node is in the left subtree of the left subtree, causing an imbalance.
+                            this._balanceLL(A);
+                        }
+                        else {
+                            // Left-Right Rotation (LR Rotation): When the inserted node is in the right subtree of the left subtree, causing an imbalance.
+                            this._balanceLR(A);
+                        }
+                    }
+                    break;
+                case +2:
+                    if (A && A.right) {
+                        if (this._balanceFactor(A.right) >= 0) {
+                            // Right Rotation (RR Rotation): When the inserted node is in the right subtree of the right subtree, causing an imbalance.
+                            this._balanceRR(A);
+                        }
+                        else {
+                            // Right-Left Rotation (RL Rotation): When the inserted node is in the left subtree of the right subtree, causing an imbalance.
+                            this._balanceRL(A);
+                        }
+                    }
+            }
+            // 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.
+        }
+    }
     _replaceNode(oldNode, newNode) {
         newNode.height = oldNode.height;
         return super._replaceNode(oldNode, newNode);