data-structure-typed 1.19.3 → 1.19.4

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

@@ -6,38 +6,11 @@
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-var __values = (this && this.__values) || function(o) {
-    var s = typeof Symbol === "function" && Symbol.iterator, m = s && o[s], i = 0;
-    if (m) return m.call(o);
-    if (o && typeof o.length === "number") return {
-        next: function () {
-            if (o && i >= o.length) o = void 0;
-            return { value: o && o[i++], done: !o };
-        }
-    };
-    throw new TypeError(s ? "Object is not iterable." : "Symbol.iterator is not defined.");
-};
-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;
-var utils_1 = require("../../utils");
-var types_1 = require("../types");
-var AbstractBinaryTreeNode = /** @class */ (function () {
+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
@@ -45,127 +18,98 @@ var AbstractBinaryTreeNode = /** @class */ (function () {
      * @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.
      */
-    function AbstractBinaryTreeNode(id, val) {
+    constructor(id, val) {
         this._height = 0;
         this._id = id;
         this._val = val;
     }
-    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", {
-        /**
-         * The function determines the position of a node in a family tree structure.
-         * @returns a value of type `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;
-                    }
+    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;
                 }
                 else {
-                    return types_1.FamilyPosition.MAL_NODE;
+                    return types_1.FamilyPosition.LEFT;
                 }
             }
-            else {
+            else if (that.parent.right === that) {
                 if (that.left || that.right) {
-                    return types_1.FamilyPosition.ROOT;
+                    return types_1.FamilyPosition.ROOT_RIGHT;
                 }
                 else {
-                    return types_1.FamilyPosition.ISOLATED;
+                    return types_1.FamilyPosition.RIGHT;
                 }
             }
-        },
-        enumerable: false,
-        configurable: true
-    });
-    return AbstractBinaryTreeNode;
-}());
+            else {
+                return types_1.FamilyPosition.MAL_NODE;
+            }
+        }
+        else {
+            if (that.left || that.right) {
+                return types_1.FamilyPosition.ROOT;
+            }
+            else {
+                return types_1.FamilyPosition.ISOLATED;
+            }
+        }
+    }
+}
 exports.AbstractBinaryTreeNode = AbstractBinaryTreeNode;
-var AbstractBinaryTree = /** @class */ (function () {
+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.
      */
-    function AbstractBinaryTree(options) {
+    constructor(options) {
         this._root = null;
         this._size = 0;
         this._loopType = types_1.LoopType.ITERATIVE;
@@ -179,89 +123,45 @@ var AbstractBinaryTree = /** @class */ (function () {
         this._visitedCount = [];
         this._visitedLeftSum = [];
         if (options !== undefined) {
-            var _a = options.loopType, loopType = _a === void 0 ? types_1.LoopType.ITERATIVE : _a, _b = options.autoIncrementId, autoIncrementId = _b === void 0 ? false : _b, _c = options.isMergeDuplicatedVal, isMergeDuplicatedVal = _c === void 0 ? true : _c;
+            const { loopType = types_1.LoopType.ITERATIVE, autoIncrementId = false, isMergeDuplicatedVal = true } = options;
             this._isMergeDuplicatedVal = isMergeDuplicatedVal;
             this._autoIncrementId = autoIncrementId;
             this._loopType = loopType;
         }
     }
-    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, "autoIncrementId", {
-        get: function () {
-            return this._autoIncrementId;
-        },
-        enumerable: false,
-        configurable: true
-    });
-    Object.defineProperty(AbstractBinaryTree.prototype, "maxId", {
-        get: function () {
-            return this._maxId;
-        },
-        enumerable: false,
-        configurable: true
-    });
-    Object.defineProperty(AbstractBinaryTree.prototype, "isMergeDuplicatedVal", {
-        get: function () {
-            return this._isMergeDuplicatedVal;
-        },
-        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, "visitedCount", {
-        get: function () {
-            return this._visitedCount;
-        },
-        enumerable: false,
-        configurable: true
-    });
-    Object.defineProperty(AbstractBinaryTree.prototype, "visitedLeftSum", {
-        get: function () {
-            return this._visitedLeftSum;
-        },
-        enumerable: false,
-        configurable: true
-    });
+    get root() {
+        return this._root;
+    }
+    get size() {
+        return this._size;
+    }
+    get loopType() {
+        return this._loopType;
+    }
+    get autoIncrementId() {
+        return this._autoIncrementId;
+    }
+    get maxId() {
+        return this._maxId;
+    }
+    get isMergeDuplicatedVal() {
+        return this._isMergeDuplicatedVal;
+    }
+    get visitedId() {
+        return this._visitedId;
+    }
+    get visitedVal() {
+        return this._visitedVal;
+    }
+    get visitedNode() {
+        return this._visitedNode;
+    }
+    get visitedCount() {
+        return this._visitedCount;
+    }
+    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.
@@ -269,9 +169,9 @@ var AbstractBinaryTree = /** @class */ (function () {
      * be swapped to.
      * @returns The `destNode` is being returned.
      */
-    AbstractBinaryTree.prototype.swapLocation = function (srcNode, destNode) {
-        var val = destNode.val, height = destNode.height, id = destNode.id;
-        var tempNode = this.createNode(id, val);
+    swapLocation(srcNode, destNode) {
+        const { val, height, id } = destNode;
+        const tempNode = this.createNode(id, val);
         if (tempNode) {
             tempNode.height = height;
             if (tempNode instanceof AbstractBinaryTreeNode) {
@@ -285,22 +185,22 @@ var AbstractBinaryTree = /** @class */ (function () {
             }
         }
         return destNode;
-    };
+    }
     /**
      * The clear() function resets the root, size, and maxId properties to their initial values.
      */
-    AbstractBinaryTree.prototype.clear = function () {
+    clear() {
         this._setRoot(null);
         this._setSize(0);
         this._setMaxId(-1);
-    };
+    }
     /**
      * 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.
      */
-    AbstractBinaryTree.prototype.isEmpty = function () {
+    isEmpty() {
         return this.size === 0;
-    };
+    }
     /**
      * The `add` function adds a new node to a binary tree, updating the value of an existing node if it already exists.
      * @param {BinaryTreeNodeId} id - The `id` parameter is the identifier of the binary tree node that you want to add.
@@ -310,16 +210,15 @@ var AbstractBinaryTree = /** @class */ (function () {
      * should be added to the binary tree. If not provided, the default value is `undefined`.
      * @returns The function `add` returns either a `BinaryTreeNode` object (`N`), `null`, or `undefined`.
      */
-    AbstractBinaryTree.prototype.add = function (id, val, count) {
-        var _this = this;
-        var _bfs = function (root, newNode) {
-            var queue = [root];
+    add(id, val, count) {
+        const _bfs = (root, newNode) => {
+            const queue = [root];
             while (queue.length > 0) {
-                var cur = queue.shift();
+                const cur = queue.shift();
                 if (cur) {
-                    var inserted_1 = _this.addTo(newNode, cur);
-                    if (inserted_1 !== undefined)
-                        return inserted_1;
+                    const inserted = this.addTo(newNode, cur);
+                    if (inserted !== undefined)
+                        return inserted;
                     if (cur.left)
                         queue.push(cur.left);
                     if (cur.right)
@@ -330,9 +229,9 @@ var AbstractBinaryTree = /** @class */ (function () {
             }
             return;
         };
-        var inserted;
-        var needInsert = val !== null ? this.createNode(id, val) : null;
-        var existNode = val !== null ? this.get(id, 'id') : null;
+        let inserted;
+        const needInsert = val !== null ? this.createNode(id, val) : null;
+        const existNode = val !== null ? this.get(id, 'id') : null;
         if (this.root) {
             if (existNode) {
                 existNode.val = val !== null && val !== void 0 ? val : id;
@@ -352,7 +251,7 @@ var AbstractBinaryTree = /** @class */ (function () {
             inserted = this.root;
         }
         return inserted;
-    };
+    }
     /**
      * The function adds a new node to the left or right child of a parent node, updating the size of the tree if
      * necessary.
@@ -362,7 +261,7 @@ var AbstractBinaryTree = /** @class */ (function () {
      * child.
      * @returns either the left child node, the right child node, or undefined.
      */
-    AbstractBinaryTree.prototype.addTo = function (newNode, parent) {
+    addTo(newNode, parent) {
         if (parent) {
             if (parent.left === undefined) {
                 if (newNode) {
@@ -391,7 +290,7 @@ var AbstractBinaryTree = /** @class */ (function () {
         else {
             return;
         }
-    };
+    }
     /**
      * The `addMany` function adds multiple nodes to a binary tree and returns an array of the inserted nodes or
      * null/undefined values.
@@ -399,83 +298,61 @@ var AbstractBinaryTree = /** @class */ (function () {
      * `N['val']` values.
      * @returns The function `addMany` returns an array of values of type `N | null | undefined`.
      */
-    AbstractBinaryTree.prototype.addMany = function (data) {
-        var e_1, _a, e_2, _b;
-        var _c;
+    addMany(data) {
+        var _a;
         // TODO not sure addMany not be run multi times
-        var inserted = [];
-        var map = new Map();
+        const inserted = [];
+        const map = new Map();
         if (this.isMergeDuplicatedVal) {
-            try {
-                for (var data_1 = __values(data), data_1_1 = data_1.next(); !data_1_1.done; data_1_1 = data_1.next()) {
-                    var nodeOrId = data_1_1.value;
-                    map.set(nodeOrId, ((_c = map.get(nodeOrId)) !== null && _c !== void 0 ? _c : 0) + 1);
-                }
+            for (const nodeOrId of data)
+                map.set(nodeOrId, ((_a = map.get(nodeOrId)) !== null && _a !== void 0 ? _a : 0) + 1);
+        }
+        for (const nodeOrId of data) {
+            if (nodeOrId instanceof AbstractBinaryTreeNode) {
+                inserted.push(this.add(nodeOrId.id, nodeOrId.val));
+                continue;
             }
-            catch (e_1_1) { e_1 = { error: e_1_1 }; }
-            finally {
-                try {
-                    if (data_1_1 && !data_1_1.done && (_a = data_1.return)) _a.call(data_1);
-                }
-                finally { if (e_1) throw e_1.error; }
+            if (nodeOrId === null) {
+                inserted.push(this.add(NaN, null, 0));
+                continue;
             }
-        }
-        try {
-            for (var data_2 = __values(data), data_2_1 = data_2.next(); !data_2_1.done; data_2_1 = data_2.next()) {
-                var nodeOrId = data_2_1.value;
-                if (nodeOrId instanceof AbstractBinaryTreeNode) {
-                    inserted.push(this.add(nodeOrId.id, nodeOrId.val));
-                    continue;
-                }
-                if (nodeOrId === null) {
-                    inserted.push(this.add(NaN, null, 0));
-                    continue;
-                }
-                // TODO will this cause an issue?
-                var count = this.isMergeDuplicatedVal ? map.get(nodeOrId) : 1;
-                var newId = void 0;
-                if (typeof nodeOrId === 'number') {
-                    newId = this.autoIncrementId ? this.maxId + 1 : nodeOrId;
+            // TODO will this cause an issue?
+            const count = this.isMergeDuplicatedVal ? map.get(nodeOrId) : 1;
+            let newId;
+            if (typeof nodeOrId === 'number') {
+                newId = this.autoIncrementId ? this.maxId + 1 : nodeOrId;
+            }
+            else if (nodeOrId instanceof Object) {
+                if (this.autoIncrementId) {
+                    newId = this.maxId + 1;
                 }
-                else if (nodeOrId instanceof Object) {
-                    if (this.autoIncrementId) {
-                        newId = this.maxId + 1;
+                else {
+                    if (Object.keys(nodeOrId).includes('id')) {
+                        newId = nodeOrId.id;
                     }
                     else {
-                        if (Object.keys(nodeOrId).includes('id')) {
-                            newId = nodeOrId.id;
-                        }
-                        else {
-                            console.warn(nodeOrId, 'Object value must has an id property when the autoIncrementId is false');
-                            continue;
-                        }
+                        console.warn(nodeOrId, 'Object value must has an id property when the autoIncrementId is false');
+                        continue;
                     }
                 }
-                else {
-                    console.warn(nodeOrId, " is not added");
-                    continue;
-                }
-                if (this.isMergeDuplicatedVal) {
-                    if (map.has(nodeOrId)) {
-                        inserted.push(this.add(newId, nodeOrId, count));
-                        map.delete(nodeOrId);
-                    }
-                }
-                else {
-                    inserted.push(this.add(newId, nodeOrId, 1));
+            }
+            else {
+                console.warn(nodeOrId, ` is not added`);
+                continue;
+            }
+            if (this.isMergeDuplicatedVal) {
+                if (map.has(nodeOrId)) {
+                    inserted.push(this.add(newId, nodeOrId, count));
+                    map.delete(nodeOrId);
                 }
-                this._setMaxId(newId);
             }
-        }
-        catch (e_2_1) { e_2 = { error: e_2_1 }; }
-        finally {
-            try {
-                if (data_2_1 && !data_2_1.done && (_b = data_2.return)) _b.call(data_2);
+            else {
+                inserted.push(this.add(newId, nodeOrId, 1));
             }
-            finally { if (e_2) throw e_2.error; }
+            this._setMaxId(newId);
         }
         return inserted;
-    };
+    }
     /**
      * The `fill` function clears the current data and adds new data, returning a boolean indicating if the operation was
      * successful.
@@ -483,10 +360,10 @@ var AbstractBinaryTree = /** @class */ (function () {
      * Each object or array should have a property called `val`.
      * @returns a boolean value.
      */
-    AbstractBinaryTree.prototype.fill = function (data) {
+    fill(data) {
         this.clear();
         return data.length === this.addMany(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.
@@ -497,22 +374,22 @@ var AbstractBinaryTree = /** @class */ (function () {
      * 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.
      */
-    AbstractBinaryTree.prototype.remove = function (nodeOrId, ignoreCount) {
-        var bstDeletedResult = [];
+    remove(nodeOrId, ignoreCount) {
+        const bstDeletedResult = [];
         if (!this.root)
             return bstDeletedResult;
-        var curr = (typeof nodeOrId === 'number') ? this.get(nodeOrId) : nodeOrId;
+        const curr = (typeof nodeOrId === 'number') ? this.get(nodeOrId) : nodeOrId;
         if (!curr)
             return bstDeletedResult;
-        var parent = (curr === null || curr === void 0 ? void 0 : curr.parent) ? curr.parent : null;
-        var needBalanced = null, orgCurrent = curr;
+        const parent = (curr === null || curr === void 0 ? void 0 : curr.parent) ? curr.parent : null;
+        let needBalanced = null, orgCurrent = curr;
         if (!curr.left) {
             if (!parent) {
                 if (curr.right !== undefined)
                     this._setRoot(curr.right);
             }
             else {
-                var fp = curr.familyPosition;
+                const { familyPosition: fp } = curr;
                 if (fp === types_1.FamilyPosition.LEFT || fp === types_1.FamilyPosition.ROOT_LEFT) {
                     parent.left = curr.right;
                 }
@@ -523,9 +400,9 @@ var AbstractBinaryTree = /** @class */ (function () {
             }
         }
         else {
-            var leftSubTreeRightMost = curr.left ? this.getRightMost(curr.left) : null;
+            const leftSubTreeRightMost = curr.left ? this.getRightMost(curr.left) : null;
             if (leftSubTreeRightMost) {
-                var parentOfLeftSubTreeMax = leftSubTreeRightMost.parent;
+                const parentOfLeftSubTreeMax = leftSubTreeRightMost.parent;
                 orgCurrent = this.swapLocation(curr, leftSubTreeRightMost);
                 if (parentOfLeftSubTreeMax) {
                     if (parentOfLeftSubTreeMax.right === leftSubTreeRightMost)
@@ -537,24 +414,24 @@ var AbstractBinaryTree = /** @class */ (function () {
             }
         }
         this._setSize(this.size - 1);
-        bstDeletedResult.push({ deleted: orgCurrent, needBalanced: needBalanced });
+        bstDeletedResult.push({ deleted: orgCurrent, 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.
      */
-    AbstractBinaryTree.prototype.getDepth = function (beginRoot) {
+    getDepth(beginRoot) {
         if (typeof beginRoot === 'number')
             beginRoot = this.get(beginRoot, 'id');
-        var depth = 0;
+        let 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
@@ -562,30 +439,30 @@ var AbstractBinaryTree = /** @class */ (function () {
      * node), or `null`.
      * @returns the height of the binary tree.
      */
-    AbstractBinaryTree.prototype.getHeight = function (beginRoot) {
+    getHeight(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) {
-            var _getMaxHeight_1 = function (cur) {
+            const _getMaxHeight = (cur) => {
                 if (!cur)
                     return -1;
-                var leftHeight = _getMaxHeight_1(cur.left);
-                var rightHeight = _getMaxHeight_1(cur.right);
+                const leftHeight = _getMaxHeight(cur.left);
+                const rightHeight = _getMaxHeight(cur.right);
                 return Math.max(leftHeight, rightHeight) + 1;
             };
-            return _getMaxHeight_1(beginRoot);
+            return _getMaxHeight(beginRoot);
         }
         else {
             if (!beginRoot) {
                 return -1;
             }
-            var stack = [{ node: beginRoot, depth: 0 }];
-            var maxHeight = 0;
+            const stack = [{ node: beginRoot, depth: 0 }];
+            let maxHeight = 0;
             while (stack.length > 0) {
-                var _a = stack.pop(), node = _a.node, depth = _a.depth;
+                const { node, depth } = stack.pop();
                 if (node.left) {
                     stack.push({ node: node.left, depth: depth + 1 });
                 }
@@ -596,7 +473,7 @@ var AbstractBinaryTree = /** @class */ (function () {
             }
             return maxHeight;
         }
-    };
+    }
     /**
      * The `getMinHeight` function calculates the minimum height of a binary tree using either a recursive or iterative
      * approach.
@@ -605,27 +482,27 @@ var AbstractBinaryTree = /** @class */ (function () {
      * for `beginRoot`, the `this.root` property is used as the default value.
      * @returns The function `getMinHeight` returns the minimum height of the binary tree.
      */
-    AbstractBinaryTree.prototype.getMinHeight = function (beginRoot) {
+    getMinHeight(beginRoot) {
         var _a, _b, _c;
         beginRoot = beginRoot || this.root;
         if (!beginRoot)
             return -1;
         if (this._loopType === types_1.LoopType.RECURSIVE) {
-            var _getMinHeight_1 = function (cur) {
+            const _getMinHeight = (cur) => {
                 if (!cur)
                     return 0;
                 if (!cur.left && !cur.right)
                     return 0;
-                var leftMinHeight = _getMinHeight_1(cur.left);
-                var rightMinHeight = _getMinHeight_1(cur.right);
+                const leftMinHeight = _getMinHeight(cur.left);
+                const rightMinHeight = _getMinHeight(cur.right);
                 return Math.min(leftMinHeight, rightMinHeight) + 1;
             };
-            return _getMinHeight_1(beginRoot);
+            return _getMinHeight(beginRoot);
         }
         else {
-            var stack = [];
-            var node = beginRoot, last = null;
-            var depths = new Map();
+            const stack = [];
+            let node = beginRoot, last = null;
+            const depths = new Map();
             while (stack.length > 0 || node) {
                 if (node) {
                     stack.push(node);
@@ -636,8 +513,8 @@ var AbstractBinaryTree = /** @class */ (function () {
                     if (!node.right || last === node.right) {
                         node = stack.pop();
                         if (node) {
-                            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;
+                            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;
                             depths.set(node, 1 + Math.min(leftMinHeight, rightMinHeight));
                             last = node;
                             node = null;
@@ -649,7 +526,7 @@ var AbstractBinaryTree = /** @class */ (function () {
             }
             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.
@@ -657,9 +534,9 @@ var AbstractBinaryTree = /** @class */ (function () {
      * tree or null if the tree is empty.
      * @returns The method is returning a boolean value.
      */
-    AbstractBinaryTree.prototype.isPerfectlyBalanced = function (beginRoot) {
+    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
@@ -671,27 +548,26 @@ var AbstractBinaryTree = /** @class */ (function () {
      * function will stop traversing the tree and return the first matching node. If `only
      * @returns an array of nodes (type N).
      */
-    AbstractBinaryTree.prototype.getNodes = function (nodeProperty, propertyName, onlyOne) {
-        var _this = this;
+    getNodes(nodeProperty, propertyName, onlyOne) {
         if (!this.root)
             return [];
         propertyName = propertyName !== null && propertyName !== void 0 ? propertyName : 'id';
-        var result = [];
+        const result = [];
         if (this.loopType === types_1.LoopType.RECURSIVE) {
-            var _traverse_1 = function (cur) {
-                if (_this._pushByPropertyNameStopOrNot(cur, result, nodeProperty, propertyName, onlyOne))
+            const _traverse = (cur) => {
+                if (this._pushByPropertyNameStopOrNot(cur, result, nodeProperty, propertyName, onlyOne))
                     return;
                 if (!cur.left && !cur.right)
                     return;
-                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;
@@ -701,7 +577,7 @@ var AbstractBinaryTree = /** @class */ (function () {
             }
         }
         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`.
@@ -710,10 +586,10 @@ var AbstractBinaryTree = /** @class */ (function () {
      * specifies the name of the property to be checked in the nodes. If not provided, it defaults to 'id'.
      * @returns a boolean value.
      */
-    AbstractBinaryTree.prototype.has = function (nodeProperty, propertyName) {
+    has(nodeProperty, propertyName) {
         propertyName = propertyName !== null && propertyName !== void 0 ? propertyName : 'id';
         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.
@@ -725,26 +601,26 @@ var AbstractBinaryTree = /** @class */ (function () {
      * @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.
      */
-    AbstractBinaryTree.prototype.get = function (nodeProperty, propertyName) {
+    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;
-    };
+    }
     /**
      * 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[]`).
      */
-    AbstractBinaryTree.prototype.getPathToRoot = function (node) {
-        var result = [];
+    getPathToRoot(node) {
+        const result = [];
         while (node.parent) {
             result.unshift(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.
@@ -755,30 +631,30 @@ var AbstractBinaryTree = /** @class */ (function () {
      * 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`.
      */
-    AbstractBinaryTree.prototype.getLeftMost = function (beginRoot) {
+    getLeftMost(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) {
-            var _traverse_2 = function (cur) {
+            const _traverse = (cur) => {
                 if (!cur.left)
                     return cur;
-                return _traverse_2(cur.left);
+                return _traverse(cur.left);
             };
-            return _traverse_2(beginRoot);
+            return _traverse(beginRoot);
         }
         else {
             // Indirect implementation of iteration using tail recursion optimization
-            var _traverse_3 = (0, utils_1.trampoline)(function (cur) {
+            const _traverse = (0, utils_1.trampoline)((cur) => {
                 if (!cur.left)
                     return cur;
-                return _traverse_3.cont(cur.left);
+                return _traverse.cont(cur.left);
             });
-            return _traverse_3(beginRoot);
+            return _traverse(beginRoot);
         }
-    };
+    }
     /**
      * The `getRightMost` function returns the rightmost node in a binary tree, either recursively or iteratively using
      * tail recursion optimization.
@@ -789,50 +665,50 @@ var AbstractBinaryTree = /** @class */ (function () {
      * 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`.
      */
-    AbstractBinaryTree.prototype.getRightMost = function (node) {
+    getRightMost(node) {
         node = node !== null && node !== void 0 ? node : this.root;
         if (!node)
             return node;
         if (this._loopType === types_1.LoopType.RECURSIVE) {
-            var _traverse_4 = function (cur) {
+            const _traverse = (cur) => {
                 if (!cur.right)
                     return cur;
-                return _traverse_4(cur.right);
+                return _traverse(cur.right);
             };
-            return _traverse_4(node);
+            return _traverse(node);
         }
         else {
             // Indirect implementation of iteration using tail recursion optimization
-            var _traverse_5 = (0, utils_1.trampoline)(function (cur) {
+            const _traverse = (0, utils_1.trampoline)((cur) => {
                 if (!cur.right)
                     return cur;
-                return _traverse_5.cont(cur.right);
+                return _traverse.cont(cur.right);
             });
-            return _traverse_5(node);
+            return _traverse(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.
      */
-    AbstractBinaryTree.prototype.isBSTByRooted = function (node) {
+    isBSTByRooted(node) {
         // TODO there is a bug
         if (!node)
             return true;
         if (this._loopType === types_1.LoopType.RECURSIVE) {
-            var dfs_1 = function (cur, min, max) {
+            const dfs = (cur, min, max) => {
                 if (!cur)
                     return true;
                 if (cur.id <= min || cur.id >= max)
                     return false;
-                return dfs_1(cur.left, min, cur.id) && dfs_1(cur.right, cur.id, max);
+                return dfs(cur.left, min, cur.id) && dfs(cur.right, cur.id, max);
             };
-            return dfs_1(node, Number.MIN_SAFE_INTEGER, Number.MAX_SAFE_INTEGER);
+            return dfs(node, Number.MIN_SAFE_INTEGER, Number.MAX_SAFE_INTEGER);
         }
         else {
-            var stack = [];
-            var prev = Number.MIN_SAFE_INTEGER, curr = node;
+            const stack = [];
+            let prev = Number.MIN_SAFE_INTEGER, curr = node;
             while (curr || stack.length > 0) {
                 while (curr) {
                     stack.push(curr);
@@ -846,46 +722,46 @@ var AbstractBinaryTree = /** @class */ (function () {
             }
             return true;
         }
-    };
+    }
     /**
      * The function checks if a binary tree is a binary search tree.
      * @param {N | null} [node] - The `node` parameter is of type `N` or `null`. It represents the root node of a binary
      * search tree (BST).
      * @returns a boolean value.
      */
-    AbstractBinaryTree.prototype.isBST = function (node) {
+    isBST(node) {
         return this.isBSTByRooted(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`.
      */
-    AbstractBinaryTree.prototype.getSubTreeSize = function (subTreeRoot) {
-        var size = 0;
+    getSubTreeSize(subTreeRoot) {
+        let size = 0;
         if (!subTreeRoot)
             return size;
         if (this._loopType === types_1.LoopType.RECURSIVE) {
-            var _traverse_6 = function (cur) {
+            const _traverse = (cur) => {
                 size++;
-                cur.left && _traverse_6(cur.left);
-                cur.right && _traverse_6(cur.right);
+                cur.left && _traverse(cur.left);
+                cur.right && _traverse(cur.right);
             };
-            _traverse_6(subTreeRoot);
+            _traverse(subTreeRoot);
             return size;
         }
         else {
-            var stack = [subTreeRoot];
+            const stack = [subTreeRoot];
             while (stack.length > 0) {
-                var cur = stack.pop();
+                const 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
@@ -895,15 +771,15 @@ var AbstractBinaryTree = /** @class */ (function () {
      * 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`.
      */
-    AbstractBinaryTree.prototype.subTreeSum = function (subTreeRoot, propertyName) {
+    subTreeSum(subTreeRoot, propertyName) {
         propertyName = propertyName !== null && propertyName !== void 0 ? propertyName : 'id';
         if (typeof subTreeRoot === 'number')
             subTreeRoot = this.get(subTreeRoot, 'id');
         if (!subTreeRoot)
             return 0;
-        var sum = 0;
-        var _sumByProperty = function (cur) {
-            var needSum;
+        let sum = 0;
+        const _sumByProperty = (cur) => {
+            let needSum;
             switch (propertyName) {
                 case 'id':
                     needSum = cur.id;
@@ -918,24 +794,24 @@ var AbstractBinaryTree = /** @class */ (function () {
             return needSum;
         };
         if (this._loopType === types_1.LoopType.RECURSIVE) {
-            var _traverse_7 = function (cur) {
+            const _traverse = (cur) => {
                 sum += _sumByProperty(cur);
-                cur.left && _traverse_7(cur.left);
-                cur.right && _traverse_7(cur.right);
+                cur.left && _traverse(cur.left);
+                cur.right && _traverse(cur.right);
             };
-            _traverse_7(subTreeRoot);
+            _traverse(subTreeRoot);
         }
         else {
-            var stack = [subTreeRoot];
+            const stack = [subTreeRoot];
             while (stack.length > 0) {
-                var cur = stack.pop();
+                const 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
@@ -946,13 +822,13 @@ var AbstractBinaryTree = /** @class */ (function () {
      * specifies the property of the binary tree node that should be modified. If not provided, it defaults to 'id'.
      * @returns a boolean value.
      */
-    AbstractBinaryTree.prototype.subTreeAdd = function (subTreeRoot, delta, propertyName) {
+    subTreeAdd(subTreeRoot, delta, propertyName) {
         propertyName = propertyName !== null && propertyName !== void 0 ? propertyName : 'id';
         if (typeof subTreeRoot === 'number')
             subTreeRoot = this.get(subTreeRoot, 'id');
         if (!subTreeRoot)
             return false;
-        var _addByProperty = function (cur) {
+        const _addByProperty = (cur) => {
             switch (propertyName) {
                 case 'id':
                     cur.id += delta;
@@ -963,24 +839,24 @@ var AbstractBinaryTree = /** @class */ (function () {
             }
         };
         if (this._loopType === types_1.LoopType.RECURSIVE) {
-            var _traverse_8 = function (cur) {
+            const _traverse = (cur) => {
                 _addByProperty(cur);
-                cur.left && _traverse_8(cur.left);
-                cur.right && _traverse_8(cur.right);
+                cur.left && _traverse(cur.left);
+                cur.right && _traverse(cur.right);
             };
-            _traverse_8(subTreeRoot);
+            _traverse(subTreeRoot);
         }
         else {
-            var stack = [subTreeRoot];
+            const stack = [subTreeRoot];
             while (stack.length > 0) {
-                var cur = stack.pop();
+                const 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.
@@ -990,12 +866,12 @@ var AbstractBinaryTree = /** @class */ (function () {
      * the
      * @returns an instance of the `AbstractBinaryTreeNodeProperties` class with generic type `N`.
      */
-    AbstractBinaryTree.prototype.BFS = function (nodeOrPropertyName) {
+    BFS(nodeOrPropertyName) {
         nodeOrPropertyName = nodeOrPropertyName !== null && nodeOrPropertyName !== void 0 ? nodeOrPropertyName : 'id';
         this._resetResults();
-        var queue = [this.root];
+        const queue = [this.root];
         while (queue.length !== 0) {
-            var cur = queue.shift();
+            const cur = queue.shift();
             if (cur) {
                 this._accumulatedByPropertyName(cur, nodeOrPropertyName);
                 if ((cur === null || cur === void 0 ? void 0 : cur.left) !== null)
@@ -1005,7 +881,7 @@ var AbstractBinaryTree = /** @class */ (function () {
             }
         }
         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.
@@ -1017,22 +893,21 @@ var AbstractBinaryTree = /** @class */ (function () {
      * @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.
      */
-    AbstractBinaryTree.prototype.DFS = function (pattern, nodeOrPropertyName) {
-        var _this = this;
+    DFS(pattern, nodeOrPropertyName) {
         pattern = pattern !== null && pattern !== void 0 ? pattern : 'in';
         nodeOrPropertyName = nodeOrPropertyName !== null && nodeOrPropertyName !== void 0 ? nodeOrPropertyName : 'id';
         this._resetResults();
-        var _traverse = function (node) {
+        const _traverse = (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)
@@ -1043,13 +918,13 @@ var AbstractBinaryTree = /** @class */ (function () {
                         _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.
@@ -1061,16 +936,16 @@ var AbstractBinaryTree = /** @class */ (function () {
      * the
      * @returns an object of type AbstractBinaryTreeNodeProperties<N>.
      */
-    AbstractBinaryTree.prototype.DFSIterative = function (pattern, nodeOrPropertyName) {
+    DFSIterative(pattern, nodeOrPropertyName) {
         pattern = pattern || 'in';
         nodeOrPropertyName = nodeOrPropertyName || 'id';
         this._resetResults();
         if (!this.root)
             return this._getResultByPropertyName(nodeOrPropertyName);
         // 0: visit, 1: print
-        var stack = [{ opt: 0, node: this.root }];
+        const stack = [{ opt: 0, node: this.root }];
         while (stack.length > 0) {
-            var cur = stack.pop();
+            const cur = stack.pop();
             if (!cur || !cur.node)
                 continue;
             if (cur.opt === 1) {
@@ -1102,7 +977,7 @@ var AbstractBinaryTree = /** @class */ (function () {
             }
         }
         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.
@@ -1115,15 +990,15 @@ var AbstractBinaryTree = /** @class */ (function () {
      * accumulating results
      * @returns The function `levelIterative` returns an object of type `AbstractBinaryTreeNodeProperties<N>`.
      */
-    AbstractBinaryTree.prototype.levelIterative = function (node, nodeOrPropertyName) {
+    levelIterative(node, nodeOrPropertyName) {
         nodeOrPropertyName = nodeOrPropertyName || 'id';
         node = node || this.root;
         if (!node)
             return [];
         this._resetResults();
-        var queue = [node];
+        const queue = [node];
         while (queue.length > 0) {
-            var cur = queue.shift();
+            const cur = queue.shift();
             if (cur) {
                 this._accumulatedByPropertyName(cur, nodeOrPropertyName);
                 if (cur.left) {
@@ -1135,7 +1010,7 @@ var AbstractBinaryTree = /** @class */ (function () {
             }
         }
         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
@@ -1145,13 +1020,13 @@ var AbstractBinaryTree = /** @class */ (function () {
      * values:
      * @returns The function `listLevels` returns a 2D array of `AbstractBinaryTreeNodeProperty<N>` objects.
      */
-    AbstractBinaryTree.prototype.listLevels = function (node, nodeOrPropertyName) {
+    listLevels(node, nodeOrPropertyName) {
         nodeOrPropertyName = nodeOrPropertyName || 'id';
         node = node || this.root;
         if (!node)
             return [];
-        var levelsNodes = [];
-        var collectByProperty = function (node, level) {
+        const levelsNodes = [];
+        const collectByProperty = (node, level) => {
             switch (nodeOrPropertyName) {
                 case 'id':
                     levelsNodes[level].push(node.id);
@@ -1168,41 +1043,41 @@ var AbstractBinaryTree = /** @class */ (function () {
             }
         };
         if (this.loopType === types_1.LoopType.RECURSIVE) {
-            var _recursive_1 = function (node, level) {
+            const _recursive = (node, level) => {
                 if (!levelsNodes[level])
                     levelsNodes[level] = [];
                 collectByProperty(node, level);
                 if (node.left)
-                    _recursive_1(node.left, level + 1);
+                    _recursive(node.left, level + 1);
                 if (node.right)
-                    _recursive_1(node.right, level + 1);
+                    _recursive(node.right, level + 1);
             };
-            _recursive_1(node, 0);
+            _recursive(node, 0);
         }
         else {
-            var stack = [[node, 0]];
+            const stack = [[node, 0]];
             while (stack.length > 0) {
-                var head = stack.pop();
-                var _a = __read(head, 2), node_1 = _a[0], level = _a[1];
+                const head = stack.pop();
+                const [node, level] = head;
                 if (!levelsNodes[level])
                     levelsNodes[level] = [];
-                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]);
+                collectByProperty(node, level);
+                if (node.right)
+                    stack.push([node.right, level + 1]);
+                if (node.left)
+                    stack.push([node.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.
      */
-    AbstractBinaryTree.prototype.getPredecessor = function (node) {
+    getPredecessor(node) {
         if (node.left) {
-            var predecessor = node.left;
+            let predecessor = node.left;
             while (!(predecessor) || predecessor.right && predecessor.right !== node) {
                 if (predecessor) {
                     predecessor = predecessor.right;
@@ -1213,7 +1088,7 @@ var AbstractBinaryTree = /** @class */ (function () {
         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.
@@ -1224,17 +1099,16 @@ var AbstractBinaryTree = /** @class */ (function () {
      * tree.
      * @returns an array of AbstractBinaryTreeNodeProperties<N> objects.
      */
-    AbstractBinaryTree.prototype.morris = function (pattern, nodeOrPropertyName) {
-        var _this = this;
+    morris(pattern, nodeOrPropertyName) {
         if (this.root === null)
             return [];
         pattern = pattern || 'in';
         nodeOrPropertyName = nodeOrPropertyName || 'id';
         this._resetResults();
-        var cur = this.root;
-        var _reverseEdge = function (node) {
-            var pre = null;
-            var next = null;
+        let cur = this.root;
+        const _reverseEdge = (node) => {
+            let pre = null;
+            let next = null;
             while (node) {
                 next = node.right;
                 node.right = pre;
@@ -1243,11 +1117,11 @@ var AbstractBinaryTree = /** @class */ (function () {
             }
             return pre;
         };
-        var _printEdge = function (node) {
-            var tail = _reverseEdge(node);
-            var cur = tail;
+        const _printEdge = (node) => {
+            const tail = _reverseEdge(node);
+            let cur = tail;
             while (cur) {
-                _this._accumulatedByPropertyName(cur, nodeOrPropertyName);
+                this._accumulatedByPropertyName(cur, nodeOrPropertyName);
                 cur = cur.right;
             }
             _reverseEdge(tail);
@@ -1256,7 +1130,7 @@ var AbstractBinaryTree = /** @class */ (function () {
             case 'in':
                 while (cur) {
                     if (cur.left) {
-                        var predecessor = this.getPredecessor(cur);
+                        const predecessor = this.getPredecessor(cur);
                         if (!predecessor.right) {
                             predecessor.right = cur;
                             cur = cur.left;
@@ -1273,7 +1147,7 @@ var AbstractBinaryTree = /** @class */ (function () {
             case 'pre':
                 while (cur) {
                     if (cur.left) {
-                        var predecessor = this.getPredecessor(cur);
+                        const predecessor = this.getPredecessor(cur);
                         if (!predecessor.right) {
                             predecessor.right = cur;
                             this._accumulatedByPropertyName(cur, nodeOrPropertyName);
@@ -1293,7 +1167,7 @@ var AbstractBinaryTree = /** @class */ (function () {
             case 'post':
                 while (cur) {
                     if (cur.left) {
-                        var predecessor = this.getPredecessor(cur);
+                        const predecessor = this.getPredecessor(cur);
                         if (predecessor.right === null) {
                             predecessor.right = cur;
                             cur = cur.left;
@@ -1310,101 +1184,101 @@ var AbstractBinaryTree = /** @class */ (function () {
                 break;
         }
         return this._getResultByPropertyName(nodeOrPropertyName);
-    };
+    }
     /**
      * The function sets the loop type for a protected variable.
      * @param {LoopType} value - The value parameter is of type LoopType.
      */
-    AbstractBinaryTree.prototype._setLoopType = function (value) {
+    _setLoopType(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.
      */
-    AbstractBinaryTree.prototype._setVisitedId = function (value) {
+    _setVisitedId(value) {
         this._visitedId = value;
-    };
+    }
     /**
      * The function sets the value of the "_visitedVal" property to the given array.
      * @param value - An array of type N.
      */
-    AbstractBinaryTree.prototype._setVisitedVal = function (value) {
+    _setVisitedVal(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.
      */
-    AbstractBinaryTree.prototype._setVisitedNode = function (value) {
+    _setVisitedNode(value) {
         this._visitedNode = value;
-    };
+    }
     /**
      * The function sets the value of the visitedCount property.
      * @param {number[]} value - The value parameter is an array of numbers.
      */
-    AbstractBinaryTree.prototype.setVisitedCount = function (value) {
+    setVisitedCount(value) {
         this._visitedCount = 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.
      */
-    AbstractBinaryTree.prototype._setVisitedLeftSum = function (value) {
+    _setVisitedLeftSum(value) {
         this._visitedLeftSum = value;
-    };
+    }
     /**
      * The function sets the value of the _autoIncrementId property.
      * @param {boolean} value - The value parameter is a boolean that determines whether the id should be automatically
      * incremented or not. If value is true, the id will be automatically incremented. If value is false, the id will not
      * be automatically incremented.
      */
-    AbstractBinaryTree.prototype._setAutoIncrementId = function (value) {
+    _setAutoIncrementId(value) {
         this._autoIncrementId = value;
-    };
+    }
     /**
      * The function sets the maximum ID value.
      * @param {number} value - The value parameter is a number that represents the new maximum ID value.
      */
-    AbstractBinaryTree.prototype._setMaxId = function (value) {
+    _setMaxId(value) {
         this._maxId = value;
-    };
+    }
     /**
      * The function sets the value of a protected property called "_isMergeDuplicatedVal".
      * @param {boolean} value - The value parameter is a boolean value that determines whether the isMergeDuplicatedVal
      * property should be set to true or false.
      */
-    AbstractBinaryTree.prototype._setIsDuplicatedVal = function (value) {
+    _setIsDuplicatedVal(value) {
         this._isMergeDuplicatedVal = 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`.
      */
-    AbstractBinaryTree.prototype._setRoot = function (v) {
+    _setRoot(v) {
         if (v) {
             v.parent = undefined;
         }
         this._root = v;
-    };
+    }
     /**
      * The function sets the size of a protected variable.
      * @param {number} v - number
      */
-    AbstractBinaryTree.prototype._setSize = function (v) {
+    _setSize(v) {
         this._size = v;
-    };
+    }
     /**
      * The function `_resetResults` resets the values of several arrays used for tracking visited nodes and their
      * properties.
      */
-    AbstractBinaryTree.prototype._resetResults = function () {
+    _resetResults() {
         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.
@@ -1420,7 +1294,7 @@ var AbstractBinaryTree = /** @class */ (function () {
      * `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.
      */
-    AbstractBinaryTree.prototype._pushByPropertyNameStopOrNot = function (cur, result, nodeProperty, propertyName, onlyOne) {
+    _pushByPropertyNameStopOrNot(cur, result, nodeProperty, propertyName, onlyOne) {
         switch (propertyName) {
             case 'id':
                 if (cur.id === nodeProperty) {
@@ -1441,7 +1315,7 @@ var AbstractBinaryTree = /** @class */ (function () {
                 }
                 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.
@@ -1449,7 +1323,7 @@ var AbstractBinaryTree = /** @class */ (function () {
      * 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
      */
-    AbstractBinaryTree.prototype._accumulatedByPropertyName = function (node, nodeOrPropertyName) {
+    _accumulatedByPropertyName(node, nodeOrPropertyName) {
         nodeOrPropertyName = nodeOrPropertyName !== null && nodeOrPropertyName !== void 0 ? nodeOrPropertyName : 'id';
         switch (nodeOrPropertyName) {
             case 'id':
@@ -1465,7 +1339,7 @@ var AbstractBinaryTree = /** @class */ (function () {
                 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
@@ -1477,7 +1351,7 @@ var AbstractBinaryTree = /** @class */ (function () {
      * can accept either a `NodeOrPropertyName` type or be undefined.
      * @returns The method `_getResultByPropertyName` returns an instance of `AbstractBinaryTreeNodeProperties<N>`.
      */
-    AbstractBinaryTree.prototype._getResultByPropertyName = function (nodeOrPropertyName) {
+    _getResultByPropertyName(nodeOrPropertyName) {
         nodeOrPropertyName = nodeOrPropertyName !== null && nodeOrPropertyName !== void 0 ? nodeOrPropertyName : 'id';
         switch (nodeOrPropertyName) {
             case 'id':
@@ -1489,7 +1363,6 @@ var AbstractBinaryTree = /** @class */ (function () {
             default:
                 return this._visitedId;
         }
-    };
-    return AbstractBinaryTree;
-}());
+    }
+}
 exports.AbstractBinaryTree = AbstractBinaryTree;