heap-typed 1.51.7 → 1.51.9

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

@@ -39,13 +39,20 @@ exports.AVLTreeMultiMapNode = AVLTreeMultiMapNode;
  * The only distinction between a AVLTreeMultiMap and a AVLTree lies in the ability of the former to store duplicate nodes through the utilization of counters.
  */
 class AVLTreeMultiMap extends avl_tree_1.AVLTree {
-    constructor(keysOrNodesOrEntries = [], options) {
+    /**
+     * The constructor initializes a new AVLTreeMultiMap object with optional initial elements.
+     * @param keysOrNodesOrEntriesOrRawElements - The `keysOrNodesOrEntriesOrRawElements` parameter is an
+     * iterable object that can contain either keys, nodes, entries, or raw elements.
+     * @param [options] - The `options` parameter is an optional object that can be used to customize the
+     * behavior of the AVLTreeMultiMap. It can include properties such as `compareKeys` and
+     * `compareValues` functions to define custom comparison logic for keys and values, respectively.
+     */
+    constructor(keysOrNodesOrEntriesOrRawElements = [], options) {
         super([], options);
         this._count = 0;
-        if (keysOrNodesOrEntries)
-            this.addMany(keysOrNodesOrEntries);
+        if (keysOrNodesOrEntriesOrRawElements)
+            this.addMany(keysOrNodesOrEntriesOrRawElements);
     }
-    // TODO the _count is not accurate after nodes count modified
     /**
      * The function calculates the sum of the count property of all nodes in a tree using depth-first
      * search.
@@ -72,13 +79,15 @@ class AVLTreeMultiMap extends avl_tree_1.AVLTree {
         return sum;
     }
     /**
-     * The function creates a new BSTNode with the given key, value, and count.
-     * @param {K} key - The key parameter is the unique identifier for the binary tree node. It is used to
-     * distinguish one node from another in the tree.
-     * @param {NODE} value - The `value` parameter represents the value that will be stored in the binary search tree node.
-     * @param {number} [count] - The "count" parameter is an optional parameter of type number. It represents the number of
-     * occurrences of the value in the binary search tree node. If not provided, the count will default to 1.
-     * @returns A new instance of the BSTNode class with the specified key, value, and count (if provided).
+     * The function creates a new AVLTreeMultiMapNode with the specified key, value, and count.
+     * @param {K} key - The key parameter represents the key of the node being created. It is of type K,
+     * which is a generic type that can be replaced with any specific type when using the function.
+     * @param {V} [value] - The `value` parameter is an optional parameter that represents the value
+     * associated with the key in the node. It is of type `V`, which can be any data type.
+     * @param {number} [count] - The `count` parameter represents the number of occurrences of a
+     * key-value pair in the AVLTreeMultiMapNode. It is an optional parameter, so it can be omitted when
+     * calling the `createNode` method. If provided, it specifies the initial count for the node.
+     * @returns a new instance of the AVLTreeMultiMapNode class, casted as NODE.
      */
     createNode(key, value, count) {
         return new AVLTreeMultiMapNode(key, value, count);
@@ -86,59 +95,55 @@ class AVLTreeMultiMap extends avl_tree_1.AVLTree {
     /**
      * The function creates a new AVLTreeMultiMap object with the specified options and returns it.
      * @param [options] - The `options` parameter is an optional object that contains additional
-     * configuration options for creating the `AVLTreeMultiMap` object. It can include properties such as
-     * `iterationType` and `variant`, which are used to specify the type of iteration and the variant of
-     * the tree, respectively. These properties can be
-     * @returns a new instance of the `AVLTreeMultiMap` class, with the provided options merged with the
-     * default options. The returned value is casted as `TREE`.
+     * configuration options for creating the AVLTreeMultiMap. It can have the following properties:
+     * @returns a new instance of the AVLTreeMultiMap class, with the specified options, as a TREE
+     * object.
      */
     createTree(options) {
-        return new AVLTreeMultiMap([], Object.assign({ iterationType: this.iterationType, variant: this.variant }, options));
+        return new AVLTreeMultiMap([], Object.assign({ iterationType: this.iterationType, comparator: this.comparator }, options));
+    }
+    /**
+     * The function checks if the input is an instance of AVLTreeMultiMapNode.
+     * @param {R | KeyOrNodeOrEntry<K, V, NODE>} keyOrNodeOrEntryOrRawElement - The parameter
+     * `keyOrNodeOrEntryOrRawElement` can be of type `R` or `KeyOrNodeOrEntry<K, V, NODE>`.
+     * @returns a boolean value indicating whether the input parameter `keyOrNodeOrEntryOrRawElement` is
+     * an instance of the `AVLTreeMultiMapNode` class.
+     */
+    isNode(keyOrNodeOrEntryOrRawElement) {
+        return keyOrNodeOrEntryOrRawElement instanceof AVLTreeMultiMapNode;
     }
     /**
-     * The function `keyValueOrEntryToNode` converts an keyOrNodeOrEntry object into a node object.
-     * @param keyOrNodeOrEntry - The `keyOrNodeOrEntry` parameter is of type `KeyOrNodeOrEntry<K, V, NODE>`, 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,
-     * it defaults to `undefined`.
+     * The function `keyValueOrEntryOrRawElementToNode` converts a key, value, entry, or raw element into
+     * a node object.
+     * @param {R | KeyOrNodeOrEntry<K, V, NODE>} keyOrNodeOrEntryOrRawElement - The
+     * `keyOrNodeOrEntryOrRawElement` parameter can be of type `R` or `KeyOrNodeOrEntry<K, V, NODE>`.
+     * @param {V} [value] - The `value` parameter is an optional value that can be passed to the
+     * `override` function. It represents the value associated with the key in the data structure. If no
+     * value is provided, it will default to `undefined`.
      * @param [count=1] - The `count` parameter is an optional parameter that specifies the number of
-     * times the value should be added to the node. If not provided, it defaults to 1.
-     * @returns a node of type `NODE` or `undefined`.
+     * times the key-value pair should be added to the data structure. If not provided, it defaults to 1.
+     * @returns either a NODE object or undefined.
      */
-    keyValueOrEntryToNode(keyOrNodeOrEntry, value, count = 1) {
-        let node;
-        if (keyOrNodeOrEntry === undefined || keyOrNodeOrEntry === null) {
+    keyValueOrEntryOrRawElementToNode(keyOrNodeOrEntryOrRawElement, value, count = 1) {
+        if (keyOrNodeOrEntryOrRawElement === undefined || keyOrNodeOrEntryOrRawElement === null)
             return;
+        if (this.isNode(keyOrNodeOrEntryOrRawElement))
+            return keyOrNodeOrEntryOrRawElement;
+        if (this.toEntryFn) {
+            const [key, entryValue] = this.toEntryFn(keyOrNodeOrEntryOrRawElement);
+            if (key)
+                return this.createNode(key, entryValue !== null && entryValue !== void 0 ? entryValue : value, count);
         }
-        else if (this.isNode(keyOrNodeOrEntry)) {
-            node = keyOrNodeOrEntry;
-        }
-        else if (this.isEntry(keyOrNodeOrEntry)) {
-            const [key, value] = keyOrNodeOrEntry;
-            if (key === undefined || key === null) {
+        if (this.isEntry(keyOrNodeOrEntryOrRawElement)) {
+            const [key, value] = keyOrNodeOrEntryOrRawElement;
+            if (key === undefined || key === null)
                 return;
-            }
-            else {
-                node = this.createNode(key, value, count);
-            }
+            else
+                return this.createNode(key, value, count);
         }
-        else if (!this.isNode(keyOrNodeOrEntry)) {
-            node = this.createNode(keyOrNodeOrEntry, value, count);
-        }
-        else {
-            return;
-        }
-        return node;
-    }
-    /**
-     * The function checks if an keyOrNodeOrEntry is an instance of the AVLTreeMultiMapNode class.
-     * @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 AVLTreeMultiMapNode
-     * class.
-     */
-    isNode(keyOrNodeOrEntry) {
-        return keyOrNodeOrEntry instanceof AVLTreeMultiMapNode;
+        if (this.isKey(keyOrNodeOrEntryOrRawElement))
+            return this.createNode(keyOrNodeOrEntryOrRawElement, value, count);
+        return;
     }
     /**
      * Time Complexity: O(log n)
@@ -148,20 +153,21 @@ class AVLTreeMultiMap extends avl_tree_1.AVLTree {
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
      *
-     * The function overrides the add method of a binary tree node and adds a new node to the tree.
-     * @param keyOrNodeOrEntry - The `keyOrNodeOrEntry` parameter can be either a key, a node, or an
-     * entry. It represents the key, node, or entry that you want to add to the binary tree.
+     * The function overrides the add method of a TypeScript class to add a new node to a data structure
+     * and update the count.
+     * @param {R | KeyOrNodeOrEntry<K, V, NODE>} keyOrNodeOrEntryOrRawElement - The
+     * `keyOrNodeOrEntryOrRawElement` parameter can accept a value of type `R`, which can be any type. It
+     * can also accept a value of type `KeyOrNodeOrEntry<K, V, NODE>`, which represents a key, node,
+     * entry, or raw element
      * @param {V} [value] - The `value` parameter represents the value associated with the key in the
-     * binary tree node. It is an optional parameter, meaning it can be omitted when calling the `add`
-     * method.
+     * data structure. It is an optional parameter, so it can be omitted if not needed.
      * @param [count=1] - The `count` parameter represents the number of times the key-value pair should
-     * be added to the binary tree. By default, it is set to 1, meaning that the key-value pair will be
-     * added once. However, you can specify a different value for `count` if you want to add
-     * @returns The method is returning either the newly inserted node or `undefined` if the insertion
-     * was not successful.
+     * be added to the data structure. By default, it is set to 1, meaning that the key-value pair will
+     * be added once. However, you can specify a different value for `count` if you want to add
+     * @returns a boolean value.
      */
-    add(keyOrNodeOrEntry, value, count = 1) {
-        const newNode = this.keyValueOrEntryToNode(keyOrNodeOrEntry, value, count);
+    add(keyOrNodeOrEntryOrRawElement, value, count = 1) {
+        const newNode = this.keyValueOrEntryOrRawElementToNode(keyOrNodeOrEntryOrRawElement, value, count);
         if (newNode === undefined)
             return false;
         const orgNodeCount = (newNode === null || newNode === void 0 ? void 0 : newNode.count) || 0;
@@ -179,19 +185,19 @@ class AVLTreeMultiMap extends avl_tree_1.AVLTree {
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
      *
-     * The `delete` function in TypeScript is used to remove a node from a binary tree, taking into
-     * account the count of the node and balancing the tree if necessary.
-     * @param identifier - The identifier is the value or key that is used to identify the node that
-     * needs to be deleted from the binary tree. It can be of any type that is returned by the callback
+     * The `delete` function in a binary tree data structure deletes a node based on its identifier and
+     * returns the deleted node along with the parent node that needs to be balanced.
+     * @param identifier - The identifier parameter is the value used to identify the node that needs to
+     * be deleted from the binary tree. It can be of any type and is the return type of the callback
      * function.
-     * @param {C} callback - The `callback` parameter is a function that is used to determine if a node
-     * should be deleted. It is optional and defaults to a default callback function. The `callback`
-     * function takes one parameter, which is the identifier of the node, and returns a value that is
-     * used to identify the node to
+     * @param {C} callback - The `callback` parameter is a function that is used to determine the
+     * equality of nodes in the binary tree. It is optional and has a default value of
+     * `this._DEFAULT_CALLBACK`. The `callback` function takes a single argument, which is the identifier
+     * of a node, and returns a value that
      * @param [ignoreCount=false] - A boolean flag indicating whether to ignore the count of the node
      * 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
+     * deleted regardless of its count. If set to false (default), the count of the node will be taken
+     * into account and the node
      * @returns an array of `BinaryTreeDeleteResult<NODE>`.
      */
     delete(identifier, callback = this._DEFAULT_CALLBACK, ignoreCount = false) {
@@ -261,7 +267,8 @@ class AVLTreeMultiMap extends avl_tree_1.AVLTree {
      * Time Complexity: O(1)
      * Space Complexity: O(1)
      *
-     * The clear() function clears the contents of a data structure and sets the count to zero.
+     * The "clear" function overrides the parent class's "clear" function and also resets the count to
+     * zero.
      */
     clear() {
         super.clear();
@@ -274,13 +281,14 @@ class AVLTreeMultiMap extends avl_tree_1.AVLTree {
     /**
      * Time Complexity: O(n log n)
      * Space Complexity: O(log n)
-     *
      * The `perfectlyBalance` function takes a sorted array of nodes and builds a balanced binary search
      * tree using either a recursive or iterative approach.
-     * @param iterationType - The `iterationType` parameter is an optional parameter that specifies the
-     * type of iteration to use when building the balanced binary search tree. It can have two possible
-     * values:
-     * @returns a boolean value.
+     * @param {IterationType} iterationType - The `iterationType` parameter is an optional parameter that
+     * specifies the type of iteration to use when building the balanced binary search tree. It has a
+     * default value of `this.iterationType`, which means it will use the iteration type currently set in
+     * the object.
+     * @returns The function `perfectlyBalance` returns a boolean value. It returns `true` if the
+     * balancing operation is successful, and `false` if there are no nodes to balance.
      */
     perfectlyBalance(iterationType = this.iterationType) {
         const sorted = this.dfs(node => node, 'IN'), n = sorted.length;
@@ -326,7 +334,7 @@ class AVLTreeMultiMap extends avl_tree_1.AVLTree {
      * Time complexity: O(n)
      * Space complexity: O(n)
      *
-     * The `clone` function creates a deep copy of a tree object.
+     * The function overrides the clone method to create a deep copy of a tree object.
      * @returns The `clone()` method is returning a cloned instance of the `TREE` object.
      */
     clone() {
@@ -335,13 +343,21 @@ class AVLTreeMultiMap extends avl_tree_1.AVLTree {
         return cloned;
     }
     /**
-     * The `_swapProperties` function swaps the key, value, count, and height properties between two nodes.
-     * @param {K | NODE | undefined} srcNode - The `srcNode` parameter represents the source node from
-     * which the values will be swapped. 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.
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     */
+    /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     *
+     * The `_swapProperties` function swaps the properties (key, value, count, height) between two nodes
+     * in a binary search tree.
+     * @param {R | BSTNKeyOrNode<K, NODE>} srcNode - The `srcNode` parameter represents the source node
+     * that will be swapped with the `destNode`.
+     * @param {R | BSTNKeyOrNode<K, NODE>} destNode - The `destNode` parameter represents the destination
+     * node where the properties will be swapped with the source node.
+     * @returns The method is returning the `destNode` after swapping its properties with the `srcNode`.
+     * If either `srcNode` or `destNode` is undefined, it returns `undefined`.
      */
     _swapProperties(srcNode, destNode) {
         srcNode = this.ensureNode(srcNode);
@@ -365,12 +381,19 @@ class AVLTreeMultiMap extends avl_tree_1.AVLTree {
         return undefined;
     }
     /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     */
+    /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     *
      * The function replaces an old node with a new node and updates the count property of the new node.
-     * @param {NODE} oldNode - The `oldNode` parameter is of type `NODE` and represents the node that
-     * needs to be replaced in a data structure.
-     * @param {NODE} newNode - The `newNode` parameter is an object of type `NODE`.
+     * @param {NODE} oldNode - The oldNode parameter represents the node that needs to be replaced in the
+     * data structure. It is of type NODE.
+     * @param {NODE} newNode - The `newNode` parameter is an instance of the `NODE` class.
      * @returns The method is returning the result of calling the `_replaceNode` method from the
-     * superclass, after updating the `count` property of the `newNode` object.
+     * superclass, which is of type `NODE`.
      */
     _replaceNode(oldNode, newNode) {
         newNode.count = oldNode.count + newNode.count;

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

@@ -6,9 +6,10 @@
  * @license MIT License
  */
 import { BST, BSTNode } from './bst';
-import type { AVLTreeNested, AVLTreeNodeNested, AVLTreeOptions, BinaryTreeDeleteResult, BSTNKeyOrNode, BTNCallback, KeyOrNodeOrEntry } from '../../types';
+import type { AVLTreeNested, AVLTreeNodeNested, AVLTreeOptions, BinaryTreeDeleteResult, BSTNKeyOrNode, BTNCallback, Comparable, KeyOrNodeOrEntry } from '../../types';
+import { BTNEntry } from '../../types';
 import { IBinaryTree } from '../../interfaces';
-export declare class AVLTreeNode<K = any, V = any, NODE extends AVLTreeNode<K, V, NODE> = AVLTreeNodeNested<K, V>> extends BSTNode<K, V, NODE> {
+export declare class AVLTreeNode<K extends Comparable, V = any, NODE extends AVLTreeNode<K, V, NODE> = AVLTreeNodeNested<K, V>> extends BSTNode<K, V, NODE> {
     /**
      * The constructor function initializes a new instance of a class with a key and an optional value,
      * and sets the height property to 0.
@@ -40,25 +41,27 @@ export declare class AVLTreeNode<K = any, V = any, NODE extends AVLTreeNode<K, V
  * 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, 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, 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, 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 `NODE`.
-     * @returns a new AVLTreeNode object with the specified key and value.
+export declare class AVLTree<K extends Comparable, V = any, R = BTNEntry<K, V>, NODE extends AVLTreeNode<K, V, NODE> = AVLTreeNode<K, V, AVLTreeNodeNested<K, V>>, TREE extends AVLTree<K, V, R, NODE, TREE> = AVLTree<K, V, R, NODE, AVLTreeNested<K, V, R, NODE>>> extends BST<K, V, R, NODE, TREE> implements IBinaryTree<K, V, R, NODE, TREE> {
+    /**
+     * This is a constructor function for an AVLTree class that initializes the tree with keys, nodes,
+     * entries, or raw elements.
+     * @param keysOrNodesOrEntriesOrRawElements - The `keysOrNodesOrEntriesOrRawElements` parameter is an
+     * iterable object that can contain either keys, nodes, entries, or raw elements. These elements will
+     * be used to initialize the AVLTree.
+     * @param [options] - The `options` parameter is an optional object that can be used to customize the
+     * behavior of the AVLTree. It can include properties such as `compareFn` (a function used to compare
+     * keys), `allowDuplicates` (a boolean indicating whether duplicate keys are allowed), and
+     * `nodeBuilder` (
+     */
+    constructor(keysOrNodesOrEntriesOrRawElements?: Iterable<R | KeyOrNodeOrEntry<K, V, NODE>>, options?: AVLTreeOptions<K, V, R>);
+    /**
+     * The function creates a new AVL tree node with the given key and value.
+     * @param {K} key - The key parameter is of type K, which represents the key of the node being
+     * created.
+     * @param {V} [value] - The "value" parameter is an optional parameter of type V. It represents the
+     * value associated with the key in the node being created.
+     * @returns The method is returning a new instance of the AVLTreeNode class, casted as the generic
+     * type NODE.
      */
     createNode(key: K, value?: V): NODE;
     /**
@@ -68,13 +71,15 @@ export declare class AVLTree<K = any, V = any, NODE extends AVLTreeNode<K, V, NO
      * being created.
      * @returns a new AVLTree object.
      */
-    createTree(options?: AVLTreeOptions<K>): TREE;
+    createTree(options?: AVLTreeOptions<K, V, R>): TREE;
     /**
-     * The function checks if an keyOrNodeOrEntry is an instance of AVLTreeNode.
-     * @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.
+     * The function checks if the input is an instance of AVLTreeNode.
+     * @param {R | KeyOrNodeOrEntry<K, V, NODE>} keyOrNodeOrEntryOrRawElement - The parameter
+     * `keyOrNodeOrEntryOrRawElement` can be of type `R` or `KeyOrNodeOrEntry<K, V, NODE>`.
+     * @returns a boolean value indicating whether the input parameter `keyOrNodeOrEntryOrRawElement` is
+     * an instance of the `AVLTreeNode` class.
      */
-    isNode(keyOrNodeOrEntry: KeyOrNodeOrEntry<K, V, NODE>): keyOrNodeOrEntry is NODE;
+    isNode(keyOrNodeOrEntryOrRawElement: R | KeyOrNodeOrEntry<K, V, NODE>): keyOrNodeOrEntryOrRawElement is NODE;
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -84,15 +89,16 @@ export declare class AVLTree<K = any, V = any, NODE extends AVLTreeNode<K, V, NO
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
      *
-     * The function overrides the add method of a binary tree node and balances the tree after inserting
-     * a new node.
-     * @param keyOrNodeOrEntry - The `keyOrNodeOrEntry` parameter can be either a key, a node, or an
-     * entry.
-     * @param {V} [value] - The `value` parameter represents the value associated with the key that is
-     * being added to the binary tree.
-     * @returns The method is returning either the inserted node or undefined.
+     * The function overrides the add method of a class and inserts a key-value pair into a data
+     * structure, then balances the path.
+     * @param {R | KeyOrNodeOrEntry<K, V, NODE>} keyOrNodeOrEntryOrRawElement - The parameter
+     * `keyOrNodeOrEntryOrRawElement` can accept values of type `R`, `KeyOrNodeOrEntry<K, V, NODE>`, or
+     * `RawElement`.
+     * @param {V} [value] - The `value` parameter is an optional value that you want to associate with
+     * the key or node being added to the data structure.
+     * @returns The method is returning a boolean value.
      */
-    add(keyOrNodeOrEntry: KeyOrNodeOrEntry<K, V, NODE>, value?: V): boolean;
+    add(keyOrNodeOrEntryOrRawElement: R | KeyOrNodeOrEntry<K, V, NODE>, value?: V): boolean;
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -101,29 +107,34 @@ export declare class AVLTree<K = any, V = any, NODE extends AVLTreeNode<K, V, NO
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
      *
-     * The function overrides the delete method of a binary tree, performs the deletion, and then
-     * balances the tree if necessary.
+     * The function overrides the delete method of a binary tree class and performs additional operations
+     * to balance the tree after deletion.
      * @param identifier - The `identifier` parameter is the value or condition used to identify the
-     * node(s) to be deleted from the binary tree. It can be of any type and is the return type of the
-     * `callback` function.
-     * @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 `_DEFAULT_CALLBACK` function. The `callback` function should have a single
-     * parameter of type `NODE
-     * @returns The method is returning an array of `BinaryTreeDeleteResult<NODE>`.
+     * node(s) to be deleted from the binary tree. It can be of any type that is compatible with the
+     * binary tree's node type.
+     * @param {C} callback - The `callback` parameter is a function that will be used to determine if a
+     * node should be deleted or not. It is optional and has a default value of `this._DEFAULT_CALLBACK`.
+     * @returns The method is returning an array of BinaryTreeDeleteResult<NODE> objects.
      */
     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 | 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.
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
      */
-    protected _swapProperties(srcNode: BSTNKeyOrNode<K, NODE>, destNode: BSTNKeyOrNode<K, NODE>): NODE | undefined;
+    /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     *
+     * The `_swapProperties` function swaps the key, value, and height properties between two nodes in a
+     * binary search tree.
+     * @param {R | BSTNKeyOrNode<K, NODE>} srcNode - The `srcNode` parameter represents either a node
+     * object (`NODE`) or a key-value pair (`R`) that is being swapped with another node.
+     * @param {R | BSTNKeyOrNode<K, NODE>} destNode - The `destNode` parameter is either an instance of
+     * `R` or an instance of `BSTNKeyOrNode<K, NODE>`.
+     * @returns The method is returning the `destNodeEnsured` object if both `srcNodeEnsured` and
+     * `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)
@@ -133,7 +144,8 @@ export declare class AVLTree<K = any, V = any, NODE extends AVLTreeNode<K, V, NO
      * Space Complexity: O(1)
      *
      * The function calculates the balance factor of a node in a binary tree.
-     * @param {NODE} node - The parameter "node" represents a node in a binary tree data structure.
+     * @param {NODE} node - The parameter "node" is of type "NODE", which likely 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.
      */
@@ -159,7 +171,7 @@ export declare class AVLTree<K = any, V = any, NODE extends AVLTreeNode<K, V, NO
      * Time Complexity: O(1)
      * Space Complexity: O(1)
      *
-     * The function `_balanceLL` performs a left-left rotation to balance a binary tree.
+     * The `_balanceLL` function performs a left-left rotation to balance a binary search tree.
      * @param {NODE} A - A is a node in a binary tree.
      */
     protected _balanceLL(A: NODE): void;
@@ -210,18 +222,26 @@ export declare class AVLTree<K = any, V = any, NODE extends AVLTreeNode<K, V, NO
      *
      * 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.
+     * @param {R | KeyOrNodeOrEntry<K, V, NODE>} node - The `node` parameter can be of type `R` or
+     * `KeyOrNodeOrEntry<K, V, NODE>`.
      */
-    protected _balancePath(node: KeyOrNodeOrEntry<K, V, NODE>): void;
+    protected _balancePath(node: R | KeyOrNodeOrEntry<K, V, NODE>): void;
     /**
-     * The function replaces an old node with a new node while preserving the height of the old node.
-     * @param {NODE} oldNode - The `oldNode` parameter is the node that you want to replace with the
-     * `newNode`.
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     */
+    /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     *
+     * The function replaces an old node with a new node and sets the height of the new node to be the
+     * same as the old node.
+     * @param {NODE} oldNode - The `oldNode` parameter represents the node that needs to be replaced in
+     * the data structure.
      * @param {NODE} newNode - The `newNode` parameter is the new node that will replace the `oldNode` in
      * the data structure.
-     * @returns the result of calling the `_replaceNode` method on the superclass, passing in the
-     * `oldNode` and `newNode` as arguments.
+     * @returns The method is returning the result of calling the `_replaceNode` method from the
+     * superclass, with the `oldNode` and `newNode` as arguments.
      */
     protected _replaceNode(oldNode: NODE, newNode: NODE): NODE;
 }