data-structure-typed 1.18.7 → 1.19.0

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

@@ -39,27 +39,14 @@ var BSTNode = /** @class */ (function (_super) {
     function BSTNode() {
         return _super !== null && _super.apply(this, arguments) || this;
     }
-    /**
-     * The function creates a new binary search tree node with the specified id, value, and count.
-     * @param {BinaryTreeNodeId} id - The id parameter is the identifier for the binary tree node. It is used to uniquely
-     * identify each node in the tree.
-     * @param {T} [val] - The "val" parameter represents the value that will be stored in the binary tree node. It is an
-     * optional parameter, meaning it can be omitted when calling the "createNode" function.
-     * @param {number} [count] - The `count` parameter represents the number of occurrences of the value in the binary
-     * search tree node. It is an optional parameter, so it can be omitted when calling the `createNode` method.
-     * @returns The method is returning a new instance of the BSTNode class, casted as the FAMILY type.
-     */
-    BSTNode.prototype.createNode = function (id, val, count) {
-        return new BSTNode(id, (val === undefined ? id : val), count);
-    };
     return BSTNode;
 }(binary_tree_1.BinaryTreeNode));
 exports.BSTNode = BSTNode;
 var BST = /** @class */ (function (_super) {
     __extends(BST, _super);
     /**
-     * The constructor function accepts an optional options object and sets the comparator property if provided.
-     * @param [options] - An optional object that can contain the following properties:
+     * The constructor function initializes a binary search tree object with an optional comparator function.
+     * @param {BSTOptions} [options] - An optional object that contains configuration options for the binary search tree.
      */
     function BST(options) {
         var _this = _super.call(this, options) || this;
@@ -73,38 +60,31 @@ var BST = /** @class */ (function (_super) {
         return _this;
     }
     /**
-     * The function creates a new binary search tree node with the given id, value, and count.
-     * @param {BinaryTreeNodeId} id - The `id` parameter is the identifier for the binary tree node. It is of type
-     * `BinaryTreeNodeId`.
-     * @param {N['val'] | null} [val] - The `val` parameter is the value that will be stored in the node. It can be of any
-     * type `N['val']` or `null`.
-     * @param {number} [count] - The `count` parameter is an optional parameter that represents the number of occurrences
-     * of a particular value in the binary search tree node.
-     * @returns a new instance of the BSTNode class, casted as type N.
+     * The function creates a new binary search tree node with the given id and value.
+     * @param {BinaryTreeNodeId} id - The `id` parameter is the identifier for the binary tree node. It is used to uniquely
+     * identify each node in the binary tree.
+     * @param [val] - The `val` parameter is an optional value that can be assigned to the node. It represents the value
+     * that will be stored in the node.
+     * @returns a new instance of the BSTNode class with the specified id and value.
      */
-    BST.prototype.createNode = function (id, val, count) {
-        return new BSTNode(id, val === undefined ? id : val, count);
+    BST.prototype.createNode = function (id, val) {
+        return new BSTNode(id, val);
     };
     /**
-     * The `add` function inserts a new node into a binary search tree, updating the count and value of an existing node if
-     * the ID matches, and returns the inserted node.
-     * @param {BinaryTreeNodeId} id - The `id` parameter represents the identifier of the binary tree node. It is used to
-     * determine the position of the node in the binary search tree.
-     * @param {N | null} val - The `val` parameter represents the value to be stored in the binary search tree node. It can
-     * be of type `N` (the generic type) or `null`.
-     * @param {number} [count=1] - The `count` parameter represents the number of times the value should be inserted into
-     * the binary search tree. By default, it is set to 1, meaning that if no count is specified, the value will be
-     * inserted once.
-     * @returns The method `add` returns a `N` object or `null`.
+     * The `add` function adds a new node to a binary tree, ensuring that duplicates are not accepted.
+     * @param {BinaryTreeNodeId} id - The `id` parameter is the identifier of the binary tree node that we want to add. It
+     * is of type `BinaryTreeNodeId`.
+     * @param [val] - The `val` parameter is an optional value that can be assigned to the node being added. It represents
+     * the value associated with the node.
+     * @returns The function `add` returns the inserted node (`inserted`) if it was successfully added to the binary tree.
+     * If the node was not added (e.g., due to a duplicate ID), it returns `null` or `undefined`.
      */
-    BST.prototype.add = function (id, val, count) {
-        if (count === void 0) { count = 1; }
+    BST.prototype.add = function (id, val) {
         var inserted = null;
-        var newNode = this.createNode(id, val, count);
+        var newNode = this.createNode(id, val);
         if (this.root === null) {
             this._setRoot(newNode);
             this._setSize(this.size + 1);
-            this._setCount(this.count + count);
             inserted = (this.root);
         }
         else {
@@ -114,8 +94,6 @@ var BST = /** @class */ (function (_super) {
                 if (cur !== null && newNode !== null) {
                     if (this._compare(cur.id, id) === types_1.CP.eq) {
                         if (newNode) {
-                            cur.count += newNode.count;
-                            this._setCount(this.count + newNode.count);
                             cur.val = newNode.val;
                         }
                         //Duplicates are not accepted.
@@ -127,12 +105,10 @@ var BST = /** @class */ (function (_super) {
                         if (cur.left === undefined) {
                             if (newNode) {
                                 newNode.parent = cur;
-                                newNode.familyPosition = types_1.FamilyPosition.LEFT;
                             }
                             //Add to the left of the current node
                             cur.left = newNode;
                             this._setSize(this.size + 1);
-                            this._setCount(this.count + newNode.count);
                             traversing = false;
                             inserted = cur.left;
                         }
@@ -147,12 +123,10 @@ var BST = /** @class */ (function (_super) {
                         if (cur.right === undefined) {
                             if (newNode) {
                                 newNode.parent = cur;
-                                newNode.familyPosition = types_1.FamilyPosition.RIGHT;
                             }
                             //Add to the right of the current node
                             cur.right = newNode;
                             this._setSize(this.size + 1);
-                            this._setCount(this.count + newNode.count);
                             traversing = false;
                             inserted = (cur.right);
                         }
@@ -171,13 +145,12 @@ var BST = /** @class */ (function (_super) {
         return inserted;
     };
     /**
-     * The `get` function returns the first node in a binary search tree that matches the given property value or name.
+     * The function returns the first node in a binary tree that matches the given property name and value.
      * @param {BinaryTreeNodeId | N} nodeProperty - The `nodeProperty` parameter can be either a `BinaryTreeNodeId` or a
-     * generic type `N`. It represents the value of the property that you want to search for in the binary search tree.
+     * generic type `N`. It represents the property of the binary tree node that you want to search for.
      * @param {BinaryTreeNodePropertyName} [propertyName] - The `propertyName` parameter is an optional parameter that
-     * specifies the property name to use for searching the binary search tree nodes. If not provided, it defaults to
-     * `'id'`.
-     * @returns The method is returning a N object or null.
+     * specifies the property name to use for searching the binary tree nodes. If not provided, it defaults to `'id'`.
+     * @returns The method is returning either a BinaryTreeNodeId or N (generic type) or null.
      */
     BST.prototype.get = function (nodeProperty, propertyName) {
         var _a;
@@ -187,10 +160,9 @@ var BST = /** @class */ (function (_super) {
     /**
      * The function returns the id of the rightmost node if the comparison between two values is less than, the id of the
      * leftmost node if the comparison is greater than, and the id of the rightmost node otherwise.
-     * @returns The function `lastKey()` returns the ID of the rightmost node in a binary tree. If the comparison between
-     * the first two elements in the tree is less than, it returns the ID of the rightmost node. If the comparison is
-     * greater than, it returns the ID of the leftmost node. Otherwise, it also returns the ID of the rightmost node. If
-     * there are no nodes in
+     * @returns The method `lastKey()` returns the id of the rightmost node in the binary tree if the comparison between
+     * the values at index 0 and 1 is less than, otherwise it returns the id of the leftmost node. If the comparison is
+     * equal, it returns the id of the rightmost node. If there are no nodes in the tree, it returns 0.
      */
     BST.prototype.lastKey = function () {
         var _a, _b, _c, _d, _e, _f;
@@ -202,78 +174,15 @@ var BST = /** @class */ (function (_super) {
             return (_f = (_e = this.getRightMost()) === null || _e === void 0 ? void 0 : _e.id) !== null && _f !== void 0 ? _f : 0;
     };
     /**
-     * The `remove` function in this TypeScript code removes a node from a binary search tree and returns information about
-     * the deleted node and any nodes that need to be balanced.
-     * @param {BinaryTreeNodeId} id - The `id` parameter is the identifier of the binary tree node that needs to be removed
-     * from the binary search tree.
-     * @param {boolean} [ignoreCount] - A boolean flag indicating whether to ignore the count of the node being removed. If
-     * set to true, the count of the node will not be considered and the node will be removed regardless of its count. If
-     * set to false or not provided, the count of the node will be taken into account and the
-     * @returns an array of `BSTDeletedResult<N>` objects.
-     */
-    BST.prototype.remove = function (id, ignoreCount) {
-        var bstDeletedResult = [];
-        if (!this.root)
-            return bstDeletedResult;
-        var curr = this.get(id);
-        if (!curr)
-            return bstDeletedResult;
-        var parent = (curr === null || curr === void 0 ? void 0 : curr.parent) ? curr.parent : null;
-        var needBalanced = null, orgCurrent = curr;
-        if (curr.count > 1 && !ignoreCount) {
-            curr.count--;
-            this._setCount(this.count - 1);
-        }
-        else {
-            if (!curr.left) {
-                if (!parent) {
-                    if (curr.right !== undefined)
-                        this._setRoot(curr.right);
-                }
-                else {
-                    switch (curr.familyPosition) {
-                        case types_1.FamilyPosition.LEFT:
-                            parent.left = curr.right;
-                            break;
-                        case types_1.FamilyPosition.RIGHT:
-                            parent.right = curr.right;
-                            break;
-                    }
-                    needBalanced = parent;
-                }
-            }
-            else {
-                var leftSubTreeMax = curr.left ? this.getRightMost(curr.left) : null;
-                if (leftSubTreeMax) {
-                    var parentOfLeftSubTreeMax = leftSubTreeMax.parent;
-                    orgCurrent = curr.swapLocation(leftSubTreeMax);
-                    if (parentOfLeftSubTreeMax) {
-                        if (parentOfLeftSubTreeMax.right === leftSubTreeMax)
-                            parentOfLeftSubTreeMax.right = leftSubTreeMax.left;
-                        else
-                            parentOfLeftSubTreeMax.left = leftSubTreeMax.left;
-                        needBalanced = parentOfLeftSubTreeMax;
-                    }
-                }
-            }
-            this._setSize(this.size - 1);
-            this._setCount(this.count - curr.count);
-        }
-        bstDeletedResult.push({ deleted: orgCurrent, needBalanced: needBalanced });
-        return bstDeletedResult;
-    };
-    /**
-     * The function `getNodes` returns an array of binary search tree nodes that match a given property value, with the
-     * option to specify the property name and whether to return only one node.
-     * @param {BinaryTreeNodeId | N} nodeProperty - The `nodeProperty` parameter can be either a `BinaryTreeNodeId` or a
-     * generic type `N`. It represents the property value that you want to search for in the binary search tree.
+     * The function `getNodes` returns an array of nodes in a binary tree that match a given property value.
+     * @param {BinaryTreeNodeId | N} nodeProperty - The `nodeProperty` parameter can be either a `BinaryTreeNodeId` or an
+     * `N` type. It represents the property of the binary tree node that you want to compare with.
      * @param {BinaryTreeNodePropertyName} [propertyName] - The `propertyName` parameter is an optional parameter that
-     * specifies the property of the nodes to compare with the `nodeProperty` parameter. If not provided, it defaults to
-     * `'id'`.
-     * @param {boolean} [onlyOne] - A boolean value indicating whether to return only one node that matches the given
-     * nodeProperty. If set to true, the function will stop traversing the tree and return the first matching node. If set
-     * to false or not provided, the function will return all nodes that match the given nodeProperty.
-     * @returns an array of N objects.
+     * specifies the property name to use for comparison. If not provided, it defaults to `'id'`.
+     * @param {boolean} [onlyOne] - The `onlyOne` parameter is an optional boolean parameter that determines whether to
+     * return only one node that matches the given `nodeProperty` or all nodes that match the `nodeProperty`. If `onlyOne`
+     * is set to `true`, the function will return an array with only one node (if
+     * @returns an array of nodes (type N).
      */
     BST.prototype.getNodes = function (nodeProperty, propertyName, onlyOne) {
         var _this = this;
@@ -324,29 +233,30 @@ var BST = /** @class */ (function (_super) {
     };
     // --- start additional functions
     /**
-     * The `lesserSum` function calculates the sum of a specified property in all nodes with an ID less than a given ID in
-     * a binary search tree.
-     * @param {BinaryTreeNodeId} id - The `id` parameter is the identifier of the binary tree node for which you want to
-     * calculate the lesser sum.
+     * The `lesserSum` function calculates the sum of property values in a binary tree for nodes that have a property value
+     * less than a given node.
+     * @param {N | BinaryTreeNodeId | null} beginNode - The `beginNode` parameter can be one of the following:
      * @param {BinaryTreeNodePropertyName} [propertyName] - The `propertyName` parameter is an optional parameter that
-     * specifies the property of the binary tree node to use for calculating the sum. If not provided, it defaults to 'id'.
+     * specifies the property name to use for calculating the sum. If not provided, it defaults to `'id'`.
      * @returns The function `lesserSum` returns a number, which represents the sum of the values of the nodes in the
-     * binary search tree that have a property value lesser than the given `id`.
+     * binary tree that have a lesser value than the specified `beginNode` based on the `propertyName`.
      */
-    BST.prototype.lesserSum = function (id, propertyName) {
+    BST.prototype.lesserSum = function (beginNode, propertyName) {
         var _this = this;
         propertyName = propertyName !== null && propertyName !== void 0 ? propertyName : 'id';
+        if (typeof beginNode === 'number')
+            beginNode = this.get(beginNode, 'id');
+        if (!beginNode)
+            return 0;
         if (!this.root)
             return 0;
+        var id = beginNode.id;
         var getSumByPropertyName = function (cur) {
             var needSum;
             switch (propertyName) {
                 case 'id':
                     needSum = cur.id;
                     break;
-                case 'count':
-                    needSum = cur.count;
-                    break;
                 default:
                     needSum = cur.id;
                     break;
@@ -412,20 +322,25 @@ var BST = /** @class */ (function (_super) {
         return sum;
     };
     /**
-     * The function `allGreaterNodesAdd` updates the value of a specified property for all nodes in a binary search tree
-     * that have a greater value than a given node.
-     * @param node - The `node` parameter is of type `N`, which represents a node in a binary search tree. It
-     * contains properties such as `id` and `count`.
+     * The `allGreaterNodesAdd` function adds a delta value to the specified property of all nodes in a binary tree that
+     * have a greater value than a given node.
+     * @param {N | BinaryTreeNodeId | null} node - The `node` parameter can be either of type `N` (a generic type),
+     * `BinaryTreeNodeId`, or `null`. It represents the node in the binary tree to which the delta value will be added.
      * @param {number} delta - The `delta` parameter is a number that represents the amount by which the property value of
-     * each node should be increased.
-     * @param {BinaryTreeNodePropertyName} [propertyName] - propertyName is an optional parameter that specifies the
-     * property of the BSTNode to be modified. It can be either 'id' or 'count'. If propertyName is not provided, it
-     * defaults to 'id'.
+     * each greater node should be increased.
+     * @param {BinaryTreeNodePropertyName} [propertyName] - The `propertyName` parameter is an optional parameter that
+     * specifies the property name of the nodes in the binary tree that you want to update. If not provided, it defaults to
+     * 'id'.
      * @returns a boolean value.
      */
     BST.prototype.allGreaterNodesAdd = function (node, delta, propertyName) {
         var _this = this;
         propertyName = propertyName !== null && propertyName !== void 0 ? propertyName : 'id';
+        if (typeof node === 'number')
+            node = this.get(node, 'id');
+        if (!node)
+            return false;
+        var id = node.id;
         if (!this.root)
             return false;
         var _sumByPropertyName = function (cur) {
@@ -433,9 +348,6 @@ var BST = /** @class */ (function (_super) {
                 case 'id':
                     cur.id += delta;
                     break;
-                case 'count':
-                    cur.count += delta;
-                    break;
                 default:
                     cur.id += delta;
                     break;
@@ -443,13 +355,14 @@ var BST = /** @class */ (function (_super) {
         };
         if (this.loopType === types_1.LoopType.RECURSIVE) {
             var _traverse_3 = function (cur) {
-                var compared = _this._compare(cur.id, node.id);
-                _sumByPropertyName(cur);
+                var compared = _this._compare(cur.id, id);
+                if (compared === types_1.CP.gt)
+                    _sumByPropertyName(cur);
                 if (!cur.left && !cur.right)
                     return;
-                if (cur.left && compared === types_1.CP.gt)
+                if (cur.left && _this._compare(cur.left.id, id) === types_1.CP.gt)
                     _traverse_3(cur.left);
-                else if (cur.right && compared === types_1.CP.gt)
+                if (cur.right && _this._compare(cur.right.id, id) === types_1.CP.gt)
                     _traverse_3(cur.right);
             };
             _traverse_3(this.root);
@@ -460,11 +373,12 @@ var BST = /** @class */ (function (_super) {
             while (queue.length > 0) {
                 var cur = queue.shift();
                 if (cur) {
-                    var compared = this._compare(cur.id, node.id);
-                    _sumByPropertyName(cur);
-                    if (cur.left && compared === types_1.CP.gt)
+                    var compared = this._compare(cur.id, id);
+                    if (compared === types_1.CP.gt)
+                        _sumByPropertyName(cur);
+                    if (cur.left && this._compare(cur.left.id, id) === types_1.CP.gt)
                         queue.push(cur.left);
-                    else if (cur.right && compared === types_1.CP.gt)
+                    if (cur.right && this._compare(cur.right.id, id) === types_1.CP.gt)
                         queue.push(cur.right);
                 }
             }
@@ -472,11 +386,20 @@ var BST = /** @class */ (function (_super) {
         }
     };
     /**
-     * The `balance` function takes a sorted array of nodes and builds a balanced binary search tree using either a
-     * recursive or iterative approach.
-     * @returns The `balance()` function returns a boolean value.
+     * Balancing Adjustment:
+     * Perfectly Balanced Binary Tree: Since the balance of a perfectly balanced binary tree is already fixed, no additional balancing adjustment is needed. Any insertion or deletion operation will disrupt the perfect balance, often requiring a complete reconstruction of the tree.
+     * AVL Tree: After insertion or deletion operations, an AVL tree performs rotation adjustments based on the balance factor of nodes to restore the tree's balance. These rotations can be left rotations, right rotations, left-right rotations, or right-left rotations, performed as needed.
+     *
+     * Use Cases and Efficiency:
+     * Perfectly Balanced Binary Tree: Perfectly balanced binary trees are typically used in specific scenarios such as complete binary heaps in heap sort or certain types of Huffman trees. However, they are not suitable for dynamic operations requiring frequent insertions and deletions, as these operations often necessitate full tree reconstruction.
+     * AVL Tree: AVL trees are well-suited for scenarios involving frequent searching, insertion, and deletion operations. Through rotation adjustments, AVL trees maintain their balance, ensuring average and worst-case time complexity of O(log n).
+     */
+    /**
+     * The `perfectlyBalance` function takes a binary tree, performs a depth-first search to sort the nodes, and then
+     * constructs a balanced binary search tree using either a recursive or iterative approach.
+     * @returns The function `perfectlyBalance()` returns a boolean value.
      */
-    BST.prototype.balance = function () {
+    BST.prototype.perfectlyBalance = function () {
         var _this = this;
         var sorted = this.DFS('in', 'node'), n = sorted.length;
         this.clear();
@@ -488,7 +411,7 @@ var BST = /** @class */ (function (_super) {
                     return;
                 var m = l + Math.floor((r - l) / 2);
                 var midNode = sorted[m];
-                _this.add(midNode.id, midNode.val, midNode.count);
+                _this.add(midNode.id, midNode.val);
                 buildBalanceBST_1(l, m - 1);
                 buildBalanceBST_1(m + 1, r);
             };
@@ -504,7 +427,7 @@ var BST = /** @class */ (function (_super) {
                     if (l <= r) {
                         var m = l + Math.floor((r - l) / 2);
                         var midNode = sorted[m];
-                        this.add(midNode.id, midNode.val, midNode.count);
+                        this.add(midNode.id, midNode.val);
                         stack.push([m + 1, r]);
                         stack.push([l, m - 1]);
                     }
@@ -514,9 +437,8 @@ var BST = /** @class */ (function (_super) {
         }
     };
     /**
-     * The function `isAVLBalanced` checks if a binary search tree is balanced according to the AVL tree property.
-     * @returns The function `isAVLBalanced()` returns a boolean value. It returns `true` if the binary search tree (BST)
-     * is balanced according to the AVL tree property, and `false` otherwise.
+     * The function `isAVLBalanced` checks if a binary tree is balanced according to the AVL tree property.
+     * @returns a boolean value.
      */
     BST.prototype.isAVLBalanced = function () {
         var _a, _b;

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

@@ -1,27 +1,16 @@
-import { BinaryTreeNodeId, RBColor, RBTreeOptions } from '../types';
+import { BinaryTreeNodeId, RBColor, RBTreeNodeNested, RBTreeOptions } from '../types';
 import { IRBTree, IRBTreeNode } from '../interfaces/rb-tree';
 import { BST, BSTNode } from './bst';
-export declare class RBTreeNode<T, FAMILY extends RBTreeNode<T, FAMILY>> extends BSTNode<T, FAMILY> implements IRBTreeNode<T, FAMILY> {
-    constructor(id: number, val: T, count?: number);
+export declare class RBTreeNode<T = any, NEIGHBOR extends RBTreeNode<T, NEIGHBOR> = RBTreeNodeNested<T>> extends BSTNode<T, NEIGHBOR> implements IRBTreeNode<T, NEIGHBOR> {
+    constructor(id: BinaryTreeNodeId, color: RBColor, val?: T);
     private _color;
     get color(): RBColor;
     set color(value: RBColor);
-    /**
-     * The function creates a new RBTreeNode with the given id, value, and count and returns it as a FAMILY object.
-     * @param {BinaryTreeNodeId} id - The `id` parameter is the identifier for the binary tree node. It is used to uniquely
-     * identify each node in the tree.
-     * @param {T | null} [val] - The "val" parameter represents the value to be stored in the node. It can be of type T
-     * (generic type) or null.
-     * @param {number} [count] - The `count` parameter represents the number of occurrences of the value in the binary tree
-     * node.
-     * @returns The method is returning a new instance of the RBTreeNode class, casted as a FAMILY type.
-     */
-    createNode(id: BinaryTreeNodeId, val?: T | null, count?: number): FAMILY;
 }
-export declare class RBTree<N extends RBTreeNode<N['val'], N>> extends BST<N> implements IRBTree<N> {
+export declare class RBTree<N extends RBTreeNode<N['val'], N> = RBTreeNode> extends BST<N> implements IRBTree<N> {
     constructor(options?: RBTreeOptions);
-    createNode(id: BinaryTreeNodeId, val?: N['val'], count?: number): N;
-    insert(id: number, val: N | null): void;
+    createNode(id: BinaryTreeNodeId, val?: N['val']): N;
+    insert(id: number, val?: N | null): void;
     private leftRotate;
     private rightRotate;
     private insertFixup;

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

@@ -20,9 +20,10 @@ var types_1 = require("../types");
 var bst_1 = require("./bst");
 var RBTreeNode = /** @class */ (function (_super) {
     __extends(RBTreeNode, _super);
-    function RBTreeNode(id, val, count) {
-        var _this = _super.call(this, id, val, count) || this;
+    function RBTreeNode(id, color, val) {
+        var _this = _super.call(this, id, val) || this;
         _this._color = types_1.RBColor.RED;
+        _this._color = color;
         return _this;
     }
     Object.defineProperty(RBTreeNode.prototype, "color", {
@@ -35,19 +36,6 @@ var RBTreeNode = /** @class */ (function (_super) {
         enumerable: false,
         configurable: true
     });
-    /**
-     * The function creates a new RBTreeNode with the given id, value, and count and returns it as a FAMILY object.
-     * @param {BinaryTreeNodeId} id - The `id` parameter is the identifier for the binary tree node. It is used to uniquely
-     * identify each node in the tree.
-     * @param {T | null} [val] - The "val" parameter represents the value to be stored in the node. It can be of type T
-     * (generic type) or null.
-     * @param {number} [count] - The `count` parameter represents the number of occurrences of the value in the binary tree
-     * node.
-     * @returns The method is returning a new instance of the RBTreeNode class, casted as a FAMILY type.
-     */
-    RBTreeNode.prototype.createNode = function (id, val, count) {
-        return new RBTreeNode(id, val, count);
-    };
     return RBTreeNode;
 }(bst_1.BSTNode));
 exports.RBTreeNode = RBTreeNode;
@@ -56,8 +44,8 @@ var RBTree = /** @class */ (function (_super) {
     function RBTree(options) {
         return _super.call(this, options) || this;
     }
-    RBTree.prototype.createNode = function (id, val, count) {
-        return new RBTreeNode(id, val, count);
+    RBTree.prototype.createNode = function (id, val) {
+        return new RBTreeNode(id, types_1.RBColor.RED, val);
     };
     // private override _root: BinaryTreeNode<N> | null = null;
     //