data-structure-typed 0.9.16 → 1.3.0

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

@@ -1,108 +1,80 @@
 "use strict";
-var __extends = (this && this.__extends) || (function () {
-    var extendStatics = function (d, b) {
-        extendStatics = Object.setPrototypeOf ||
-            ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
-            function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };
-        return extendStatics(d, b);
-    };
-    return function (d, b) {
-        if (typeof b !== "function" && b !== null)
-            throw new TypeError("Class extends value " + String(b) + " is not a constructor or null");
-        extendStatics(d, b);
-        function __() { this.constructor = d; }
-        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
-    };
-})();
-var __read = (this && this.__read) || function (o, n) {
-    var m = typeof Symbol === "function" && o[Symbol.iterator];
-    if (!m) return o;
-    var i = m.call(o), r, ar = [], e;
-    try {
-        while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);
-    }
-    catch (error) { e = { error: error }; }
-    finally {
-        try {
-            if (r && !r.done && (m = i["return"])) m.call(i);
-        }
-        finally { if (e) throw e.error; }
-    }
-    return ar;
-};
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.BST = exports.BSTNode = exports.CP = void 0;
-var binary_tree_1 = require("./binary-tree");
-var CP;
-(function (CP) {
-    CP[CP["lt"] = -1] = "lt";
-    CP[CP["eq"] = 0] = "eq";
-    CP[CP["gt"] = 1] = "gt";
-})(CP = exports.CP || (exports.CP = {}));
-var BSTNode = /** @class */ (function (_super) {
-    __extends(BSTNode, _super);
-    function BSTNode() {
-        return _super !== null && _super.apply(this, arguments) || this;
+exports.BST = exports.BSTNode = void 0;
+const types_1 = require("../../types");
+const binary_tree_1 = require("./binary-tree");
+class BSTNode extends binary_tree_1.BinaryTreeNode {
+    constructor(id, val) {
+        super(id, val);
     }
-    BSTNode.prototype.clone = function () {
-        return new BSTNode(this.id, this.val, this.count);
-    };
-    return BSTNode;
-}(binary_tree_1.BinaryTreeNode));
+}
 exports.BSTNode = BSTNode;
-var BST = /** @class */ (function (_super) {
-    __extends(BST, _super);
-    function BST(options) {
-        var _this = _super.call(this, options) || this;
-        _this._comparator = function (a, b) { return a - b; };
+class BST extends binary_tree_1.BinaryTree {
+    /**
+     * 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.
+     */
+    constructor(options) {
+        super(options);
+        this._comparator = (a, b) => a - b;
         if (options !== undefined) {
-            var comparator = options.comparator;
+            const { comparator } = options;
             if (comparator !== undefined) {
-                _this._comparator = comparator;
+                this._comparator = comparator;
             }
         }
-        return _this;
     }
-    BST.prototype.createNode = function (id, val, count) {
-        return val !== null ? new BSTNode(id, val, count) : null;
-    };
-    BST.prototype.put = function (id, val, count) {
-        var _a;
-        if (count === void 0) { count = 1; }
-        var inserted = null;
-        var newNode = this.createNode(id, val, count);
+    /**
+     * 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.
+     */
+    createNode(id, val) {
+        return new BSTNode(id, val);
+    }
+    /**
+     * 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`.
+     */
+    add(id, val) {
+        // TODO support node as a param
+        let inserted = null;
+        const newNode = this.createNode(id, val);
         if (this.root === null) {
-            this.root = newNode;
-            this.size++;
-            this.count += (_a = newNode === null || newNode === void 0 ? void 0 : newNode.count) !== null && _a !== void 0 ? _a : 1;
+            this._setRoot(newNode);
+            this._setSize(this.size + 1);
             inserted = (this.root);
         }
         else {
-            var cur = this.root;
-            var traversing = true;
+            let cur = this.root;
+            let traversing = true;
             while (traversing) {
                 if (cur !== null && newNode !== null) {
-                    if (this._compare(cur.id, id) === CP.eq) {
+                    if (this._compare(cur.id, id) === types_1.CP.eq) {
                         if (newNode) {
-                            cur.count += newNode.count;
-                            this.count += newNode.count;
                             cur.val = newNode.val;
                         }
                         //Duplicates are not accepted.
                         traversing = false;
                         inserted = cur;
                     }
-                    else if (this._compare(cur.id, id) === CP.gt) {
+                    else if (this._compare(cur.id, id) === types_1.CP.gt) {
                         // Traverse left of the node
                         if (cur.left === undefined) {
                             if (newNode) {
                                 newNode.parent = cur;
-                                newNode.familyPosition = binary_tree_1.FamilyPosition.left;
                             }
                             //Add to the left of the current node
                             cur.left = newNode;
-                            this.size++;
-                            this.count += newNode.count;
+                            this._setSize(this.size + 1);
                             traversing = false;
                             inserted = cur.left;
                         }
@@ -112,17 +84,15 @@ var BST = /** @class */ (function (_super) {
                                 cur = cur.left;
                         }
                     }
-                    else if (this._compare(cur.id, id) === CP.lt) {
+                    else if (this._compare(cur.id, id) === types_1.CP.lt) {
                         // Traverse right of the node
                         if (cur.right === undefined) {
                             if (newNode) {
                                 newNode.parent = cur;
-                                newNode.familyPosition = binary_tree_1.FamilyPosition.right;
                             }
                             //Add to the right of the current node
                             cur.right = newNode;
-                            this.size++;
-                            this.count += newNode.count;
+                            this._setSize(this.size + 1);
                             traversing = false;
                             inserted = (cur.right);
                         }
@@ -139,108 +109,82 @@ var BST = /** @class */ (function (_super) {
             }
         }
         return inserted;
-    };
-    BST.prototype.get = function (nodeProperty, propertyName) {
+    }
+    /**
+     * 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 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 tree nodes. If not provided, it defaults to `'id'`.
+     * @returns The method is returning either a BinaryTreeNodeId or N (generic type) or null.
+     */
+    get(nodeProperty, propertyName) {
         var _a;
         propertyName = propertyName !== null && propertyName !== void 0 ? propertyName : 'id';
         return (_a = this.getNodes(nodeProperty, propertyName, true)[0]) !== null && _a !== void 0 ? _a : null;
-    };
-    BST.prototype.lastKey = function () {
+    }
+    /**
+     * 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 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.
+     */
+    lastKey() {
         var _a, _b, _c, _d, _e, _f;
-        if (this._compare(0, 1) === CP.lt)
+        if (this._compare(0, 1) === types_1.CP.lt)
             return (_b = (_a = this.getRightMost()) === null || _a === void 0 ? void 0 : _a.id) !== null && _b !== void 0 ? _b : 0;
-        else if (this._compare(0, 1) === CP.gt)
+        else if (this._compare(0, 1) === types_1.CP.gt)
             return (_d = (_c = this.getLeftMost()) === null || _c === void 0 ? void 0 : _c.id) !== null && _d !== void 0 ? _d : 0;
         else
             return (_f = (_e = this.getRightMost()) === null || _e === void 0 ? void 0 : _e.id) !== null && _f !== void 0 ? _f : 0;
-    };
-    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.count--;
-        }
-        else {
-            if (!curr.left) {
-                if (!parent) {
-                    if (curr.right !== undefined)
-                        this.root = curr.right;
-                }
-                else {
-                    switch (curr.familyPosition) {
-                        case binary_tree_1.FamilyPosition.left:
-                            parent.left = curr.right;
-                            break;
-                        case binary_tree_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.size--;
-            this.count -= curr.count;
-        }
-        bstDeletedResult.push({ deleted: orgCurrent, needBalanced: needBalanced });
-        return bstDeletedResult;
-    };
-    BST.prototype.getNodes = function (nodeProperty, propertyName, onlyOne) {
-        var _this = this;
+    }
+    /**
+     * 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 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).
+     */
+    getNodes(nodeProperty, propertyName, onlyOne) {
         propertyName = propertyName !== null && propertyName !== void 0 ? propertyName : 'id';
         if (!this.root)
             return [];
-        var result = [];
-        if (this._loopType === binary_tree_1.LoopType.recursive) {
-            var _traverse_1 = function (cur) {
-                if (_this._pushByPropertyNameStopOrNot(cur, result, nodeProperty, propertyName, onlyOne))
+        const result = [];
+        if (this.loopType === types_1.LoopType.RECURSIVE) {
+            const _traverse = (cur) => {
+                if (this._pushByPropertyNameStopOrNot(cur, result, nodeProperty, propertyName, onlyOne))
                     return;
                 if (!cur.left && !cur.right)
                     return;
                 if (propertyName === 'id') {
-                    if (_this._compare(cur.id, nodeProperty) === CP.gt)
-                        cur.left && _traverse_1(cur.left);
-                    if (_this._compare(cur.id, nodeProperty) === CP.lt)
-                        cur.right && _traverse_1(cur.right);
+                    if (this._compare(cur.id, nodeProperty) === types_1.CP.gt)
+                        cur.left && _traverse(cur.left);
+                    if (this._compare(cur.id, nodeProperty) === types_1.CP.lt)
+                        cur.right && _traverse(cur.right);
                 }
                 else {
-                    cur.left && _traverse_1(cur.left);
-                    cur.right && _traverse_1(cur.right);
+                    cur.left && _traverse(cur.left);
+                    cur.right && _traverse(cur.right);
                 }
             };
-            _traverse_1(this.root);
+            _traverse(this.root);
         }
         else {
-            var queue = [this.root];
+            const queue = [this.root];
             while (queue.length > 0) {
-                var cur = queue.shift();
+                const cur = queue.shift();
                 if (cur) {
                     if (this._pushByPropertyNameStopOrNot(cur, result, nodeProperty, propertyName, onlyOne))
                         return result;
                     if (propertyName === 'id') {
-                        if (this._compare(cur.id, nodeProperty) === CP.gt)
+                        if (this._compare(cur.id, nodeProperty) === types_1.CP.gt)
                             cur.left && queue.push(cur.left);
-                        if (this._compare(cur.id, nodeProperty) === CP.lt)
+                        if (this._compare(cur.id, nodeProperty) === types_1.CP.lt)
                             cur.right && queue.push(cur.right);
                     }
                     else {
@@ -251,67 +195,77 @@ var BST = /** @class */ (function (_super) {
             }
         }
         return result;
-    };
+    }
     // --- start additional functions
-    BST.prototype.lesserSum = function (id, propertyName) {
-        var _this = this;
+    /**
+     * 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 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 tree that have a lesser value than the specified `beginNode` based on the `propertyName`.
+     */
+    lesserSum(beginNode, propertyName) {
         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 getSumByPropertyName = function (cur) {
-            var needSum;
+        const id = beginNode.id;
+        const getSumByPropertyName = (cur) => {
+            let needSum;
             switch (propertyName) {
                 case 'id':
                     needSum = cur.id;
                     break;
-                case 'count':
-                    needSum = cur.count;
-                    break;
                 default:
                     needSum = cur.id;
                     break;
             }
             return needSum;
         };
-        var sum = 0;
-        if (this._loopType === binary_tree_1.LoopType.recursive) {
-            var _traverse_2 = function (cur) {
-                var compared = _this._compare(cur.id, id);
-                if (compared === CP.eq) {
+        let sum = 0;
+        if (this.loopType === types_1.LoopType.RECURSIVE) {
+            const _traverse = (cur) => {
+                const compared = this._compare(cur.id, id);
+                if (compared === types_1.CP.eq) {
                     if (cur.right)
-                        sum += _this.subTreeSum(cur.right, propertyName);
+                        sum += this.subTreeSum(cur.right, propertyName);
                     return;
                 }
-                else if (compared === CP.lt) {
+                else if (compared === types_1.CP.lt) {
                     if (cur.left)
-                        sum += _this.subTreeSum(cur.left, propertyName);
+                        sum += this.subTreeSum(cur.left, propertyName);
                     sum += getSumByPropertyName(cur);
                     if (cur.right)
-                        _traverse_2(cur.right);
+                        _traverse(cur.right);
                     else
                         return;
                 }
                 else {
                     if (cur.left)
-                        _traverse_2(cur.left);
+                        _traverse(cur.left);
                     else
                         return;
                 }
             };
-            _traverse_2(this.root);
+            _traverse(this.root);
         }
         else {
-            var queue = [this.root];
+            const queue = [this.root];
             while (queue.length > 0) {
-                var cur = queue.shift();
+                const cur = queue.shift();
                 if (cur) {
-                    var compared = this._compare(cur.id, id);
-                    if (compared === CP.eq) {
+                    const compared = this._compare(cur.id, id);
+                    if (compared === types_1.CP.eq) {
                         if (cur.right)
                             sum += this.subTreeSum(cur.right, propertyName);
                         return sum;
                     }
-                    else if (compared === CP.lt) { // todo maybe a bug
+                    else if (compared === types_1.CP.lt) { // todo maybe a bug
                         if (cur.left)
                             sum += this.subTreeSum(cur.left, propertyName);
                         sum += getSumByPropertyName(cur);
@@ -330,84 +284,112 @@ var BST = /** @class */ (function (_super) {
             }
         }
         return sum;
-    };
-    BST.prototype.allGreaterNodesAdd = function (node, delta, propertyName) {
-        var _this = this;
+    }
+    /**
+     * 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 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.
+     */
+    allGreaterNodesAdd(node, delta, propertyName) {
         propertyName = propertyName !== null && propertyName !== void 0 ? propertyName : 'id';
+        if (typeof node === 'number')
+            node = this.get(node, 'id');
+        if (!node)
+            return false;
+        const id = node.id;
         if (!this.root)
             return false;
-        var _sumByPropertyName = function (cur) {
+        const _sumByPropertyName = (cur) => {
             switch (propertyName) {
                 case 'id':
                     cur.id += delta;
                     break;
-                case 'count':
-                    cur.count += delta;
-                    break;
                 default:
                     cur.id += delta;
                     break;
             }
         };
-        if (this._loopType === binary_tree_1.LoopType.recursive) {
-            var _traverse_3 = function (cur) {
-                var compared = _this._compare(cur.id, node.id);
-                _sumByPropertyName(cur);
+        if (this.loopType === types_1.LoopType.RECURSIVE) {
+            const _traverse = (cur) => {
+                const compared = this._compare(cur.id, id);
+                if (compared === types_1.CP.gt)
+                    _sumByPropertyName(cur);
                 if (!cur.left && !cur.right)
                     return;
-                if (cur.left && compared === CP.gt)
-                    _traverse_3(cur.left);
-                else if (cur.right && compared === CP.gt)
-                    _traverse_3(cur.right);
+                if (cur.left && this._compare(cur.left.id, id) === types_1.CP.gt)
+                    _traverse(cur.left);
+                if (cur.right && this._compare(cur.right.id, id) === types_1.CP.gt)
+                    _traverse(cur.right);
             };
-            _traverse_3(this.root);
+            _traverse(this.root);
             return true;
         }
         else {
-            var queue = [this.root];
+            const queue = [this.root];
             while (queue.length > 0) {
-                var cur = queue.shift();
+                const cur = queue.shift();
                 if (cur) {
-                    var compared = this._compare(cur.id, node.id);
-                    _sumByPropertyName(cur);
-                    if (cur.left && compared === CP.gt)
+                    const 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 === CP.gt)
+                    if (cur.right && this._compare(cur.right.id, id) === types_1.CP.gt)
                         queue.push(cur.right);
                 }
             }
             return true;
         }
-    };
-    BST.prototype.balance = function () {
-        var _this = this;
-        var sorted = this.DFS('in', 'node'), n = sorted.length;
+    }
+    /**
+     * 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.
+     */
+    perfectlyBalance() {
+        const sorted = this.DFS('in', 'node'), n = sorted.length;
         this.clear();
         if (sorted.length < 1)
             return false;
-        if (this._loopType === binary_tree_1.LoopType.recursive) {
-            var buildBalanceBST_1 = function (l, r) {
+        if (this.loopType === types_1.LoopType.RECURSIVE) {
+            const buildBalanceBST = (l, r) => {
                 if (l > r)
                     return;
-                var m = l + Math.floor((r - l) / 2);
-                var midNode = sorted[m];
-                _this.put(midNode.id, midNode.val, midNode.count);
-                buildBalanceBST_1(l, m - 1);
-                buildBalanceBST_1(m + 1, r);
+                const m = l + Math.floor((r - l) / 2);
+                const midNode = sorted[m];
+                this.add(midNode.id, midNode.val);
+                buildBalanceBST(l, m - 1);
+                buildBalanceBST(m + 1, r);
             };
-            buildBalanceBST_1(0, n - 1);
+            buildBalanceBST(0, n - 1);
             return true;
         }
         else {
-            var stack = [[0, n - 1]];
+            const stack = [[0, n - 1]];
             while (stack.length > 0) {
-                var popped = stack.pop();
+                const popped = stack.pop();
                 if (popped) {
-                    var _a = __read(popped, 2), l = _a[0], r = _a[1];
+                    const [l, r] = popped;
                     if (l <= r) {
-                        var m = l + Math.floor((r - l) / 2);
-                        var midNode = sorted[m];
-                        this.put(midNode.id, midNode.val, midNode.count);
+                        const m = l + Math.floor((r - l) / 2);
+                        const midNode = sorted[m];
+                        this.add(midNode.id, midNode.val);
                         stack.push([m + 1, r]);
                         stack.push([l, m - 1]);
                     }
@@ -415,27 +397,31 @@ var BST = /** @class */ (function (_super) {
             }
             return true;
         }
-    };
-    BST.prototype.isAVLBalanced = function () {
+    }
+    /**
+     * The function `isAVLBalanced` checks if a binary tree is balanced according to the AVL tree property.
+     * @returns a boolean value.
+     */
+    isAVLBalanced() {
         var _a, _b;
         if (!this.root)
             return true;
-        var balanced = true;
-        if (this._loopType === binary_tree_1.LoopType.recursive) {
-            var _height_1 = function (cur) {
+        let balanced = true;
+        if (this.loopType === types_1.LoopType.RECURSIVE) {
+            const _height = (cur) => {
                 if (!cur)
                     return 0;
-                var leftHeight = _height_1(cur.left), rightHeight = _height_1(cur.right);
+                const leftHeight = _height(cur.left), rightHeight = _height(cur.right);
                 if (Math.abs(leftHeight - rightHeight) > 1)
                     balanced = false;
                 return Math.max(leftHeight, rightHeight) + 1;
             };
-            _height_1(this.root);
+            _height(this.root);
         }
         else {
-            var stack = [];
-            var node = this.root, last = null;
-            var depths = new Map();
+            const stack = [];
+            let node = this.root, last = null;
+            const depths = new Map();
             while (stack.length > 0 || node) {
                 if (node) {
                     stack.push(node);
@@ -446,8 +432,8 @@ var BST = /** @class */ (function (_super) {
                     if (!node.right || last === node.right) {
                         node = stack.pop();
                         if (node) {
-                            var left = node.left ? (_a = depths.get(node.left)) !== null && _a !== void 0 ? _a : -1 : -1;
-                            var right = node.right ? (_b = depths.get(node.right)) !== null && _b !== void 0 ? _b : -1 : -1;
+                            const left = node.left ? (_a = depths.get(node.left)) !== null && _a !== void 0 ? _a : -1 : -1;
+                            const right = node.right ? (_b = depths.get(node.right)) !== null && _b !== void 0 ? _b : -1 : -1;
                             if (Math.abs(left - right) > 1)
                                 return false;
                             depths.set(node, 1 + Math.max(left, right));
@@ -461,16 +447,23 @@ var BST = /** @class */ (function (_super) {
             }
         }
         return balanced;
-    };
-    BST.prototype._compare = function (a, b) {
-        var compared = this._comparator(a, b);
+    }
+    /**
+     * The function compares two binary tree node IDs using a comparator function and returns whether the first ID is
+     * greater than, less than, or equal to the second ID.
+     * @param {BinaryTreeNodeId} a - a is a BinaryTreeNodeId, which represents the identifier of a binary tree node.
+     * @param {BinaryTreeNodeId} b - The parameter "b" in the above code refers to a BinaryTreeNodeId.
+     * @returns a value of type CP (ComparisonResult). The possible return values are CP.gt (greater than), CP.lt (less
+     * than), or CP.eq (equal).
+     */
+    _compare(a, b) {
+        const compared = this._comparator(a, b);
         if (compared > 0)
-            return CP.gt;
+            return types_1.CP.gt;
         else if (compared < 0)
-            return CP.lt;
+            return types_1.CP.lt;
         else
-            return CP.eq;
-    };
-    return BST;
-}(binary_tree_1.BinaryTree));
+            return types_1.CP.eq;
+    }
+}
 exports.BST = BST;