graph-typed 1.53.9 → 1.54.0

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

@@ -5,7 +5,7 @@
  * @copyright Copyright (c) 2022 Pablo Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-import type { AVLTreeMultiMapNodeNested, AVLTreeMultiMapOptions, BinaryTreeDeleteResult, BSTNOptKeyOrNode, BTNRep, EntryCallback, IterationType } from '../../types';
+import type { AVLTreeMultiMapNested, AVLTreeMultiMapNodeNested, AVLTreeMultiMapOptions, BinaryTreeDeleteResult, BSTNOptKeyOrNode, BTNRep, EntryCallback, IterationType } from '../../types';
 import { IBinaryTree } from '../../interfaces';
 import { AVLTree, AVLTreeNode } from './avl-tree';
 export declare class AVLTreeMultiMapNode<K = any, V = any, NODE extends AVLTreeMultiMapNode<K, V, NODE> = AVLTreeMultiMapNodeNested<K, V>> extends AVLTreeNode<K, V, NODE> {
@@ -20,23 +20,11 @@ export declare class AVLTreeMultiMapNode<K = any, V = any, NODE extends AVLTreeM
      * parameter when creating a new instance of the `BinaryTreeNode` class.
      */
     constructor(key: K, value?: V, count?: number);
-    protected _count: number;
-    /**
-     * The function returns the value of the protected variable _count.
-     * @returns The count property of the object, which is of type number.
-     */
-    get count(): number;
-    /**
-     * The above function sets the value of the count property.
-     * @param {number} value - The value parameter is of type number, which means it can accept any
-     * numeric value.
-     */
-    set count(value: number);
 }
 /**
  * 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.
  */
-export declare class AVLTreeMultiMap<K = any, V = any, R = object, NODE extends AVLTreeMultiMapNode<K, V, NODE> = AVLTreeMultiMapNode<K, V, AVLTreeMultiMapNodeNested<K, V>>> extends AVLTree<K, V, R, NODE> implements IBinaryTree<K, V, R, NODE> {
+export declare class AVLTreeMultiMap<K = any, V = any, R = object, MK = any, MV = any, MR = object, NODE extends AVLTreeMultiMapNode<K, V, NODE> = AVLTreeMultiMapNode<K, V, AVLTreeMultiMapNodeNested<K, V>>, TREE extends AVLTreeMultiMap<K, V, R, MK, MV, MR, NODE, TREE> = AVLTreeMultiMap<K, V, R, MK, MV, MR, NODE, AVLTreeMultiMapNested<K, V, R, MK, MV, MR, NODE>>> extends AVLTree<K, V, R, MK, MV, MR, NODE, TREE> implements IBinaryTree<K, V, R, MK, MV, MR, NODE, TREE> {
     /**
      * The constructor initializes a new AVLTreeMultiMap object with optional initial elements.
      * @param keysNodesEntriesOrRaws - The `keysNodesEntriesOrRaws` parameter is an
@@ -81,7 +69,7 @@ export declare class AVLTreeMultiMap<K = any, V = any, R = object, NODE extends
      * @returns a new instance of the AVLTreeMultiMap class, with the specified options, as a TREE
      * object.
      */
-    createTree(options?: AVLTreeMultiMapOptions<K, V, R>): AVLTreeMultiMap<K, V, R, NODE>;
+    createTree(options?: AVLTreeMultiMapOptions<K, V, R>): TREE;
     /**
      * The function checks if the input is an instance of AVLTreeMultiMapNode.
      * @param {BTNRep<K, V, NODE> | R} keyNodeEntryOrRaw - The parameter
@@ -156,7 +144,7 @@ export declare class AVLTreeMultiMap<K = any, V = any, R = object, NODE extends
      * 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(): AVLTreeMultiMap<K, V, R, NODE>;
+    clone(): TREE;
     /**
      * The `map` function in TypeScript overrides the default behavior to create a new AVLTreeMultiMap
      * with modified entries based on a provided callback.
@@ -175,7 +163,7 @@ export declare class AVLTreeMultiMap<K = any, V = any, R = object, NODE extends
      * `callback` function along with the index and the original tree itself. The transformed entries are
      * then added to the new `AVLTreeMultiMap` instance, which is returned at the end.
      */
-    map<MK, MV, MR>(callback: EntryCallback<K, V | undefined, [MK, MV]>, options?: AVLTreeMultiMapOptions<MK, MV, MR>, thisArg?: any): AVLTreeMultiMap<MK, MV, MR, AVLTreeMultiMapNode<MK, MV, AVLTreeMultiMapNodeNested<MK, MV>>>;
+    map<MK, MV, MR>(callback: EntryCallback<K, V | undefined, [MK, MV]>, options?: AVLTreeMultiMapOptions<MK, MV, MR>, thisArg?: any): AVLTreeMultiMap<MK, MV, MR>;
     /**
      * The function `keyValueNodeEntryRawToNodeAndValue` converts a key, value, entry, or raw element into
      * a node object.

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

@@ -15,24 +15,8 @@ class AVLTreeMultiMapNode extends avl_tree_1.AVLTreeNode {
      */
     constructor(key, value, count = 1) {
         super(key, value);
-        this._count = 1;
         this.count = count;
     }
-    /**
-     * The function returns the value of the protected variable _count.
-     * @returns The count property of the object, which is of type number.
-     */
-    get count() {
-        return this._count;
-    }
-    /**
-     * The above function sets the value of the count property.
-     * @param {number} value - The value parameter is of type number, which means it can accept any
-     * numeric value.
-     */
-    set count(value) {
-        this._count = value;
-    }
 }
 exports.AVLTreeMultiMapNode = AVLTreeMultiMapNode;
 /**
@@ -95,7 +79,6 @@ class AVLTreeMultiMap extends avl_tree_1.AVLTree {
      * @returns a new instance of the AVLTreeMultiMap class, with the specified options, as a TREE
      * object.
      */
-    // @ts-ignore
     createTree(options) {
         return new AVLTreeMultiMap([], Object.assign({ iterationType: this.iterationType, isMapMode: this._isMapMode, specifyComparable: this._specifyComparable, toEntryFn: this._toEntryFn, isReverse: this._isReverse }, options));
     }
@@ -173,7 +156,7 @@ class AVLTreeMultiMap extends avl_tree_1.AVLTree {
         else {
             if (!curr.left) {
                 if (!parent) {
-                    if (curr.right !== undefined)
+                    if (curr.right !== undefined && curr.right !== null)
                         this._setRoot(curr.right);
                 }
                 else {
@@ -286,7 +269,6 @@ class AVLTreeMultiMap extends avl_tree_1.AVLTree {
      * 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.
      */
-    // @ts-ignore
     clone() {
         const cloned = this.createTree();
         if (this._isMapMode)
@@ -315,7 +297,6 @@ class AVLTreeMultiMap extends avl_tree_1.AVLTree {
      * `callback` function along with the index and the original tree itself. The transformed entries are
      * then added to the new `AVLTreeMultiMap` instance, which is returned at the end.
      */
-    // @ts-ignore
     map(callback, options, thisArg) {
         const newTree = new AVLTreeMultiMap([], options);
         let index = 0;

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

@@ -6,7 +6,7 @@
  * @license MIT License
  */
 import { BST, BSTNode } from './bst';
-import type { AVLTreeNodeNested, AVLTreeOptions, BinaryTreeDeleteResult, BSTNOptKeyOrNode, BTNRep, EntryCallback } from '../../types';
+import type { AVLTreeNested, AVLTreeNodeNested, AVLTreeOptions, BinaryTreeDeleteResult, BSTNOptKeyOrNode, BTNRep, EntryCallback } 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> {
     /**
@@ -18,18 +18,6 @@ export declare class AVLTreeNode<K = any, V = any, NODE extends AVLTreeNode<K, V
      * value associated with the key in the constructor.
      */
     constructor(key: K, value?: V);
-    protected _height: number;
-    /**
-     * The function returns the value of the height property.
-     * @returns The height of the object.
-     */
-    get height(): number;
-    /**
-     * The above function sets the value of the height property.
-     * @param {number} value - The value parameter is a number that represents the new height value to be
-     * set.
-     */
-    set height(value: number);
 }
 /**
  * 1. Height-Balanced: Each node's left and right subtrees differ in height by no more than one.
@@ -40,7 +28,7 @@ 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, R = object, NODE extends AVLTreeNode<K, V, NODE> = AVLTreeNode<K, V, AVLTreeNodeNested<K, V>>> extends BST<K, V, R, NODE> implements IBinaryTree<K, V, R, NODE> {
+export declare class AVLTree<K = any, V = any, R = object, MK = any, MV = any, MR = object, NODE extends AVLTreeNode<K, V, NODE> = AVLTreeNode<K, V, AVLTreeNodeNested<K, V>>, TREE extends AVLTree<K, V, R, MK, MV, MR, NODE, TREE> = AVLTree<K, V, R, MK, MV, MR, NODE, AVLTreeNested<K, V, R, MK, MV, MR, NODE>>> extends BST<K, V, R, MK, MV, MR, NODE, TREE> implements IBinaryTree<K, V, R, MK, MV, MR, NODE, TREE> {
     /**
      * This is a constructor function for an AVLTree class that initializes the tree with keys, nodes,
      * entries, or raw elements.
@@ -64,16 +52,13 @@ export declare class AVLTree<K = any, V = any, R = object, NODE extends AVLTreeN
      */
     createNode(key: K, value?: V): NODE;
     /**
-     * The function `createTree` in TypeScript overrides the default AVLTree creation with the provided
-     * options.
-     * @param [options] - The `options` parameter in the `createTree` function is an object that contains
-     * configuration options for creating an AVL tree. These options can include properties such as
-     * `iterationType`, `isMapMode`, `specifyComparable`, `toEntryFn`, and `isReverse`. The function
-     * creates a
-     * @returns An AVLTree object is being returned with the specified options and properties inherited
-     * from the current object.
+     * 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
+     * passed to the `createTree` function. It is used to customize the behavior of the AVL tree that is
+     * being created.
+     * @returns a new AVLTree object.
      */
-    createTree(options?: AVLTreeOptions<K, V, R>): AVLTree<K, V, R, NODE>;
+    createTree(options?: AVLTreeOptions<K, V, R>): TREE;
     /**
      * The function checks if the input is an instance of AVLTreeNode.
      * @param {BTNRep<K, V, NODE> | R} keyNodeEntryOrRaw - The parameter
@@ -110,7 +95,7 @@ export declare class AVLTree<K = any, V = any, R = object, NODE extends AVLTreeN
      * `deletedResults`, which is an array of `BinaryTreeDeleteResult` objects.
      */
     delete(keyNodeEntryOrRaw: BTNRep<K, V, NODE> | R): BinaryTreeDeleteResult<NODE>[];
-    map<MK, MV, MR>(callback: EntryCallback<K, V | undefined, [MK, MV]>, options?: AVLTreeOptions<MK, MV, MR>, thisArg?: any): AVLTree<MK, MV, MR, AVLTreeNode<MK, MV, AVLTreeNodeNested<MK, MV>>>;
+    map(callback: EntryCallback<K, V | undefined, [MK, MV]>, options?: AVLTreeOptions<MK, MV, MR>, thisArg?: any): AVLTree<MK, MV, MR>;
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)

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

@@ -20,22 +20,6 @@ class AVLTreeNode extends bst_1.BSTNode {
      */
     constructor(key, value) {
         super(key, value);
-        this._height = 0;
-    }
-    /**
-     * The function returns the value of the height property.
-     * @returns The height of the object.
-     */
-    get height() {
-        return this._height;
-    }
-    /**
-     * The above function sets the value of the height property.
-     * @param {number} value - The value parameter is a number that represents the new height value to be
-     * set.
-     */
-    set height(value) {
-        this._height = value;
     }
 }
 exports.AVLTreeNode = AVLTreeNode;
@@ -78,16 +62,12 @@ class AVLTree extends bst_1.BST {
         return new AVLTreeNode(key, this._isMapMode ? undefined : value);
     }
     /**
-     * The function `createTree` in TypeScript overrides the default AVLTree creation with the provided
-     * options.
-     * @param [options] - The `options` parameter in the `createTree` function is an object that contains
-     * configuration options for creating an AVL tree. These options can include properties such as
-     * `iterationType`, `isMapMode`, `specifyComparable`, `toEntryFn`, and `isReverse`. The function
-     * creates a
-     * @returns An AVLTree object is being returned with the specified options and properties inherited
-     * from the current object.
+     * 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
+     * passed to the `createTree` function. It is used to customize the behavior of the AVL tree that is
+     * being created.
+     * @returns a new AVLTree object.
      */
-    // @ts-ignore
     createTree(options) {
         return new AVLTree([], Object.assign({ iterationType: this.iterationType, isMapMode: this._isMapMode, specifyComparable: this._specifyComparable, toEntryFn: this._toEntryFn, isReverse: this._isReverse }, options));
     }
@@ -144,7 +124,6 @@ class AVLTree extends bst_1.BST {
         }
         return deletedResults;
     }
-    // @ts-ignore
     map(callback, options, thisArg) {
         const newTree = new AVLTree([], options);
         let index = 0;
@@ -237,7 +216,8 @@ class AVLTree extends bst_1.BST {
     _balanceLL(A) {
         const parentOfA = A.parent;
         const B = A.left;
-        A.parent = B;
+        if (B !== null)
+            A.parent = B;
         if (B && B.right) {
             B.right.parent = A;
         }
@@ -278,13 +258,14 @@ class AVLTree extends bst_1.BST {
         if (B) {
             C = B.right;
         }
-        if (A)
+        if (A && C !== null)
             A.parent = C;
-        if (B)
+        if (B && C !== null)
             B.parent = C;
         if (C) {
             if (C.left) {
-                C.left.parent = B;
+                if (B !== null)
+                    C.left.parent = B;
             }
             if (C.right) {
                 C.right.parent = A;
@@ -328,7 +309,8 @@ class AVLTree extends bst_1.BST {
     _balanceRR(A) {
         const parentOfA = A.parent;
         const B = A.right;
-        A.parent = B;
+        if (B !== null)
+            A.parent = B;
         if (B) {
             if (B.left) {
                 B.left.parent = A;
@@ -371,15 +353,17 @@ class AVLTree extends bst_1.BST {
         if (B) {
             C = B.left;
         }
-        A.parent = C;
-        if (B)
+        if (C !== null)
+            A.parent = C;
+        if (B && C !== null)
             B.parent = C;
         if (C) {
             if (C.left) {
                 C.left.parent = A;
             }
             if (C.right) {
-                C.right.parent = B;
+                if (B !== null)
+                    C.right.parent = B;
             }
             C.parent = parentOfA;
         }

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

@@ -5,7 +5,7 @@
  * @copyright Copyright (c) 2022 Pablo Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-import { BinaryTreeDeleteResult, BinaryTreeNodeNested, BinaryTreeOptions, BinaryTreePrintOptions, BTNEntry, BTNRep, DFSOrderPattern, EntryCallback, FamilyPosition, IterationType, NodeCallback, NodeDisplayLayout, NodePredicate, OptNodeOrNull, ToEntryFn } from '../../types';
+import { BinaryTreeDeleteResult, BinaryTreeNested, BinaryTreeNodeNested, BinaryTreeOptions, BinaryTreePrintOptions, BTNEntry, BTNRep, DFSOrderPattern, EntryCallback, FamilyPosition, IterationType, NodeCallback, NodeDisplayLayout, NodePredicate, OptNodeOrNull, type RBTNColor, ToEntryFn } from '../../types';
 import { IBinaryTree } from '../../interfaces';
 import { IterableEntryBase } from '../base';
 import { Range } from '../../common';
@@ -19,12 +19,21 @@ export declare class BinaryTreeNode<K = any, V = any, NODE extends BinaryTreeNod
     value?: V;
     parent?: NODE;
     constructor(key: K, value?: V);
-    protected _left?: OptNodeOrNull<NODE>;
+    _left?: OptNodeOrNull<NODE>;
     get left(): OptNodeOrNull<NODE>;
     set left(v: OptNodeOrNull<NODE>);
-    protected _right?: OptNodeOrNull<NODE>;
+    _right?: OptNodeOrNull<NODE>;
     get right(): OptNodeOrNull<NODE>;
     set right(v: OptNodeOrNull<NODE>);
+    _height: number;
+    get height(): number;
+    set height(value: number);
+    _color: RBTNColor;
+    get color(): RBTNColor;
+    set color(value: RBTNColor);
+    _count: number;
+    get count(): number;
+    set count(value: number);
     get familyPosition(): FamilyPosition;
 }
 /**
@@ -34,7 +43,7 @@ export declare class BinaryTreeNode<K = any, V = any, NODE extends BinaryTreeNod
  * 4. Subtrees: Each child of a node forms the root of a subtree.
  * 5. Leaf Nodes: Nodes without children are leaves.
  */
-export declare class BinaryTree<K = any, V = any, R = object, NODE extends BinaryTreeNode<K, V, NODE> = BinaryTreeNode<K, V, BinaryTreeNodeNested<K, V>>> extends IterableEntryBase<K, V | undefined> implements IBinaryTree<K, V, R, NODE> {
+export declare class BinaryTree<K = any, V = any, R = object, MK = any, MV = any, MR = object, NODE extends BinaryTreeNode<K, V, NODE> = BinaryTreeNode<K, V, BinaryTreeNodeNested<K, V>>, TREE extends BinaryTree<K, V, R, MK, MV, MR, NODE, TREE> = BinaryTree<K, V, R, MK, MV, MR, NODE, BinaryTreeNested<K, V, R, MK, MV, MR, NODE>>> extends IterableEntryBase<K, V | undefined> implements IBinaryTree<K, V, R, MK, MV, MR, NODE, TREE> {
     iterationType: IterationType;
     /**
      * The constructor initializes a binary tree with optional options and adds keys, nodes, entries, or
@@ -72,20 +81,30 @@ export declare class BinaryTree<K = any, V = any, R = object, NODE extends Binar
      */
     createNode(key: K, value?: V): NODE;
     /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The `createTree` function creates a new binary tree based on the provided options.
-     * @param [options] - The `options` parameter in the `createTree` method is of type
-     * `BinaryTreeOptions<K, V, R>`. This type likely contains configuration options for creating a
-     * binary tree, such as the iteration type, whether the tree is in map mode, and functions for
-     * converting entries.
-     * @returns The `createTree` method is returning an instance of the `BinaryTree` class with the
-     * provided options. The method is creating a new `BinaryTree` object with an empty array as the
-     * initial data, and then setting various options such as `iterationType`, `isMapMode`, and
-     * `toEntryFn` based on the current object's properties and the provided `options`. Finally, it
+     * The function creates a binary tree with the specified options.
+     * @param [options] - The `options` parameter in the `createTree` function is an optional parameter
+     * that allows you to provide partial configuration options for creating a binary tree. It is of type
+     * `Partial<BinaryTreeOptions<K, V, R>>`, which means you can pass in an object containing a subset
+     * of properties
+     * @returns A new instance of a binary tree with the specified options is being returned.
      */
-    createTree(options?: BinaryTreeOptions<K, V, R>): typeof this;
+    createTree(options?: BinaryTreeOptions<K, V, R>): TREE;
+    /**
+     * The function `keyValueNodeEntryRawToNodeAndValue` converts various input types into a node object
+     * or returns null.
+     * @param {BTNRep<K, V, NODE> | R} keyNodeEntryOrRaw - The
+     * `keyValueNodeEntryRawToNodeAndValue` function takes in a parameter `keyNodeEntryOrRaw`, which
+     * can be of type `BTNRep<K, V, NODE>` or `R`. This parameter represents either a key, a
+     * node, an entry
+     * @param {V} [value] - The `value` parameter in the `keyValueNodeEntryRawToNodeAndValue` function is
+     * an optional parameter of type `V`. It represents the value associated with the key in the node
+     * being created. If a `value` is provided, it will be used when creating the node. If
+     * @returns The `keyValueNodeEntryRawToNodeAndValue` function returns an optional node
+     * (`OptNodeOrNull<NODE>`) based on the input parameters provided. The function checks the type of the
+     * input parameter (`keyNodeEntryOrRaw`) and processes it accordingly to return a node or null
+     * value.
+     */
+    protected _keyValueNodeEntryRawToNodeAndValue(keyNodeEntryOrRaw: BTNRep<K, V, NODE> | R, value?: V): [OptNodeOrNull<NODE>, V | undefined];
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(log n)
@@ -231,7 +250,7 @@ export declare class BinaryTree<K = any, V = any, R = object, NODE extends Binar
      * elements from the other tree.
      * @param anotherTree - `BinaryTree<K, V, R, NODE, TREE>`
      */
-    merge(anotherTree: this): void;
+    merge(anotherTree: BinaryTree<K, V, R, NODE, TREE>): void;
     /**
      * Time Complexity: O(k * n)
      * Space Complexity: O(1)
@@ -631,7 +650,7 @@ export declare class BinaryTree<K = any, V = any, R = object, NODE extends Binar
      * original tree using breadth-first search (bfs), and adds the nodes to the new tree. If a node in
      * the original tree is null, a null node is added to the cloned tree. If a node
      */
-    clone(): this;
+    clone(): TREE;
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -648,7 +667,7 @@ export declare class BinaryTree<K = any, V = any, R = object, NODE extends Binar
      * @returns The `filter` method is returning a new tree that contains entries that pass the provided
      * predicate function.
      */
-    filter(predicate: EntryCallback<K, V | undefined, boolean>, thisArg?: any): this;
+    filter(predicate: EntryCallback<K, V | undefined, boolean>, thisArg?: any): TREE;
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -668,7 +687,7 @@ export declare class BinaryTree<K = any, V = any, R = object, NODE extends Binar
      * @returns The `map` function is returning a new `BinaryTree` instance filled with entries that are
      * the result of applying the provided `callback` function to each entry in the original tree.
      */
-    map<MK, MV, MR>(callback: EntryCallback<K, V | undefined, [MK, MV]>, options?: BinaryTreeOptions<MK, MV, MR>, thisArg?: any): BinaryTree<MK, MV, MR, BinaryTreeNode<MK, MV, BinaryTreeNodeNested<MK, MV>>>;
+    map(callback: EntryCallback<K, V | undefined, [MK, MV]>, options?: BinaryTreeOptions<MK, MV, MR>, thisArg?: any): BinaryTree<MK, MV, MR>;
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -704,22 +723,6 @@ export declare class BinaryTree<K = any, V = any, R = object, NODE extends Binar
      * provided, the default value is set to
      */
     print(options?: BinaryTreePrintOptions, startNode?: BTNRep<K, V, NODE> | R): void;
-    /**
-     * The function `keyValueNodeEntryRawToNodeAndValue` converts various input types into a node object
-     * or returns null.
-     * @param {BTNRep<K, V, NODE> | R} keyNodeEntryOrRaw - The
-     * `keyValueNodeEntryRawToNodeAndValue` function takes in a parameter `keyNodeEntryOrRaw`, which
-     * can be of type `BTNRep<K, V, NODE>` or `R`. This parameter represents either a key, a
-     * node, an entry
-     * @param {V} [value] - The `value` parameter in the `keyValueNodeEntryRawToNodeAndValue` function is
-     * an optional parameter of type `V`. It represents the value associated with the key in the node
-     * being created. If a `value` is provided, it will be used when creating the node. If
-     * @returns The `keyValueNodeEntryRawToNodeAndValue` function returns an optional node
-     * (`OptNodeOrNull<NODE>`) based on the input parameters provided. The function checks the type of the
-     * input parameter (`keyNodeEntryOrRaw`) and processes it accordingly to return a node or null
-     * value.
-     */
-    protected _keyValueNodeEntryRawToNodeAndValue(keyNodeEntryOrRaw: BTNRep<K, V, NODE> | R, value?: V): [OptNodeOrNull<NODE>, V | undefined];
     /**
      * Time complexity: O(n)
      * Space complexity: O(n)

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

@@ -19,6 +19,9 @@ const common_1 = require("../../common");
  */
 class BinaryTreeNode {
     constructor(key, value) {
+        this._height = 0;
+        this._color = 'BLACK';
+        this._count = 1;
         this.key = key;
         this.value = value;
     }
@@ -40,6 +43,24 @@ class BinaryTreeNode {
         }
         this._right = v;
     }
+    get height() {
+        return this._height;
+    }
+    set height(value) {
+        this._height = value;
+    }
+    get color() {
+        return this._color;
+    }
+    set color(value) {
+        this._color = value;
+    }
+    get count() {
+        return this._count;
+    }
+    set count(value) {
+        this._count = value;
+    }
     get familyPosition() {
         const that = this;
         if (!this.parent) {
@@ -128,22 +149,57 @@ class BinaryTree extends base_1.IterableEntryBase {
         return new BinaryTreeNode(key, this._isMapMode ? undefined : value);
     }
     /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The `createTree` function creates a new binary tree based on the provided options.
-     * @param [options] - The `options` parameter in the `createTree` method is of type
-     * `BinaryTreeOptions<K, V, R>`. This type likely contains configuration options for creating a
-     * binary tree, such as the iteration type, whether the tree is in map mode, and functions for
-     * converting entries.
-     * @returns The `createTree` method is returning an instance of the `BinaryTree` class with the
-     * provided options. The method is creating a new `BinaryTree` object with an empty array as the
-     * initial data, and then setting various options such as `iterationType`, `isMapMode`, and
-     * `toEntryFn` based on the current object's properties and the provided `options`. Finally, it
+     * The function creates a binary tree with the specified options.
+     * @param [options] - The `options` parameter in the `createTree` function is an optional parameter
+     * that allows you to provide partial configuration options for creating a binary tree. It is of type
+     * `Partial<BinaryTreeOptions<K, V, R>>`, which means you can pass in an object containing a subset
+     * of properties
+     * @returns A new instance of a binary tree with the specified options is being returned.
      */
     createTree(options) {
         return new BinaryTree([], Object.assign({ iterationType: this.iterationType, isMapMode: this._isMapMode, toEntryFn: this._toEntryFn }, options));
     }
+    /**
+     * The function `keyValueNodeEntryRawToNodeAndValue` converts various input types into a node object
+     * or returns null.
+     * @param {BTNRep<K, V, NODE> | R} keyNodeEntryOrRaw - The
+     * `keyValueNodeEntryRawToNodeAndValue` function takes in a parameter `keyNodeEntryOrRaw`, which
+     * can be of type `BTNRep<K, V, NODE>` or `R`. This parameter represents either a key, a
+     * node, an entry
+     * @param {V} [value] - The `value` parameter in the `keyValueNodeEntryRawToNodeAndValue` function is
+     * an optional parameter of type `V`. It represents the value associated with the key in the node
+     * being created. If a `value` is provided, it will be used when creating the node. If
+     * @returns The `keyValueNodeEntryRawToNodeAndValue` function returns an optional node
+     * (`OptNodeOrNull<NODE>`) based on the input parameters provided. The function checks the type of the
+     * input parameter (`keyNodeEntryOrRaw`) and processes it accordingly to return a node or null
+     * value.
+     */
+    _keyValueNodeEntryRawToNodeAndValue(keyNodeEntryOrRaw, value) {
+        if (keyNodeEntryOrRaw === undefined)
+            return [undefined, undefined];
+        if (keyNodeEntryOrRaw === null)
+            return [null, undefined];
+        if (this.isNode(keyNodeEntryOrRaw))
+            return [keyNodeEntryOrRaw, value];
+        if (this.isEntry(keyNodeEntryOrRaw)) {
+            const [key, entryValue] = keyNodeEntryOrRaw;
+            if (key === undefined)
+                return [undefined, undefined];
+            else if (key === null)
+                return [null, undefined];
+            const finalValue = value !== null && value !== void 0 ? value : entryValue;
+            return [this.createNode(key, finalValue), finalValue];
+        }
+        if (this.isRaw(keyNodeEntryOrRaw)) {
+            const [key, entryValue] = this._toEntryFn(keyNodeEntryOrRaw);
+            const finalValue = value !== null && value !== void 0 ? value : entryValue;
+            if (this.isKey(key))
+                return [this.createNode(key, finalValue), finalValue];
+        }
+        if (this.isKey(keyNodeEntryOrRaw))
+            return [this.createNode(keyNodeEntryOrRaw, value), value];
+        return [undefined, undefined];
+    }
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(log n)
@@ -1559,47 +1615,6 @@ class BinaryTree extends base_1.IterableEntryBase {
     print(options, startNode = this._root) {
         console.log(this.toVisual(startNode, options));
     }
-    /**
-     * The function `keyValueNodeEntryRawToNodeAndValue` converts various input types into a node object
-     * or returns null.
-     * @param {BTNRep<K, V, NODE> | R} keyNodeEntryOrRaw - The
-     * `keyValueNodeEntryRawToNodeAndValue` function takes in a parameter `keyNodeEntryOrRaw`, which
-     * can be of type `BTNRep<K, V, NODE>` or `R`. This parameter represents either a key, a
-     * node, an entry
-     * @param {V} [value] - The `value` parameter in the `keyValueNodeEntryRawToNodeAndValue` function is
-     * an optional parameter of type `V`. It represents the value associated with the key in the node
-     * being created. If a `value` is provided, it will be used when creating the node. If
-     * @returns The `keyValueNodeEntryRawToNodeAndValue` function returns an optional node
-     * (`OptNodeOrNull<NODE>`) based on the input parameters provided. The function checks the type of the
-     * input parameter (`keyNodeEntryOrRaw`) and processes it accordingly to return a node or null
-     * value.
-     */
-    _keyValueNodeEntryRawToNodeAndValue(keyNodeEntryOrRaw, value) {
-        if (keyNodeEntryOrRaw === undefined)
-            return [undefined, undefined];
-        if (keyNodeEntryOrRaw === null)
-            return [null, undefined];
-        if (this.isNode(keyNodeEntryOrRaw))
-            return [keyNodeEntryOrRaw, value];
-        if (this.isEntry(keyNodeEntryOrRaw)) {
-            const [key, entryValue] = keyNodeEntryOrRaw;
-            if (key === undefined)
-                return [undefined, undefined];
-            else if (key === null)
-                return [null, undefined];
-            const finalValue = value !== null && value !== void 0 ? value : entryValue;
-            return [this.createNode(key, finalValue), finalValue];
-        }
-        if (this.isRaw(keyNodeEntryOrRaw)) {
-            const [key, entryValue] = this._toEntryFn(keyNodeEntryOrRaw);
-            const finalValue = value !== null && value !== void 0 ? value : entryValue;
-            if (this.isKey(key))
-                return [this.createNode(key, finalValue), finalValue];
-        }
-        if (this.isKey(keyNodeEntryOrRaw))
-            return [this.createNode(keyNodeEntryOrRaw, value), value];
-        return [undefined, undefined];
-    }
     /**
      * Time complexity: O(n)
      * Space complexity: O(n)