linked-list-typed 1.50.1 → 1.50.2

package/dist/data-structures/base/iterable-base.d.ts

@@ -105,6 +105,72 @@ export declare abstract class IterableEntryBase<K = any, V = any> {
      * used as the `this` value when calling the callback function. If `thisArg` is not provided, `
      */
     forEach(callbackfn: EntryCallback<K, V, void>, thisArg?: any): void;
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(1)
+     */
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(1)
+     *
+     * The `find` function iterates over the entries of a collection and returns the first value for
+     * which the callback function returns true.
+     * @param callbackfn - The callback function that will be called for each entry in the collection. It
+     * takes three arguments: the value of the entry, the key of the entry, and the index of the entry in
+     * the collection. It should return a boolean value indicating whether the current entry matches the
+     * desired condition.
+     * @param {any} [thisArg] - The `thisArg` parameter is an optional argument that specifies the value
+     * to be used as `this` when executing the `callbackfn` function. If `thisArg` is provided, it will
+     * be passed as the `this` value to the `callbackfn` function. If `thisArg
+     * @returns The method `find` returns the value of the first element in the iterable that satisfies
+     * the provided callback function. If no element satisfies the callback function, `undefined` is
+     * returned.
+     */
+    find(callbackfn: EntryCallback<K, V, [K, V]>, thisArg?: any): [K, V] | undefined;
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(1)
+     */
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(1)
+     *
+     * The function checks if a given key exists in a collection.
+     * @param {K} key - The parameter "key" is of type K, which means it can be any type. It represents
+     * the key that we want to check for existence in the data structure.
+     * @returns a boolean value. It returns true if the key is found in the collection, and false
+     * otherwise.
+     */
+    has(key: K): boolean;
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(1)
+     */
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(1)
+     *
+     * The function checks if a given value exists in a collection.
+     * @param {V} value - The parameter "value" is the value that we want to check if it exists in the
+     * collection.
+     * @returns a boolean value, either true or false.
+     */
+    hasValue(value: V): boolean;
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(1)
+     */
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(1)
+     *
+     * The `get` function retrieves the value associated with a given key from a collection.
+     * @param {K} key - K (the type of the key) - This parameter represents the key that is being
+     * searched for in the collection.
+     * @returns The `get` method returns the value associated with the specified key if it exists in the
+     * collection, otherwise it returns `undefined`.
+     */
+    get(key: K): V | undefined;
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -126,15 +192,16 @@ export declare abstract class IterableEntryBase<K = any, V = any> {
      * all the elements in the collection.
      */
     reduce<U>(callbackfn: ReduceEntryCallback<K, V, U>, initialValue: U): U;
-    hasValue(value: V): boolean;
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
      */
     print(): void;
+    abstract isEmpty(): boolean;
+    abstract clone(): any;
     protected abstract _getIterator(...args: any[]): IterableIterator<[K, V]>;
 }
-export declare abstract class IterableElementBase<V> {
+export declare abstract class IterableElementBase<E = any, C = any> {
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -148,7 +215,7 @@ export declare abstract class IterableElementBase<V> {
      * allows the function to accept any number of arguments as an array. In this case, the `args`
      * parameter is used to pass any number of arguments to the `_getIterator` method.
      */
-    [Symbol.iterator](...args: any[]): IterableIterator<V>;
+    [Symbol.iterator](...args: any[]): IterableIterator<E>;
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -159,7 +226,7 @@ export declare abstract class IterableElementBase<V> {
      *
      * The function returns an iterator that yields all the values in the object.
      */
-    values(): IterableIterator<V>;
+    values(): IterableIterator<E>;
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -178,7 +245,7 @@ export declare abstract class IterableElementBase<V> {
      * @returns The `every` method is returning a boolean value. It returns `true` if every element in
      * the array satisfies the provided predicate function, and `false` otherwise.
      */
-    every(predicate: ElementCallback<V, boolean>, thisArg?: any): boolean;
+    every(predicate: ElementCallback<E, boolean>, thisArg?: any): boolean;
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -197,7 +264,7 @@ export declare abstract class IterableElementBase<V> {
      * @returns a boolean value. It returns true if the predicate function returns true for any element
      * in the collection, and false otherwise.
      */
-    some(predicate: ElementCallback<V, boolean>, thisArg?: any): boolean;
+    some(predicate: ElementCallback<E, boolean>, thisArg?: any): boolean;
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -215,7 +282,43 @@ export declare abstract class IterableElementBase<V> {
      * to be used as `this` when executing the `callbackfn` function. If `thisArg` is provided, it will
      * be passed as the `this` value to the `callbackfn` function. If `thisArg
      */
-    forEach(callbackfn: ElementCallback<V, void>, thisArg?: any): void;
+    forEach(callbackfn: ElementCallback<E, void>, thisArg?: any): void;
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(1)
+     */
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(1)
+     *
+     * The `find` function iterates over the elements of an array-like object and returns the first
+     * element that satisfies the provided callback function.
+     * @param callbackfn - The callbackfn parameter is a function that will be called for each element in
+     * the array. It takes three arguments: the current element being processed, the index of the current
+     * element, and the array itself. The function should return a boolean value indicating whether the
+     * current element matches the desired condition.
+     * @param {any} [thisArg] - The `thisArg` parameter is an optional argument that specifies the value
+     * to be used as `this` when executing the `callbackfn` function. If `thisArg` is provided, it will
+     * be passed as the `this` value to the `callbackfn` function. If `thisArg
+     * @returns The `find` method returns the first element in the array that satisfies the provided
+     * callback function. If no element satisfies the callback function, `undefined` is returned.
+     */
+    find(callbackfn: ElementCallback<E, boolean>, thisArg?: any): E | undefined;
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(1)
+     */
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(1)
+     *
+     * The function checks if a given element exists in a collection.
+     * @param {E} element - The parameter "element" is of type E, which means it can be any type. It
+     * represents the element that we want to check for existence in the collection.
+     * @returns a boolean value. It returns true if the element is found in the collection, and false
+     * otherwise.
+     */
+    has(element: E): boolean;
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -233,11 +336,13 @@ export declare abstract class IterableElementBase<V> {
      * @returns The `reduce` method is returning the final value of the accumulator after iterating over
      * all the elements in the array and applying the callback function to each element.
      */
-    reduce<U>(callbackfn: ReduceElementCallback<V, U>, initialValue: U): U;
+    reduce<U>(callbackfn: ReduceElementCallback<E, U>, initialValue: U): U;
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
      */
     print(): void;
-    protected abstract _getIterator(...args: any[]): IterableIterator<V>;
+    abstract isEmpty(): boolean;
+    abstract clone(): C;
+    protected abstract _getIterator(...args: any[]): IterableIterator<E>;
 }

package/dist/data-structures/base/iterable-base.js

@@ -143,6 +143,100 @@ class IterableEntryBase {
             callbackfn.call(thisArg, value, key, index++, this);
         }
     }
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(1)
+     */
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(1)
+     *
+     * The `find` function iterates over the entries of a collection and returns the first value for
+     * which the callback function returns true.
+     * @param callbackfn - The callback function that will be called for each entry in the collection. It
+     * takes three arguments: the value of the entry, the key of the entry, and the index of the entry in
+     * the collection. It should return a boolean value indicating whether the current entry matches the
+     * desired condition.
+     * @param {any} [thisArg] - The `thisArg` parameter is an optional argument that specifies the value
+     * to be used as `this` when executing the `callbackfn` function. If `thisArg` is provided, it will
+     * be passed as the `this` value to the `callbackfn` function. If `thisArg
+     * @returns The method `find` returns the value of the first element in the iterable that satisfies
+     * the provided callback function. If no element satisfies the callback function, `undefined` is
+     * returned.
+     */
+    find(callbackfn, thisArg) {
+        let index = 0;
+        for (const item of this) {
+            const [key, value] = item;
+            if (callbackfn.call(thisArg, value, key, index++, this))
+                return item;
+        }
+        return;
+    }
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(1)
+     */
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(1)
+     *
+     * The function checks if a given key exists in a collection.
+     * @param {K} key - The parameter "key" is of type K, which means it can be any type. It represents
+     * the key that we want to check for existence in the data structure.
+     * @returns a boolean value. It returns true if the key is found in the collection, and false
+     * otherwise.
+     */
+    has(key) {
+        for (const item of this) {
+            const [itemKey] = item;
+            if (itemKey === key)
+                return true;
+        }
+        return false;
+    }
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(1)
+     */
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(1)
+     *
+     * The function checks if a given value exists in a collection.
+     * @param {V} value - The parameter "value" is the value that we want to check if it exists in the
+     * collection.
+     * @returns a boolean value, either true or false.
+     */
+    hasValue(value) {
+        for (const [, elementValue] of this) {
+            if (elementValue === value)
+                return true;
+        }
+        return false;
+    }
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(1)
+     */
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(1)
+     *
+     * The `get` function retrieves the value associated with a given key from a collection.
+     * @param {K} key - K (the type of the key) - This parameter represents the key that is being
+     * searched for in the collection.
+     * @returns The `get` method returns the value associated with the specified key if it exists in the
+     * collection, otherwise it returns `undefined`.
+     */
+    get(key) {
+        for (const item of this) {
+            const [itemKey, value] = item;
+            if (itemKey === key)
+                return value;
+        }
+        return;
+    }
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -172,13 +266,6 @@ class IterableEntryBase {
         }
         return accumulator;
     }
-    hasValue(value) {
-        for (const [, elementValue] of this) {
-            if (elementValue === value)
-                return true;
-        }
-        return false;
-    }
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -297,6 +384,55 @@ class IterableElementBase {
             callbackfn.call(thisArg, item, index++, this);
         }
     }
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(1)
+     */
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(1)
+     *
+     * The `find` function iterates over the elements of an array-like object and returns the first
+     * element that satisfies the provided callback function.
+     * @param callbackfn - The callbackfn parameter is a function that will be called for each element in
+     * the array. It takes three arguments: the current element being processed, the index of the current
+     * element, and the array itself. The function should return a boolean value indicating whether the
+     * current element matches the desired condition.
+     * @param {any} [thisArg] - The `thisArg` parameter is an optional argument that specifies the value
+     * to be used as `this` when executing the `callbackfn` function. If `thisArg` is provided, it will
+     * be passed as the `this` value to the `callbackfn` function. If `thisArg
+     * @returns The `find` method returns the first element in the array that satisfies the provided
+     * callback function. If no element satisfies the callback function, `undefined` is returned.
+     */
+    find(callbackfn, thisArg) {
+        let index = 0;
+        for (const item of this) {
+            if (callbackfn.call(thisArg, item, index++, this))
+                return item;
+        }
+        return;
+    }
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(1)
+     */
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(1)
+     *
+     * The function checks if a given element exists in a collection.
+     * @param {E} element - The parameter "element" is of type E, which means it can be any type. It
+     * represents the element that we want to check for existence in the collection.
+     * @returns a boolean value. It returns true if the element is found in the collection, and false
+     * otherwise.
+     */
+    has(element) {
+        for (const ele of this) {
+            if (ele === element)
+                return true;
+        }
+        return false;
+    }
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)

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

@@ -8,7 +8,7 @@
 import { BST, BSTNode } from './bst';
 import type { AVLTreeNested, AVLTreeNodeNested, AVLTreeOptions, BinaryTreeDeleteResult, BSTNKeyOrNode, BTNCallback, KeyOrNodeOrEntry } from '../../types';
 import { IBinaryTree } from '../../interfaces';
-export declare class AVLTreeNode<K = any, V = any, N extends AVLTreeNode<K, V, N> = AVLTreeNodeNested<K, V>> extends BSTNode<K, V, N> {
+export declare class AVLTreeNode<K = any, V = any, NODE extends AVLTreeNode<K, V, NODE> = AVLTreeNodeNested<K, V>> extends BSTNode<K, V, NODE> {
     height: number;
     constructor(key: K, value?: V);
 }
@@ -21,27 +21,27 @@ export declare class AVLTreeNode<K = any, V = any, N extends AVLTreeNode<K, V, N
  * 6. Complex Insertions and Deletions: Due to rebalancing, these operations are more complex than in a regular BST.
  * 7. Path Length: The path length from the root to any leaf is longer compared to an unbalanced BST, but shorter than a linear chain of nodes.
  */
-export declare class AVLTree<K = any, V = any, N extends AVLTreeNode<K, V, N> = AVLTreeNode<K, V, AVLTreeNodeNested<K, V>>, TREE extends AVLTree<K, V, N, TREE> = AVLTree<K, V, N, AVLTreeNested<K, V, N>>> extends BST<K, V, N, TREE> implements IBinaryTree<K, V, N, TREE> {
+export declare class AVLTree<K = any, V = any, NODE extends AVLTreeNode<K, V, NODE> = AVLTreeNode<K, V, AVLTreeNodeNested<K, V>>, TREE extends AVLTree<K, V, NODE, TREE> = AVLTree<K, V, NODE, AVLTreeNested<K, V, NODE>>> extends BST<K, V, NODE, TREE> implements IBinaryTree<K, V, NODE, TREE> {
     /**
      * 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
      * behavior of the AVL tree. It is of type `Partial<AVLTreeOptions>`, which means that you can
      * provide only a subset of the properties defined in the `AVLTreeOptions` interface.
      */
-    constructor(keysOrNodesOrEntries?: Iterable<KeyOrNodeOrEntry<K, V, N>>, options?: AVLTreeOptions<K>);
+    constructor(keysOrNodesOrEntries?: Iterable<KeyOrNodeOrEntry<K, V, NODE>>, options?: AVLTreeOptions<K>);
     /**
      * The function creates a new AVL tree node with the specified key and value.
      * @param {K} key - The key parameter is the key value that will be associated with
      * 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: K, value?: V): N;
+    createNode(key: K, value?: V): NODE;
     /**
      * The function creates a new AVL tree with the specified options and returns it.
      * @param {AVLTreeOptions} [options] - The `options` parameter is an optional object that can be
@@ -52,10 +52,10 @@ export declare class AVLTree<K = any, V = any, N extends AVLTreeNode<K, V, N> =
     createTree(options?: AVLTreeOptions<K>): TREE;
     /**
      * 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: KeyOrNodeOrEntry<K, V, N>): keyOrNodeOrEntry is N;
+    isNode(keyOrNodeOrEntry: KeyOrNodeOrEntry<K, V, NODE>): keyOrNodeOrEntry is NODE;
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -73,7 +73,7 @@ export declare class AVLTree<K = any, V = any, N extends AVLTreeNode<K, V, N> =
      * being added to the binary tree.
      * @returns The method is returning either the inserted node or undefined.
      */
-    add(keyOrNodeOrEntry: KeyOrNodeOrEntry<K, V, N>, value?: V): boolean;
+    add(keyOrNodeOrEntry: KeyOrNodeOrEntry<K, V, NODE>, value?: V): boolean;
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -90,40 +90,38 @@ export declare class AVLTree<K = any, V = any, N extends AVLTreeNode<K, V, N> =
      * @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<C extends BTNCallback<N>>(identifier: ReturnType<C>, callback?: C): BinaryTreeDeleteResult<N>[];
+    delete<C extends BTNCallback<NODE>>(identifier: ReturnType<C>, callback?: C): BinaryTreeDeleteResult<NODE>[];
     /**
      * 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.
      */
-    protected _swapProperties(srcNode: BSTNKeyOrNode<K, N>, destNode: BSTNKeyOrNode<K, N>): N | undefined;
+    protected _swapProperties(srcNode: BSTNKeyOrNode<K, NODE>, destNode: BSTNKeyOrNode<K, NODE>): NODE | undefined;
     /**
      * 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.
      */
-    protected _balanceFactor(node: N): number;
+    protected _balanceFactor(node: NODE): number;
     /**
      * 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)
@@ -131,37 +129,33 @@ export declare class AVLTree<K = any, V = any, N extends AVLTreeNode<K, V, N> =
      *
      * 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.
      */
-    protected _updateHeight(node: N): void;
+    protected _updateHeight(node: NODE): void;
     /**
-     * Time Complexity: O(log n)
+     * Time Complexity: O(1)
      * 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)
+     * Time Complexity: O(1)
      * 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.
+     * The function `_balanceLL` performs a left-left rotation to balance a binary tree.
+     * @param {NODE} A - A is a node in a binary tree.
      */
-    protected _balancePath(node: KeyOrNodeOrEntry<K, V, N>): void;
+    protected _balanceLL(A: NODE): void;
     /**
      * 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.
+     * The `_balanceLR` function performs a left-right rotation to balance a binary tree.
+     * @param {NODE} A - A is a node in a binary tree.
      */
-    protected _balanceLL(A: N): void;
+    protected _balanceLR(A: NODE): void;
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -170,10 +164,10 @@ export declare class AVLTree<K = any, V = any, N extends AVLTreeNode<K, V, N> =
      * Time Complexity: O(1)
      * 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.
+     * The function `_balanceRR` performs a right-right rotation to balance a binary tree.
+     * @param {NODE} A - A is a node in a binary tree.
      */
-    protected _balanceLR(A: N): void;
+    protected _balanceRR(A: NODE): void;
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -182,21 +176,24 @@ export declare class AVLTree<K = any, V = any, N extends AVLTreeNode<K, V, N> =
      * Time Complexity: O(1)
      * 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.
+     * The function `_balanceRL` performs a right-left rotation to balance a binary tree.
+     * @param {NODE} A - A is a node in a binary tree.
      */
-    protected _balanceRR(A: N): void;
+    protected _balanceRL(A: NODE): void;
     /**
-     * Time Complexity: O(1)
+     * 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(1)
+     * Time Complexity: O(log n)
      * 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.
+     * 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.
      */
-    protected _balanceRL(A: N): void;
-    protected _replaceNode(oldNode: N, newNode: N): N;
+    protected _balancePath(node: KeyOrNodeOrEntry<K, V, NODE>): void;
+    protected _replaceNode(oldNode: NODE, newNode: NODE): NODE;
 }