data-structure-typed 1.21.4 → 1.32.0

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

@@ -1,115 +1,137 @@
 "use strict";
-/**
- * data-structure-typed
- *
- * @author Tyler Zeng
- * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT License
- */
+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.AbstractBinaryTree = exports.AbstractBinaryTreeNode = void 0;
-const utils_1 = require("../../utils");
-const types_1 = require("../../types");
-class AbstractBinaryTreeNode {
-    /**
-     * The constructor function initializes a BinaryTreeNode object with an id and an optional value.
-     * @param {BinaryTreeNodeId} id - The `id` parameter is of type `BinaryTreeNodeId` and represents the unique identifier
-     * of the binary tree node. It is used to distinguish one node from another in the binary tree.
-     * @param {T} [val] - The "val" parameter is an optional parameter of type T. It represents the value that will be
-     * stored in the binary tree node. If no value is provided, it will be set to undefined.
-     */
-    constructor(id, val) {
+var utils_1 = require("../../utils");
+var types_1 = require("../../types");
+var AbstractBinaryTreeNode = (function () {
+    function AbstractBinaryTreeNode(id, val) {
         this._height = 0;
         this._id = id;
         this._val = val;
     }
-    get id() {
-        return this._id;
-    }
-    set id(v) {
-        this._id = v;
-    }
-    get val() {
-        return this._val;
-    }
-    set val(value) {
-        this._val = value;
-    }
-    get left() {
-        return this._left;
-    }
-    set left(v) {
-        if (v) {
-            v.parent = this;
-        }
-        this._left = v;
-    }
-    get right() {
-        return this._right;
-    }
-    set right(v) {
-        if (v) {
-            v.parent = this;
-        }
-        this._right = v;
-    }
-    get parent() {
-        return this._parent;
-    }
-    set parent(v) {
-        this._parent = v;
-    }
-    get height() {
-        return this._height;
-    }
-    set height(v) {
-        this._height = v;
-    }
-    /**
-     * The function determines the position of a node in a family tree structure.
-     * @returns a value of type `FamilyPosition`.
-     */
-    get familyPosition() {
-        const that = this;
-        if (that.parent) {
-            if (that.parent.left === that) {
-                if (that.left || that.right) {
-                    return types_1.FamilyPosition.ROOT_LEFT;
+    Object.defineProperty(AbstractBinaryTreeNode.prototype, "id", {
+        get: function () {
+            return this._id;
+        },
+        set: function (v) {
+            this._id = v;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(AbstractBinaryTreeNode.prototype, "val", {
+        get: function () {
+            return this._val;
+        },
+        set: function (value) {
+            this._val = value;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(AbstractBinaryTreeNode.prototype, "left", {
+        get: function () {
+            return this._left;
+        },
+        set: function (v) {
+            if (v) {
+                v.parent = this;
+            }
+            this._left = v;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(AbstractBinaryTreeNode.prototype, "right", {
+        get: function () {
+            return this._right;
+        },
+        set: function (v) {
+            if (v) {
+                v.parent = this;
+            }
+            this._right = v;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(AbstractBinaryTreeNode.prototype, "parent", {
+        get: function () {
+            return this._parent;
+        },
+        set: function (v) {
+            this._parent = v;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(AbstractBinaryTreeNode.prototype, "height", {
+        get: function () {
+            return this._height;
+        },
+        set: function (v) {
+            this._height = v;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(AbstractBinaryTreeNode.prototype, "familyPosition", {
+        get: function () {
+            var that = this;
+            if (that.parent) {
+                if (that.parent.left === that) {
+                    if (that.left || that.right) {
+                        return types_1.FamilyPosition.ROOT_LEFT;
+                    }
+                    else {
+                        return types_1.FamilyPosition.LEFT;
+                    }
+                }
+                else if (that.parent.right === that) {
+                    if (that.left || that.right) {
+                        return types_1.FamilyPosition.ROOT_RIGHT;
+                    }
+                    else {
+                        return types_1.FamilyPosition.RIGHT;
+                    }
                 }
                 else {
-                    return types_1.FamilyPosition.LEFT;
+                    return types_1.FamilyPosition.MAL_NODE;
                 }
             }
-            else if (that.parent.right === that) {
+            else {
                 if (that.left || that.right) {
-                    return types_1.FamilyPosition.ROOT_RIGHT;
+                    return types_1.FamilyPosition.ROOT;
                 }
                 else {
-                    return types_1.FamilyPosition.RIGHT;
+                    return types_1.FamilyPosition.ISOLATED;
                 }
             }
-            else {
-                return types_1.FamilyPosition.MAL_NODE;
-            }
-        }
-        else {
-            if (that.left || that.right) {
-                return types_1.FamilyPosition.ROOT;
-            }
-            else {
-                return types_1.FamilyPosition.ISOLATED;
-            }
-        }
-    }
-}
+        },
+        enumerable: false,
+        configurable: true
+    });
+    return AbstractBinaryTreeNode;
+}());
 exports.AbstractBinaryTreeNode = AbstractBinaryTreeNode;
-class AbstractBinaryTree {
-    /**
-     * The protected constructor initializes the options for an abstract binary tree.
-     * @param {AbstractBinaryTreeOptions} [options] - An optional object that contains configuration options for the binary
-     * tree.
-     */
-    constructor(options) {
+var AbstractBinaryTree = (function () {
+    function AbstractBinaryTree(options) {
         this._root = null;
         this._size = 0;
         this._loopType = types_1.LoopType.ITERATIVE;
@@ -118,42 +140,63 @@ class AbstractBinaryTree {
         this._visitedNode = [];
         this._visitedLeftSum = [];
         if (options !== undefined) {
-            const { loopType = types_1.LoopType.ITERATIVE } = options;
+            var _a = options.loopType, loopType = _a === void 0 ? types_1.LoopType.ITERATIVE : _a;
             this._loopType = loopType;
         }
         this.clear();
     }
-    get root() {
-        return this._root;
-    }
-    get size() {
-        return this._size;
-    }
-    get loopType() {
-        return this._loopType;
-    }
-    get visitedId() {
-        return this._visitedId;
-    }
-    get visitedVal() {
-        return this._visitedVal;
-    }
-    get visitedNode() {
-        return this._visitedNode;
-    }
-    get visitedLeftSum() {
-        return this._visitedLeftSum;
-    }
-    /**
-     * The `swapLocation` function swaps the location of two nodes in a binary tree.
-     * @param {N} srcNode - The source node that you want to swap with the destination node.
-     * @param {N} destNode - The `destNode` parameter represents the destination node where the values from `srcNode` will
-     * be swapped to.
-     * @returns The `destNode` is being returned.
-     */
-    swapLocation(srcNode, destNode) {
-        const { id, val, height } = destNode;
-        const tempNode = this.createNode(id, val);
+    Object.defineProperty(AbstractBinaryTree.prototype, "root", {
+        get: function () {
+            return this._root;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(AbstractBinaryTree.prototype, "size", {
+        get: function () {
+            return this._size;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(AbstractBinaryTree.prototype, "loopType", {
+        get: function () {
+            return this._loopType;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(AbstractBinaryTree.prototype, "visitedId", {
+        get: function () {
+            return this._visitedId;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(AbstractBinaryTree.prototype, "visitedVal", {
+        get: function () {
+            return this._visitedVal;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(AbstractBinaryTree.prototype, "visitedNode", {
+        get: function () {
+            return this._visitedNode;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(AbstractBinaryTree.prototype, "visitedLeftSum", {
+        get: function () {
+            return this._visitedLeftSum;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    AbstractBinaryTree.prototype.swapLocation = function (srcNode, destNode) {
+        var id = destNode.id, val = destNode.val, height = destNode.height;
+        var tempNode = this.createNode(id, val);
         if (tempNode) {
             tempNode.height = height;
             destNode.id = srcNode.id;
@@ -164,46 +207,27 @@ class AbstractBinaryTree {
             srcNode.height = tempNode.height;
         }
         return destNode;
-    }
-    /**
-     * The clear() function resets the root, size, and maxId properties to their initial values.
-     */
-    clear() {
+    };
+    AbstractBinaryTree.prototype.clear = function () {
         this._root = null;
         this._size = 0;
         this._clearResults();
-    }
-    /**
-     * The function checks if the size of an object is equal to zero and returns a boolean value.
-     * @returns A boolean value indicating whether the size of the object is 0 or not.
-     */
-    isEmpty() {
+    };
+    AbstractBinaryTree.prototype.isEmpty = function () {
         return this.size === 0;
-    }
-    /**
-     * When all leaf nodes are null, it will no longer be possible to add new entity nodes to this binary tree.
-     * In this scenario, null nodes serve as "sentinel nodes," "virtual nodes," or "placeholder nodes."
-     */
-    /**
-     * The `add` function adds a new node to a binary tree, either by ID or by creating a new node with a given value.
-     * @param {BinaryTreeNodeId | N | null} idOrNode - The `idOrNode` parameter can be either a `BinaryTreeNodeId`, which
-     * is a number representing the ID of a binary tree node, or it can be a `N` object, which represents a binary tree
-     * node itself. It can also be `null` if no node is specified.
-     * @param [val] - The `val` parameter is an optional value that can be assigned to the `val` property of the new node
-     * being added to the binary tree.
-     * @returns The function `add` returns either the inserted node (`N`), `null`, or `undefined`.
-     */
-    add(idOrNode, val) {
-        const _bfs = (root, newNode) => {
-            const queue = [root];
+    };
+    AbstractBinaryTree.prototype.add = function (idOrNode, val) {
+        var _this = this;
+        var _bfs = function (root, newNode) {
+            var queue = [root];
             while (queue.length > 0) {
-                const cur = queue.shift();
+                var cur = queue.shift();
                 if (cur) {
                     if (newNode && cur.id === newNode.id)
                         return;
-                    const inserted = this._addTo(newNode, cur);
-                    if (inserted !== undefined)
-                        return inserted;
+                    var inserted_1 = _this._addTo(newNode, cur);
+                    if (inserted_1 !== undefined)
+                        return inserted_1;
                     if (cur.left)
                         queue.push(cur.left);
                     if (cur.right)
@@ -214,7 +238,7 @@ class AbstractBinaryTree {
             }
             return;
         };
-        let inserted, needInsert;
+        var inserted, needInsert;
         if (idOrNode === null) {
             needInsert = null;
         }
@@ -227,7 +251,7 @@ class AbstractBinaryTree {
         else {
             return;
         }
-        const existNode = idOrNode ? this.get(idOrNode, 'id') : undefined;
+        var existNode = idOrNode ? this.get(idOrNode, 'id') : undefined;
         if (this.root) {
             if (existNode) {
                 existNode.val = val;
@@ -248,80 +272,47 @@ class AbstractBinaryTree {
             inserted = this.root;
         }
         return inserted;
-    }
-    /**
-     * The `addMany` function adds multiple nodes to a tree data structure and returns an array of the inserted nodes or
-     * null/undefined values.
-     * @param {(BinaryTreeNodeId|N)[]} idsOrNodes - An array of BinaryTreeNodeId or N objects. These can be either the ID
-     * of a binary tree node or the actual node object itself.
-     * @param {N['val'][]} [data] - Optional array of values to be added to the nodes. If provided, the length of this
-     * array should be the same as the length of the `idsOrNodes` array.
-     * @returns The function `addMany` returns an array of values `(N | null | undefined)[]`.
-     */
-    addMany(idsOrNodes, data) {
-        var _a;
-        // TODO not sure addMany not be run multi times
-        const inserted = [];
-        const map = new Map();
-        for (const idOrNode of idsOrNodes)
-            map.set(idOrNode, ((_a = map.get(idOrNode)) !== null && _a !== void 0 ? _a : 0) + 1);
-        for (let i = 0; i < idsOrNodes.length; i++) {
-            const idOrNode = idsOrNodes[i];
-            if (map.has(idOrNode)) {
-                if (idOrNode instanceof AbstractBinaryTreeNode) {
-                    inserted.push(this.add(idOrNode.id, idOrNode.val));
-                    continue;
-                }
-                if (idOrNode === null) {
-                    inserted.push(this.add(null));
-                    continue;
-                }
-                const val = data === null || data === void 0 ? void 0 : data[i];
-                inserted.push(this.add(idOrNode, val));
-                map.delete(idOrNode);
+    };
+    AbstractBinaryTree.prototype.addMany = function (idsOrNodes, data) {
+        var inserted = [];
+        for (var i = 0; i < idsOrNodes.length; i++) {
+            var idOrNode = idsOrNodes[i];
+            if (idOrNode instanceof AbstractBinaryTreeNode) {
+                inserted.push(this.add(idOrNode.id, idOrNode.val));
+                continue;
             }
+            if (idOrNode === null) {
+                inserted.push(this.add(null));
+                continue;
+            }
+            var val = data === null || data === void 0 ? void 0 : data[i];
+            inserted.push(this.add(idOrNode, val));
         }
         return inserted;
-    }
-    /**
-     * The `fill` function clears the binary tree and adds multiple nodes with the given IDs or nodes and optional data.
-     * @param {(BinaryTreeNodeId | N)[]} idsOrNodes - The `idsOrNodes` parameter is an array that can contain either
-     * `BinaryTreeNodeId` or `N` values.
-     * @param {N[] | Array<N['val']>} [data] - The `data` parameter is an optional array of values that will be assigned to
-     * the nodes being added. If provided, the length of the `data` array should be equal to the length of the `idsOrNodes`
-     * array. Each value in the `data` array will be assigned to the
-     * @returns The method is returning a boolean value.
-     */
-    fill(idsOrNodes, data) {
+    };
+    AbstractBinaryTree.prototype.fill = function (idsOrNodes, data) {
         this.clear();
         return idsOrNodes.length === this.addMany(idsOrNodes, data).length;
-    }
-    /**
-     * The `remove` function removes a node from a binary search tree and returns the deleted node along with the parent
-     * node that needs to be balanced.
-     * @param {N | BinaryTreeNodeId} nodeOrId - The `nodeOrId` parameter can be either a node object (`N`) or a binary tree
-     * node ID (`BinaryTreeNodeId`).
-     * @param {boolean} [ignoreCount] - The `ignoreCount` parameter is an optional boolean parameter that determines
-     * whether to ignore the count of the nodes in the binary tree. If `ignoreCount` is set to `true`, the count of the
-     * nodes in the binary tree will not be updated after removing a node. If `ignoreCount`
-     * @returns The function `remove` returns an array of `BinaryTreeDeletedResult<N>` objects.
-     */
-    remove(nodeOrId, ignoreCount) {
-        const bstDeletedResult = [];
+    };
+    AbstractBinaryTree.prototype.remove = function (nodeOrId, isUpdateAllLeftSum) {
+        isUpdateAllLeftSum = isUpdateAllLeftSum === undefined ? true : isUpdateAllLeftSum;
+        if (isUpdateAllLeftSum) {
+        }
+        var bstDeletedResult = [];
         if (!this.root)
             return bstDeletedResult;
-        const curr = (typeof nodeOrId === 'number') ? this.get(nodeOrId) : nodeOrId;
+        var curr = typeof nodeOrId === 'number' ? this.get(nodeOrId) : nodeOrId;
         if (!curr)
             return bstDeletedResult;
-        const parent = (curr === null || curr === void 0 ? void 0 : curr.parent) ? curr.parent : null;
-        let needBalanced = null, orgCurrent = curr;
+        var parent = (curr === null || curr === void 0 ? void 0 : curr.parent) ? curr.parent : null;
+        var needBalanced = null, orgCurrent = curr;
         if (!curr.left) {
             if (!parent) {
                 if (curr.right !== undefined)
                     this._setRoot(curr.right);
             }
             else {
-                const { familyPosition: fp } = curr;
+                var fp = curr.familyPosition;
                 if (fp === types_1.FamilyPosition.LEFT || fp === types_1.FamilyPosition.ROOT_LEFT) {
                     parent.left = curr.right;
                 }
@@ -332,9 +323,9 @@ class AbstractBinaryTree {
             }
         }
         else {
-            const leftSubTreeRightMost = curr.left ? this.getRightMost(curr.left) : null;
+            var leftSubTreeRightMost = curr.left ? this.getRightMost(curr.left) : null;
             if (leftSubTreeRightMost) {
-                const parentOfLeftSubTreeMax = leftSubTreeRightMost.parent;
+                var parentOfLeftSubTreeMax = leftSubTreeRightMost.parent;
                 orgCurrent = this.swapLocation(curr, leftSubTreeRightMost);
                 if (parentOfLeftSubTreeMax) {
                     if (parentOfLeftSubTreeMax.right === leftSubTreeRightMost)
@@ -346,55 +337,43 @@ class AbstractBinaryTree {
             }
         }
         this._setSize(this.size - 1);
-        bstDeletedResult.push({ deleted: orgCurrent, needBalanced });
+        bstDeletedResult.push({ deleted: orgCurrent, needBalanced: needBalanced });
         return bstDeletedResult;
-    }
-    /**
-     * The function calculates the depth of a node in a binary tree.
-     * @param {N | BinaryTreeNodeId | null} beginRoot - The `beginRoot` parameter can be one of the following:
-     * @returns the depth of the given node or binary tree.
-     */
-    getDepth(beginRoot) {
+    };
+    AbstractBinaryTree.prototype.getDepth = function (beginRoot) {
         if (typeof beginRoot === 'number')
             beginRoot = this.get(beginRoot, 'id');
-        let depth = 0;
+        var depth = 0;
         while (beginRoot === null || beginRoot === void 0 ? void 0 : beginRoot.parent) {
             depth++;
             beginRoot = beginRoot.parent;
         }
         return depth;
-    }
-    /**
-     * The `getHeight` function calculates the maximum height of a binary tree, either recursively or iteratively.
-     * @param {N | BinaryTreeNodeId | null} [beginRoot] - The `beginRoot` parameter is optional and can be of type `N` (a
-     * generic type representing a node in a binary tree), `BinaryTreeNodeId` (a type representing the ID of a binary tree
-     * node), or `null`.
-     * @returns the height of the binary tree.
-     */
-    getHeight(beginRoot) {
+    };
+    AbstractBinaryTree.prototype.getHeight = function (beginRoot) {
         beginRoot = beginRoot !== null && beginRoot !== void 0 ? beginRoot : this.root;
         if (typeof beginRoot === 'number')
             beginRoot = this.get(beginRoot, 'id');
         if (!beginRoot)
             return -1;
         if (this._loopType === types_1.LoopType.RECURSIVE) {
-            const _getMaxHeight = (cur) => {
+            var _getMaxHeight_1 = function (cur) {
                 if (!cur)
                     return -1;
-                const leftHeight = _getMaxHeight(cur.left);
-                const rightHeight = _getMaxHeight(cur.right);
+                var leftHeight = _getMaxHeight_1(cur.left);
+                var rightHeight = _getMaxHeight_1(cur.right);
                 return Math.max(leftHeight, rightHeight) + 1;
             };
-            return _getMaxHeight(beginRoot);
+            return _getMaxHeight_1(beginRoot);
         }
         else {
             if (!beginRoot) {
                 return -1;
             }
-            const stack = [{ node: beginRoot, depth: 0 }];
-            let maxHeight = 0;
+            var stack = [{ node: beginRoot, depth: 0 }];
+            var maxHeight = 0;
             while (stack.length > 0) {
-                const { node, depth } = stack.pop();
+                var _a = stack.pop(), node = _a.node, depth = _a.depth;
                 if (node.left) {
                     stack.push({ node: node.left, depth: depth + 1 });
                 }
@@ -405,36 +384,28 @@ class AbstractBinaryTree {
             }
             return maxHeight;
         }
-    }
-    /**
-     * The `getMinHeight` function calculates the minimum height of a binary tree using either a recursive or iterative
-     * approach.
-     * @param {N | null} [beginRoot] - The `beginRoot` parameter is an optional parameter of type `N` or `null`. It
-     * represents the starting node from which to calculate the minimum height of a binary tree. If no value is provided
-     * for `beginRoot`, the `this.root` property is used as the default value.
-     * @returns The function `getMinHeight` returns the minimum height of the binary tree.
-     */
-    getMinHeight(beginRoot) {
+    };
+    AbstractBinaryTree.prototype.getMinHeight = function (beginRoot) {
         var _a, _b, _c;
         beginRoot = beginRoot || this.root;
         if (!beginRoot)
             return -1;
         if (this._loopType === types_1.LoopType.RECURSIVE) {
-            const _getMinHeight = (cur) => {
+            var _getMinHeight_1 = function (cur) {
                 if (!cur)
                     return 0;
                 if (!cur.left && !cur.right)
                     return 0;
-                const leftMinHeight = _getMinHeight(cur.left);
-                const rightMinHeight = _getMinHeight(cur.right);
+                var leftMinHeight = _getMinHeight_1(cur.left);
+                var rightMinHeight = _getMinHeight_1(cur.right);
                 return Math.min(leftMinHeight, rightMinHeight) + 1;
             };
-            return _getMinHeight(beginRoot);
+            return _getMinHeight_1(beginRoot);
         }
         else {
-            const stack = [];
-            let node = beginRoot, last = null;
-            const depths = new Map();
+            var stack = [];
+            var node = beginRoot, last = null;
+            var depths = new Map();
             while (stack.length > 0 || node) {
                 if (node) {
                     stack.push(node);
@@ -445,8 +416,8 @@ class AbstractBinaryTree {
                     if (!node.right || last === node.right) {
                         node = stack.pop();
                         if (node) {
-                            const leftMinHeight = node.left ? (_a = depths.get(node.left)) !== null && _a !== void 0 ? _a : -1 : -1;
-                            const rightMinHeight = node.right ? (_b = depths.get(node.right)) !== null && _b !== void 0 ? _b : -1 : -1;
+                            var leftMinHeight = node.left ? (_a = depths.get(node.left)) !== null && _a !== void 0 ? _a : -1 : -1;
+                            var rightMinHeight = node.right ? (_b = depths.get(node.right)) !== null && _b !== void 0 ? _b : -1 : -1;
                             depths.set(node, 1 + Math.min(leftMinHeight, rightMinHeight));
                             last = node;
                             node = null;
@@ -458,48 +429,31 @@ class AbstractBinaryTree {
             }
             return (_c = depths.get(beginRoot)) !== null && _c !== void 0 ? _c : -1;
         }
-    }
-    /**
-     * The function checks if a binary tree is perfectly balanced by comparing the minimum height and the height of the
-     * tree.
-     * @param {N | null} [beginRoot] - The parameter `beginRoot` is of type `N` or `null`. It represents the root node of a
-     * tree or null if the tree is empty.
-     * @returns The method is returning a boolean value.
-     */
-    isPerfectlyBalanced(beginRoot) {
-        return (this.getMinHeight(beginRoot) + 1 >= this.getHeight(beginRoot));
-    }
-    /**
-     * The function `getNodes` returns an array of nodes that match a given property name and value in a binary tree.
-     * @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 when searching for nodes. 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 `propertyName`. If `onlyOne` is set to `true`, the
-     * function will stop traversing the tree and return the first matching node. If `only
-     * @returns an array of nodes (type N).
-     */
-    getNodes(nodeProperty, propertyName, onlyOne) {
+    };
+    AbstractBinaryTree.prototype.isPerfectlyBalanced = function (beginRoot) {
+        return this.getMinHeight(beginRoot) + 1 >= this.getHeight(beginRoot);
+    };
+    AbstractBinaryTree.prototype.getNodes = function (nodeProperty, propertyName, onlyOne) {
+        var _this = this;
         if (!this.root)
             return [];
         propertyName = propertyName !== null && propertyName !== void 0 ? propertyName : 'id';
-        const result = [];
+        var result = [];
         if (this.loopType === types_1.LoopType.RECURSIVE) {
-            const _traverse = (cur) => {
-                if (this._pushByPropertyNameStopOrNot(cur, result, nodeProperty, propertyName, onlyOne))
+            var _traverse_1 = function (cur) {
+                if (_this._pushByPropertyNameStopOrNot(cur, result, nodeProperty, propertyName, onlyOne))
                     return;
                 if (!cur.left && !cur.right)
                     return;
-                cur.left && _traverse(cur.left);
-                cur.right && _traverse(cur.right);
+                cur.left && _traverse_1(cur.left);
+                cur.right && _traverse_1(cur.right);
             };
-            _traverse(this.root);
+            _traverse_1(this.root);
         }
         else {
-            const queue = [this.root];
+            var queue = [this.root];
             while (queue.length > 0) {
-                const cur = queue.shift();
+                var cur = queue.shift();
                 if (cur) {
                     if (this._pushByPropertyNameStopOrNot(cur, result, nodeProperty, propertyName, onlyOne))
                         return result;
@@ -509,212 +463,136 @@ class AbstractBinaryTree {
             }
         }
         return result;
-    }
-    /**
-     * The function checks if a binary tree node has a specific property.
-     * @param {BinaryTreeNodeId | N} nodeProperty - The `nodeProperty` parameter can be either a `BinaryTreeNodeId` or `N`.
-     * It represents the property of the binary tree node that you want to check.
-     * @param {BinaryTreeNodePropertyName} [propertyName] - The `propertyName` parameter is an optional parameter that
-     * specifies the name of the property to be checked in the nodes. If not provided, it defaults to 'id'.
-     * @returns a boolean value.
-     */
-    has(nodeProperty, propertyName) {
+    };
+    AbstractBinaryTree.prototype.has = function (nodeProperty, propertyName) {
         propertyName = propertyName !== null && propertyName !== void 0 ? propertyName : 'id';
-        // TODO may support finding node by value equal
         return this.getNodes(nodeProperty, propertyName).length > 0;
-    }
-    /**
-     * The function returns the first node that matches the given property name and value, or null if no matching node is
-     * found.
-     * @param {BinaryTreeNodeId | N} nodeProperty - The `nodeProperty` parameter can be either a `BinaryTreeNodeId` or `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 be used for searching the binary tree nodes. If this parameter is not provided, the
-     * default value is set to `'id'`.
-     * @returns either the value of the specified property of the node, or the node itself if no property name is provided.
-     * If no matching node is found, it returns null.
-     */
-    get(nodeProperty, propertyName) {
+    };
+    AbstractBinaryTree.prototype.get = function (nodeProperty, propertyName) {
         var _a;
         propertyName = propertyName !== null && propertyName !== void 0 ? propertyName : 'id';
-        // TODO may support finding node by value equal
         return (_a = this.getNodes(nodeProperty, propertyName, true)[0]) !== null && _a !== void 0 ? _a : null;
-    }
-    /**
-     * The function getPathToRoot takes a node and returns an array of nodes representing the path from the given node to
-     * the root node.
-     * @param {N} node - The parameter `node` represents a node in a tree data structure.
-     * @returns The function `getPathToRoot` returns an array of nodes (`N[]`).
-     */
-    getPathToRoot(node) {
-        // TODO to support get path through passing id
-        const result = [];
+    };
+    AbstractBinaryTree.prototype.getPathToRoot = function (node, isReverse) {
+        if (isReverse === void 0) { isReverse = true; }
+        var result = [];
         while (node.parent) {
-            result.unshift(node);
+            result.push(node);
             node = node.parent;
         }
-        result.unshift(node);
-        return result;
-    }
-    /**
-     * The `getLeftMost` function returns the leftmost node in a binary tree, starting from a specified node or the root if
-     * no node is specified.
-     * @param {N | BinaryTreeNodeId | null} [beginRoot] - The `beginRoot` parameter is optional and can be of type `N` (a
-     * generic type representing a node in a binary tree), `BinaryTreeNodeId` (a type representing the ID of a binary tree
-     * node), or `null`.
-     * @returns The function `getLeftMost` returns the leftmost node in a binary tree. If the `beginRoot` parameter is
-     * provided, it starts the traversal from that node. If `beginRoot` is not provided or is `null`, it starts the
-     * traversal from the root of the binary tree. If there are no nodes in the binary tree, it returns `null`.
-     */
-    getLeftMost(beginRoot) {
+        result.push(node);
+        return isReverse ? result.reverse() : result;
+    };
+    AbstractBinaryTree.prototype.getLeftMost = function (beginRoot) {
         if (typeof beginRoot === 'number')
             beginRoot = this.get(beginRoot, 'id');
         beginRoot = beginRoot !== null && beginRoot !== void 0 ? beginRoot : this.root;
         if (!beginRoot)
             return beginRoot;
         if (this._loopType === types_1.LoopType.RECURSIVE) {
-            const _traverse = (cur) => {
+            var _traverse_2 = function (cur) {
                 if (!cur.left)
                     return cur;
-                return _traverse(cur.left);
+                return _traverse_2(cur.left);
             };
-            return _traverse(beginRoot);
+            return _traverse_2(beginRoot);
         }
         else {
-            // Indirect implementation of iteration using tail recursion optimization
-            const _traverse = (0, utils_1.trampoline)((cur) => {
+            var _traverse_3 = (0, utils_1.trampoline)(function (cur) {
                 if (!cur.left)
                     return cur;
-                return _traverse.cont(cur.left);
+                return _traverse_3.cont(cur.left);
             });
-            return _traverse(beginRoot);
+            return _traverse_3(beginRoot);
         }
-    }
-    /**
-     * The `getRightMost` function returns the rightmost node in a binary tree, either recursively or iteratively using
-     * tail recursion optimization.
-     * @param {N | null} [node] - The `node` parameter is an optional parameter of type `N` or `null`. It represents the
-     * starting node from which we want to find the rightmost node. If no node is provided, the `node` parameter defaults
-     * to `this.root`, which is the root node of the data structure
-     * @returns The function `getRightMost` returns the rightmost node (`N`) in a binary tree. If the `node` parameter is
-     * not provided, it defaults to the root node of the tree. If the tree is empty or the `node` parameter is `null`, the
-     * function returns `null`.
-     */
-    getRightMost(node) {
-        // TODO support get right most by passing id in
+    };
+    AbstractBinaryTree.prototype.getRightMost = function (node) {
         node = node !== null && node !== void 0 ? node : this.root;
         if (!node)
             return node;
         if (this._loopType === types_1.LoopType.RECURSIVE) {
-            const _traverse = (cur) => {
+            var _traverse_4 = function (cur) {
                 if (!cur.right)
                     return cur;
-                return _traverse(cur.right);
+                return _traverse_4(cur.right);
             };
-            return _traverse(node);
+            return _traverse_4(node);
         }
         else {
-            // Indirect implementation of iteration using tail recursion optimization
-            const _traverse = (0, utils_1.trampoline)((cur) => {
+            var _traverse_5 = (0, utils_1.trampoline)(function (cur) {
                 if (!cur.right)
                     return cur;
-                return _traverse.cont(cur.right);
+                return _traverse_5.cont(cur.right);
             });
-            return _traverse(node);
+            return _traverse_5(node);
         }
-    }
-    /**
-     * The function checks if a binary search tree is valid by traversing it either recursively or iteratively.
-     * @param {N | null} node - The `node` parameter represents the root node of a binary search tree (BST).
-     * @returns a boolean value.
-     */
-    isSubtreeBST(node) {
-        // TODO there is a bug
+    };
+    AbstractBinaryTree.prototype.isSubtreeBST = function (node) {
         if (!node)
             return true;
         if (this._loopType === types_1.LoopType.RECURSIVE) {
-            const dfs = (cur, min, max) => {
+            var dfs_1 = function (cur, min, max) {
                 if (!cur)
                     return true;
                 if (cur.id <= min || cur.id >= max)
                     return false;
-                return dfs(cur.left, min, cur.id) && dfs(cur.right, cur.id, max);
+                return dfs_1(cur.left, min, cur.id) && dfs_1(cur.right, cur.id, max);
             };
-            return dfs(node, Number.MIN_SAFE_INTEGER, Number.MAX_SAFE_INTEGER);
+            return dfs_1(node, Number.MIN_SAFE_INTEGER, Number.MAX_SAFE_INTEGER);
         }
         else {
-            const stack = [];
-            let prev = Number.MIN_SAFE_INTEGER, curr = node;
+            var stack = [];
+            var prev = Number.MIN_SAFE_INTEGER, curr = node;
             while (curr || stack.length > 0) {
                 while (curr) {
                     stack.push(curr);
                     curr = curr.left;
                 }
                 curr = stack.pop();
-                if (!(curr) || prev >= curr.id)
+                if (!curr || prev >= curr.id)
                     return false;
                 prev = curr.id;
                 curr = curr.right;
             }
             return true;
         }
-    }
-    /**
-     * The function isBST checks if the binary search tree is valid.
-     * @returns The `isBST()` function is returning a boolean value.
-     */
-    isBST() {
+    };
+    AbstractBinaryTree.prototype.isBST = function () {
         return this.isSubtreeBST(this.root);
-    }
-    /**
-     * The function calculates the size of a subtree by traversing it either recursively or iteratively.
-     * @param {N | null | undefined} subTreeRoot - The `subTreeRoot` parameter represents the root node of a subtree in a
-     * binary tree.
-     * @returns the size of the subtree rooted at `subTreeRoot`.
-     */
-    getSubTreeSize(subTreeRoot) {
-        // TODO support id passed in
-        let size = 0;
+    };
+    AbstractBinaryTree.prototype.getSubTreeSize = function (subTreeRoot) {
+        var size = 0;
         if (!subTreeRoot)
             return size;
         if (this._loopType === types_1.LoopType.RECURSIVE) {
-            const _traverse = (cur) => {
+            var _traverse_6 = function (cur) {
                 size++;
-                cur.left && _traverse(cur.left);
-                cur.right && _traverse(cur.right);
+                cur.left && _traverse_6(cur.left);
+                cur.right && _traverse_6(cur.right);
             };
-            _traverse(subTreeRoot);
+            _traverse_6(subTreeRoot);
             return size;
         }
         else {
-            const stack = [subTreeRoot];
+            var stack = [subTreeRoot];
             while (stack.length > 0) {
-                const cur = stack.pop();
+                var cur = stack.pop();
                 size++;
                 cur.right && stack.push(cur.right);
                 cur.left && stack.push(cur.left);
             }
             return size;
         }
-    }
-    /**
-     * The function `subTreeSum` calculates the sum of a specified property in a binary tree or subtree.
-     * @param {N | BinaryTreeNodeId | null} subTreeRoot - The `subTreeRoot` parameter represents the root node of a binary
-     * tree or the ID of a binary tree node. It can also be `null` if there is no subtree.
-     * @param {BinaryTreeNodePropertyName} [propertyName] - propertyName is an optional parameter that specifies the
-     * property of the binary tree node to use for calculating the sum. It can be either 'id' or 'val'. If propertyName is
-     * not provided, it defaults to 'id'.
-     * @returns a number, which is the sum of the values of the specified property in the subtree rooted at `subTreeRoot`.
-     */
-    subTreeSum(subTreeRoot, propertyName) {
+    };
+    AbstractBinaryTree.prototype.subTreeSum = function (subTreeRoot, propertyName) {
         propertyName = propertyName !== null && propertyName !== void 0 ? propertyName : 'id';
         if (typeof subTreeRoot === 'number')
             subTreeRoot = this.get(subTreeRoot, 'id');
         if (!subTreeRoot)
             return 0;
-        let sum = 0;
-        const _sumByProperty = (cur) => {
-            let needSum;
+        var sum = 0;
+        var _sumByProperty = function (cur) {
+            var needSum;
             switch (propertyName) {
                 case 'id':
                     needSum = cur.id;
@@ -729,41 +607,31 @@ class AbstractBinaryTree {
             return needSum;
         };
         if (this._loopType === types_1.LoopType.RECURSIVE) {
-            const _traverse = (cur) => {
+            var _traverse_7 = function (cur) {
                 sum += _sumByProperty(cur);
-                cur.left && _traverse(cur.left);
-                cur.right && _traverse(cur.right);
+                cur.left && _traverse_7(cur.left);
+                cur.right && _traverse_7(cur.right);
             };
-            _traverse(subTreeRoot);
+            _traverse_7(subTreeRoot);
         }
         else {
-            const stack = [subTreeRoot];
+            var stack = [subTreeRoot];
             while (stack.length > 0) {
-                const cur = stack.pop();
+                var cur = stack.pop();
                 sum += _sumByProperty(cur);
                 cur.right && stack.push(cur.right);
                 cur.left && stack.push(cur.left);
             }
         }
         return sum;
-    }
-    /**
-     * The function `subTreeAdd` adds a delta value to a specified property of each node in a subtree.
-     * @param {N | BinaryTreeNodeId | null} subTreeRoot - The `subTreeRoot` parameter represents the root node of a binary
-     * tree or the ID of a node in the binary tree. It can also be `null` if there is no subtree to add to.
-     * @param {number} delta - The `delta` parameter is a number that represents the amount by which the property value of
-     * each node in the subtree should be incremented.
-     * @param {BinaryTreeNodePropertyName} [propertyName] - The `propertyName` parameter is an optional parameter that
-     * specifies the property of the binary tree node that should be modified. If not provided, it defaults to 'id'.
-     * @returns a boolean value.
-     */
-    subTreeAdd(subTreeRoot, delta, propertyName) {
+    };
+    AbstractBinaryTree.prototype.subTreeAdd = function (subTreeRoot, delta, propertyName) {
         propertyName = propertyName !== null && propertyName !== void 0 ? propertyName : 'id';
         if (typeof subTreeRoot === 'number')
             subTreeRoot = this.get(subTreeRoot, 'id');
         if (!subTreeRoot)
             return false;
-        const _addByProperty = (cur) => {
+        var _addByProperty = function (cur) {
             switch (propertyName) {
                 case 'id':
                     cur.id += delta;
@@ -774,39 +642,30 @@ class AbstractBinaryTree {
             }
         };
         if (this._loopType === types_1.LoopType.RECURSIVE) {
-            const _traverse = (cur) => {
+            var _traverse_8 = function (cur) {
                 _addByProperty(cur);
-                cur.left && _traverse(cur.left);
-                cur.right && _traverse(cur.right);
+                cur.left && _traverse_8(cur.left);
+                cur.right && _traverse_8(cur.right);
             };
-            _traverse(subTreeRoot);
+            _traverse_8(subTreeRoot);
         }
         else {
-            const stack = [subTreeRoot];
+            var stack = [subTreeRoot];
             while (stack.length > 0) {
-                const cur = stack.pop();
+                var cur = stack.pop();
                 _addByProperty(cur);
                 cur.right && stack.push(cur.right);
                 cur.left && stack.push(cur.left);
             }
         }
         return true;
-    }
-    /**
-     * The BFS function performs a breadth-first search on a binary tree, accumulating properties of each node based on a
-     * specified property name.
-     * @param {NodeOrPropertyName} [nodeOrPropertyName] - The parameter `nodeOrPropertyName` is an optional parameter that
-     * represents either a node or a property name. If a node is provided, the breadth-first search (BFS) algorithm will be
-     * performed starting from that node. If a property name is provided, the BFS algorithm will be performed starting from
-     * the
-     * @returns an instance of the `AbstractBinaryTreeNodeProperties` class with generic type `N`.
-     */
-    BFS(nodeOrPropertyName) {
+    };
+    AbstractBinaryTree.prototype.BFS = function (nodeOrPropertyName) {
         nodeOrPropertyName = nodeOrPropertyName !== null && nodeOrPropertyName !== void 0 ? nodeOrPropertyName : 'id';
         this._clearResults();
-        const queue = [this.root];
+        var queue = [this.root];
         while (queue.length !== 0) {
-            const cur = queue.shift();
+            var cur = queue.shift();
             if (cur) {
                 this._accumulatedByPropertyName(cur, nodeOrPropertyName);
                 if ((cur === null || cur === void 0 ? void 0 : cur.left) !== null)
@@ -816,33 +675,23 @@ class AbstractBinaryTree {
             }
         }
         return this._getResultByPropertyName(nodeOrPropertyName);
-    }
-    /**
-     * The DFS function performs a depth-first search traversal on a binary tree and returns the accumulated properties of
-     * each node based on the specified pattern and property name.
-     * @param {'in' | 'pre' | 'post'} [pattern] - The "pattern" parameter is used to specify the traversal order of the
-     * binary tree. It can have three possible values:
-     * @param {NodeOrPropertyName} [nodeOrPropertyName] - The `nodeOrPropertyName` parameter is a string that represents
-     * the name of a property of the nodes in the binary tree. This property will be used to accumulate values during the
-     * depth-first search traversal. If no `nodeOrPropertyName` is provided, the default value is `'id'`.
-     * @returns an instance of the AbstractBinaryTreeNodeProperties class, which contains the accumulated properties of the
-     * binary tree nodes based on the specified pattern and node or property name.
-     */
-    DFS(pattern, nodeOrPropertyName) {
+    };
+    AbstractBinaryTree.prototype.DFS = function (pattern, nodeOrPropertyName) {
+        var _this = this;
         pattern = pattern !== null && pattern !== void 0 ? pattern : 'in';
         nodeOrPropertyName = nodeOrPropertyName !== null && nodeOrPropertyName !== void 0 ? nodeOrPropertyName : 'id';
         this._clearResults();
-        const _traverse = (node) => {
+        var _traverse = function (node) {
             switch (pattern) {
                 case 'in':
                     if (node.left)
                         _traverse(node.left);
-                    this._accumulatedByPropertyName(node, nodeOrPropertyName);
+                    _this._accumulatedByPropertyName(node, nodeOrPropertyName);
                     if (node.right)
                         _traverse(node.right);
                     break;
                 case 'pre':
-                    this._accumulatedByPropertyName(node, nodeOrPropertyName);
+                    _this._accumulatedByPropertyName(node, nodeOrPropertyName);
                     if (node.left)
                         _traverse(node.left);
                     if (node.right)
@@ -853,34 +702,22 @@ class AbstractBinaryTree {
                         _traverse(node.left);
                     if (node.right)
                         _traverse(node.right);
-                    this._accumulatedByPropertyName(node, nodeOrPropertyName);
+                    _this._accumulatedByPropertyName(node, nodeOrPropertyName);
                     break;
             }
         };
         this.root && _traverse(this.root);
         return this._getResultByPropertyName(nodeOrPropertyName);
-    }
-    /**
-     * The DFSIterative function performs an iterative depth-first search traversal on a binary tree, with the option to
-     * specify the traversal pattern and the property name to accumulate results by.
-     * @param {'in' | 'pre' | 'post'} [pattern] - The "pattern" parameter determines the order in which the nodes of the
-     * binary tree are visited during the depth-first search. It can have one of the following values:
-     * @param {NodeOrPropertyName} [nodeOrPropertyName] - The `nodeOrPropertyName` parameter is used to specify the
-     * property of the nodes that you want to retrieve or perform operations on during the depth-first search traversal. By
-     * default, it is set to `'id'`, which means that the traversal will accumulate results based on the `id` property of
-     * the
-     * @returns an object of type AbstractBinaryTreeNodeProperties<N>.
-     */
-    DFSIterative(pattern, nodeOrPropertyName) {
+    };
+    AbstractBinaryTree.prototype.DFSIterative = function (pattern, nodeOrPropertyName) {
         pattern = pattern || 'in';
         nodeOrPropertyName = nodeOrPropertyName || 'id';
         this._clearResults();
         if (!this.root)
             return this._getResultByPropertyName(nodeOrPropertyName);
-        // 0: visit, 1: print
-        const stack = [{ opt: 0, node: this.root }];
+        var stack = [{ opt: 0, node: this.root }];
         while (stack.length > 0) {
-            const cur = stack.pop();
+            var cur = stack.pop();
             if (!cur || !cur.node)
                 continue;
             if (cur.opt === 1) {
@@ -912,28 +749,16 @@ class AbstractBinaryTree {
             }
         }
         return this._getResultByPropertyName(nodeOrPropertyName);
-    }
-    /**
-     * The `levelIterative` function performs a level-order traversal on a binary tree and returns the values of the nodes
-     * in an array, based on a specified property name.
-     * @param {N | null} node - The `node` parameter is a BinaryTreeNode object representing the starting
-     * node for the level order traversal. It can be null if no specific node is provided, in which case the root node of
-     * the tree is used as the starting node.
-     * @param {NodeOrPropertyName} [nodeOrPropertyName] - The `nodeOrPropertyName` parameter is an optional parameter that
-     * can be either a `BinaryTreeNode` property name or the string `'id'`. If a property name is provided, the function
-     * will accumulate results based on that property. If no property name is provided, the function will default to
-     * accumulating results
-     * @returns The function `levelIterative` returns an object of type `AbstractBinaryTreeNodeProperties<N>`.
-     */
-    levelIterative(node, nodeOrPropertyName) {
+    };
+    AbstractBinaryTree.prototype.levelIterative = function (node, nodeOrPropertyName) {
         nodeOrPropertyName = nodeOrPropertyName || 'id';
         node = node || this.root;
         if (!node)
             return [];
         this._clearResults();
-        const queue = [node];
+        var queue = [node];
         while (queue.length > 0) {
-            const cur = queue.shift();
+            var cur = queue.shift();
             if (cur) {
                 this._accumulatedByPropertyName(cur, nodeOrPropertyName);
                 if (cur.left) {
@@ -945,23 +770,14 @@ class AbstractBinaryTree {
             }
         }
         return this._getResultByPropertyName(nodeOrPropertyName);
-    }
-    /**
-     * The `listLevels` function collects nodes from a binary tree by a specified property and organizes them into levels.
-     * @param {N | null} node - The `node` parameter is a BinaryTreeNode object or null. It represents the
-     * root node of a binary tree. If it is null, the function will use the root node of the current binary tree instance.
-     * @param {NodeOrPropertyName} [nodeOrPropertyName] - The `nodeOrPropertyName` parameter is an optional parameter that
-     * specifies the property of the `BinaryTreeNode` object to collect at each level. It can be one of the following
-     * values:
-     * @returns The function `listLevels` returns a 2D array of `AbstractBinaryTreeNodeProperty<N>` objects.
-     */
-    listLevels(node, nodeOrPropertyName) {
+    };
+    AbstractBinaryTree.prototype.listLevels = function (node, nodeOrPropertyName) {
         nodeOrPropertyName = nodeOrPropertyName || 'id';
         node = node || this.root;
         if (!node)
             return [];
-        const levelsNodes = [];
-        const collectByProperty = (node, level) => {
+        var levelsNodes = [];
+        var collectByProperty = function (node, level) {
             switch (nodeOrPropertyName) {
                 case 'id':
                     levelsNodes[level].push(node.id);
@@ -978,42 +794,37 @@ class AbstractBinaryTree {
             }
         };
         if (this.loopType === types_1.LoopType.RECURSIVE) {
-            const _recursive = (node, level) => {
+            var _recursive_1 = function (node, level) {
                 if (!levelsNodes[level])
                     levelsNodes[level] = [];
                 collectByProperty(node, level);
                 if (node.left)
-                    _recursive(node.left, level + 1);
+                    _recursive_1(node.left, level + 1);
                 if (node.right)
-                    _recursive(node.right, level + 1);
+                    _recursive_1(node.right, level + 1);
             };
-            _recursive(node, 0);
+            _recursive_1(node, 0);
         }
         else {
-            const stack = [[node, 0]];
+            var stack = [[node, 0]];
             while (stack.length > 0) {
-                const head = stack.pop();
-                const [node, level] = head;
+                var head = stack.pop();
+                var _a = __read(head, 2), node_1 = _a[0], level = _a[1];
                 if (!levelsNodes[level])
                     levelsNodes[level] = [];
-                collectByProperty(node, level);
-                if (node.right)
-                    stack.push([node.right, level + 1]);
-                if (node.left)
-                    stack.push([node.left, level + 1]);
+                collectByProperty(node_1, level);
+                if (node_1.right)
+                    stack.push([node_1.right, level + 1]);
+                if (node_1.left)
+                    stack.push([node_1.left, level + 1]);
             }
         }
         return levelsNodes;
-    }
-    /**
-     * The function returns the predecessor of a given node in a binary tree.
-     * @param node - The parameter `node` is a BinaryTreeNode object, representing a node in a binary tree.
-     * @returns the predecessor of the given node in a binary tree.
-     */
-    getPredecessor(node) {
+    };
+    AbstractBinaryTree.prototype.getPredecessor = function (node) {
         if (node.left) {
-            let predecessor = node.left;
-            while (!(predecessor) || predecessor.right && predecessor.right !== node) {
+            var predecessor = node.left;
+            while (!predecessor || (predecessor.right && predecessor.right !== node)) {
                 if (predecessor) {
                     predecessor = predecessor.right;
                 }
@@ -1023,27 +834,18 @@ class AbstractBinaryTree {
         else {
             return node;
         }
-    }
-    /**
-     * The `morris` function performs an in-order, pre-order, or post-order traversal on a binary tree using the Morris
-     * traversal algorithm.
-     * @param {'in' | 'pre' | 'post'} [pattern] - The `pattern` parameter determines the traversal pattern for the binary
-     * tree. It can have one of three values:
-     * @param {NodeOrPropertyName} [nodeOrPropertyName] - The `nodeOrPropertyName` parameter is used to specify the
-     * property name of the nodes that you want to retrieve. It can be any valid property name of the nodes in the binary
-     * tree.
-     * @returns an array of AbstractBinaryTreeNodeProperties<N> objects.
-     */
-    morris(pattern, nodeOrPropertyName) {
+    };
+    AbstractBinaryTree.prototype.morris = function (pattern, nodeOrPropertyName) {
+        var _this = this;
         if (this.root === null)
             return [];
         pattern = pattern || 'in';
         nodeOrPropertyName = nodeOrPropertyName || 'id';
         this._clearResults();
-        let cur = this.root;
-        const _reverseEdge = (node) => {
-            let pre = null;
-            let next = null;
+        var cur = this.root;
+        var _reverseEdge = function (node) {
+            var pre = null;
+            var next = null;
             while (node) {
                 next = node.right;
                 node.right = pre;
@@ -1052,11 +854,11 @@ class AbstractBinaryTree {
             }
             return pre;
         };
-        const _printEdge = (node) => {
-            const tail = _reverseEdge(node);
-            let cur = tail;
+        var _printEdge = function (node) {
+            var tail = _reverseEdge(node);
+            var cur = tail;
             while (cur) {
-                this._accumulatedByPropertyName(cur, nodeOrPropertyName);
+                _this._accumulatedByPropertyName(cur, nodeOrPropertyName);
                 cur = cur.right;
             }
             _reverseEdge(tail);
@@ -1065,7 +867,7 @@ class AbstractBinaryTree {
             case 'in':
                 while (cur) {
                     if (cur.left) {
-                        const predecessor = this.getPredecessor(cur);
+                        var predecessor = this.getPredecessor(cur);
                         if (!predecessor.right) {
                             predecessor.right = cur;
                             cur = cur.left;
@@ -1082,7 +884,7 @@ class AbstractBinaryTree {
             case 'pre':
                 while (cur) {
                     if (cur.left) {
-                        const predecessor = this.getPredecessor(cur);
+                        var predecessor = this.getPredecessor(cur);
                         if (!predecessor.right) {
                             predecessor.right = cur;
                             this._accumulatedByPropertyName(cur, nodeOrPropertyName);
@@ -1102,7 +904,7 @@ class AbstractBinaryTree {
             case 'post':
                 while (cur) {
                     if (cur.left) {
-                        const predecessor = this.getPredecessor(cur);
+                        var predecessor = this.getPredecessor(cur);
                         if (predecessor.right === null) {
                             predecessor.right = cur;
                             cur = cur.left;
@@ -1119,21 +921,9 @@ class AbstractBinaryTree {
                 break;
         }
         return this._getResultByPropertyName(nodeOrPropertyName);
-    }
-    /**
-     * The function adds a new node to a binary tree if there is an available position.
-     * @param {N | null} newNode - The `newNode` parameter is of type `N | null`, which means it can either be a node of
-     * type `N` or `null`. It represents the node that you want to add to the binary tree.
-     * @param {N} parent - The parent parameter is of type N, which represents a node in a binary tree.
-     * @returns either the left or right child node of the parent node, depending on which child is available for adding
-     * the new node. If a new node is added, the function also updates the size of the binary tree. If neither the left nor
-     * right child is available, the function returns undefined. If the parent node is null, the function also returns
-     * undefined.
-     */
-    _addTo(newNode, parent) {
+    };
+    AbstractBinaryTree.prototype._addTo = function (newNode, parent) {
         if (parent) {
-            // When all leaf nodes are null, it will no longer be possible to add new entity nodes to this binary tree.
-            // In this scenario, null nodes serve as "sentinel nodes," "virtual nodes," or "placeholder nodes."
             if (parent.left === undefined) {
                 parent.left = newNode;
                 if (newNode) {
@@ -1155,86 +945,38 @@ class AbstractBinaryTree {
         else {
             return;
         }
-    }
-    /**
-     * The function sets the loop type for a protected variable.
-     * @param {LoopType} value - The value parameter is of type LoopType.
-     */
-    _setLoopType(value) {
+    };
+    AbstractBinaryTree.prototype._setLoopType = function (value) {
         this._loopType = value;
-    }
-    /**
-     * The function sets the value of the `_visitedId` property in a protected manner.
-     * @param {BinaryTreeNodeId[]} value - value is an array of BinaryTreeNodeId values.
-     */
-    _setVisitedId(value) {
+    };
+    AbstractBinaryTree.prototype._setVisitedId = function (value) {
         this._visitedId = value;
-    }
-    /**
-     * The function sets the value of the "_visitedVal" property to the given array.
-     * @param value - An array of type N.
-     */
-    _setVisitedVal(value) {
+    };
+    AbstractBinaryTree.prototype._setVisitedVal = function (value) {
         this._visitedVal = value;
-    }
-    /**
-     * The function sets the value of the _visitedNode property.
-     * @param {N[]} value - N[] is an array of elements of type N.
-     */
-    _setVisitedNode(value) {
+    };
+    AbstractBinaryTree.prototype._setVisitedNode = function (value) {
         this._visitedNode = value;
-    }
-    /**
-     * The function sets the value of the `_visitedLeftSum` property to the provided array.
-     * @param {number[]} value - An array of numbers that represents the visited left sum.
-     */
-    _setVisitedLeftSum(value) {
+    };
+    AbstractBinaryTree.prototype._setVisitedLeftSum = function (value) {
         this._visitedLeftSum = value;
-    }
-    /**
-     * The function sets the root property of an object to a given value, and if the value is not null, it also sets the
-     * parent property of the value to undefined.
-     * @param {N | null} v - The parameter `v` is of type `N | null`, which means it can either be of type `N` or `null`.
-     */
-    _setRoot(v) {
+    };
+    AbstractBinaryTree.prototype._setRoot = function (v) {
         if (v) {
             v.parent = undefined;
         }
         this._root = v;
-    }
-    /**
-     * The function sets the size of a protected variable.
-     * @param {number} v - number
-     */
-    _setSize(v) {
+    };
+    AbstractBinaryTree.prototype._setSize = function (v) {
         this._size = v;
-    }
-    /**
-     * The function `_clearResults` resets the values of several arrays used for tracking visited nodes and their
-     * properties.
-     */
-    _clearResults() {
+    };
+    AbstractBinaryTree.prototype._clearResults = function () {
         this._visitedId = [];
         this._visitedVal = [];
         this._visitedNode = [];
         this._visitedLeftSum = [];
-    }
-    /**
-     * The function checks if a given property of a binary tree node matches a specified value, and if so, adds the node to
-     * a result array.
-     * @param {N} cur - The current node being processed.
-     * @param {(N | null | undefined)[]} result - An array that stores the matching nodes.
-     * @param {BinaryTreeNodeId | N} nodeProperty - The `nodeProperty` parameter is either a `BinaryTreeNodeId` or a `N`
-     * type. It represents the property value that we are comparing against in the switch statement.
-     * @param {BinaryTreeNodePropertyName} [propertyName] - The `propertyName` parameter is an optional parameter that
-     * specifies the property name to compare against when pushing nodes into the `result` array. It can be either `'id'`
-     * or `'val'`. If it is not provided or is not equal to `'id'` or `'val'`, the
-     * @param {boolean} [onlyOne] - The `onlyOne` parameter is an optional boolean parameter that determines whether to
-     * stop after finding the first matching node or continue searching for all matching nodes. If `onlyOne` is set to
-     * `true`, the function will stop after finding the first matching node and return `true`. If `onlyOne
-     * @returns a boolean value indicating whether only one matching node should be pushed into the result array.
-     */
-    _pushByPropertyNameStopOrNot(cur, result, nodeProperty, propertyName, onlyOne) {
+    };
+    AbstractBinaryTree.prototype._pushByPropertyNameStopOrNot = function (cur, result, nodeProperty, propertyName, onlyOne) {
         switch (propertyName) {
             case 'id':
                 if (cur.id === nodeProperty) {
@@ -1255,15 +997,8 @@ class AbstractBinaryTree {
                 }
                 break;
         }
-    }
-    /**
-     * The function `_accumulatedByPropertyName` accumulates values from a given node based on the specified property name.
-     * @param {N} node - The `node` parameter is of type `N`, which represents a node in a data structure.
-     * @param {NodeOrPropertyName} [nodeOrPropertyName] - The `nodeOrPropertyName` parameter is an optional parameter that
-     * can be either a string representing a property name or a reference to a `Node` object. If it is a string, it
-     * specifies the property name to be used for accumulating values. If it is a `Node` object, it specifies
-     */
-    _accumulatedByPropertyName(node, nodeOrPropertyName) {
+    };
+    AbstractBinaryTree.prototype._accumulatedByPropertyName = function (node, nodeOrPropertyName) {
         nodeOrPropertyName = nodeOrPropertyName !== null && nodeOrPropertyName !== void 0 ? nodeOrPropertyName : 'id';
         switch (nodeOrPropertyName) {
             case 'id':
@@ -1279,19 +1014,8 @@ class AbstractBinaryTree {
                 this._visitedId.push(node.id);
                 break;
         }
-    }
-    /**
-     * The time complexity of Morris traversal is O(n), it's may slower than others
-     * The space complexity  Morris traversal is O(1) because no using stack
-     */
-    /**
-     * The function `_getResultByPropertyName` returns the corresponding property value based on the given node or property
-     * name.
-     * @param {NodeOrPropertyName} [nodeOrPropertyName] - The parameter `nodeOrPropertyName` is an optional parameter that
-     * can accept either a `NodeOrPropertyName` type or be undefined.
-     * @returns The method `_getResultByPropertyName` returns an instance of `AbstractBinaryTreeNodeProperties<N>`.
-     */
-    _getResultByPropertyName(nodeOrPropertyName) {
+    };
+    AbstractBinaryTree.prototype._getResultByPropertyName = function (nodeOrPropertyName) {
         nodeOrPropertyName = nodeOrPropertyName !== null && nodeOrPropertyName !== void 0 ? nodeOrPropertyName : 'id';
         switch (nodeOrPropertyName) {
             case 'id':
@@ -1303,6 +1027,8 @@ class AbstractBinaryTree {
             default:
                 return this._visitedId;
         }
-    }
-}
+    };
+    return AbstractBinaryTree;
+}());
 exports.AbstractBinaryTree = AbstractBinaryTree;
+//# sourceMappingURL=abstract-binary-tree.js.map