data-structure-typed 0.8.18 → 1.12.9

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

@@ -1,7 +1,38 @@
 "use strict";
+/**
+ * @copyright 2030 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT
+ */
+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.BinaryTree = exports.BinaryTreeNode = exports.LoopType = exports.FamilyPosition = void 0;
-const trampoline_1 = require("../trampoline");
+var trampoline_1 = require("../../utils/trampoline");
 var FamilyPosition;
 (function (FamilyPosition) {
     FamilyPosition[FamilyPosition["root"] = 0] = "root";
@@ -13,65 +44,8 @@ var LoopType;
     LoopType[LoopType["iterative"] = 1] = "iterative";
     LoopType[LoopType["recursive"] = 2] = "recursive";
 })(LoopType = exports.LoopType || (exports.LoopType = {}));
-class BinaryTreeNode {
-    get id() {
-        return this._id;
-    }
-    set id(v) {
-        this._id = v;
-    }
-    get val() {
-        return this._val;
-    }
-    set val(v) {
-        this._val = v;
-    }
-    get left() {
-        return this._left;
-    }
-    set left(v) {
-        if (v) {
-            v.parent = this;
-            v.familyPosition = FamilyPosition.left;
-        }
-        this._left = v;
-    }
-    get right() {
-        return this._right;
-    }
-    set right(v) {
-        if (v) {
-            v.parent = this;
-            v.familyPosition = FamilyPosition.right;
-        }
-        this._right = v;
-    }
-    get parent() {
-        return this._parent;
-    }
-    set parent(v) {
-        this._parent = v;
-    }
-    get familyPosition() {
-        return this._familyPosition;
-    }
-    set familyPosition(v) {
-        this._familyPosition = v;
-    }
-    get count() {
-        return this._count;
-    }
-    set count(v) {
-        this._count = v;
-    }
-    get height() {
-        return this._height;
-    }
-    set height(v) {
-        this._height = v;
-    }
-    constructor(id, val, count) {
-        this._parent = undefined;
+var BinaryTreeNode = /** @class */ (function () {
+    function BinaryTreeNode(id, val, count) {
         this._familyPosition = FamilyPosition.root;
         this._count = 1;
         this._height = 0;
@@ -79,9 +53,97 @@ class BinaryTreeNode {
         this._val = val;
         this._count = count !== null && count !== void 0 ? count : 1;
     }
-    swapLocation(swapNode) {
-        const { val, count, height } = swapNode;
-        const tempNode = new BinaryTreeNode(swapNode.id, val);
+    Object.defineProperty(BinaryTreeNode.prototype, "id", {
+        get: function () {
+            return this._id;
+        },
+        set: function (v) {
+            this._id = v;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(BinaryTreeNode.prototype, "val", {
+        get: function () {
+            return this._val;
+        },
+        set: function (v) {
+            this._val = v;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(BinaryTreeNode.prototype, "left", {
+        get: function () {
+            return this._left;
+        },
+        set: function (v) {
+            if (v) {
+                v.parent = this;
+                v.familyPosition = FamilyPosition.left;
+            }
+            this._left = v;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(BinaryTreeNode.prototype, "right", {
+        get: function () {
+            return this._right;
+        },
+        set: function (v) {
+            if (v) {
+                v.parent = this;
+                v.familyPosition = FamilyPosition.right;
+            }
+            this._right = v;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(BinaryTreeNode.prototype, "parent", {
+        get: function () {
+            return this._parent;
+        },
+        set: function (v) {
+            this._parent = v;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(BinaryTreeNode.prototype, "familyPosition", {
+        get: function () {
+            return this._familyPosition;
+        },
+        set: function (v) {
+            this._familyPosition = v;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(BinaryTreeNode.prototype, "count", {
+        get: function () {
+            return this._count;
+        },
+        set: function (v) {
+            this._count = v;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(BinaryTreeNode.prototype, "height", {
+        get: function () {
+            return this._height;
+        },
+        set: function (v) {
+            this._height = v;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    BinaryTreeNode.prototype.swapLocation = function (swapNode) {
+        var val = swapNode.val, count = swapNode.count, height = swapNode.height;
+        var tempNode = new BinaryTreeNode(swapNode.id, val);
         tempNode.val = val;
         tempNode.count = count;
         tempNode.height = height;
@@ -94,75 +156,113 @@ class BinaryTreeNode {
         this.count = tempNode.count;
         this.height = tempNode.height;
         return swapNode;
-    }
-    clone() {
+    };
+    BinaryTreeNode.prototype.clone = function () {
         return new BinaryTreeNode(this.id, this.val, this.count);
-    }
-}
+    };
+    return BinaryTreeNode;
+}());
 exports.BinaryTreeNode = BinaryTreeNode;
-class BinaryTree {
-    get root() {
-        return this._root;
-    }
-    set root(v) {
-        if (v) {
-            v.parent = null;
-            v.familyPosition = FamilyPosition.root;
-        }
-        this._root = v;
-    }
-    get size() {
-        return this._size;
-    }
-    set size(v) {
-        this._size = v;
-    }
-    get count() {
-        return this._count;
-    }
-    set count(v) {
-        this._count = v;
-    }
-    _resetResults() {
+var BinaryTree = /** @class */ (function () {
+    /**
+     * The constructor function accepts an optional options object and sets the values of loopType, autoIncrementId, and
+     * isDuplicatedVal based on the provided options.
+     * @param [options] - An optional object that can contain the following properties:
+     */
+    function BinaryTree(options) {
+        this._loopType = LoopType.iterative;
         this._visitedId = [];
         this._visitedVal = [];
         this._visitedNode = [];
         this._visitedCount = [];
         this._visitedLeftSum = [];
-    }
-    constructor(options) {
-        this._root = null;
-        this._size = 0;
-        this._count = 0;
         this._autoIncrementId = false;
         this._maxId = -1;
         this._isDuplicatedVal = false;
-        this._loopType = LoopType.iterative;
-        this._visitedId = [];
-        this._visitedVal = [];
-        this._visitedNode = [];
-        this._visitedCount = [];
-        this._visitedLeftSum = [];
+        this._root = null;
+        this._size = 0;
+        this._count = 0;
         if (options !== undefined) {
-            const { loopType = LoopType.iterative, autoIncrementId = false, isDuplicatedVal = false } = options;
+            var _a = options.loopType, loopType = _a === void 0 ? LoopType.iterative : _a, _b = options.autoIncrementId, autoIncrementId = _b === void 0 ? false : _b, _c = options.isDuplicatedVal, isDuplicatedVal = _c === void 0 ? false : _c;
             this._isDuplicatedVal = isDuplicatedVal;
             this._autoIncrementId = autoIncrementId;
             this._loopType = loopType;
         }
     }
-    createNode(id, val, count) {
+    Object.defineProperty(BinaryTree.prototype, "root", {
+        get: function () {
+            return this._root;
+        },
+        set: function (v) {
+            if (v) {
+                v.parent = null;
+                v.familyPosition = FamilyPosition.root;
+            }
+            this._root = v;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(BinaryTree.prototype, "size", {
+        get: function () {
+            return this._size;
+        },
+        set: function (v) {
+            this._size = v;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(BinaryTree.prototype, "count", {
+        get: function () {
+            return this._count;
+        },
+        set: function (v) {
+            this._count = v;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    /**
+     * The function creates a new binary tree node with the given id, value, and count, or returns null if the value is
+     * null.
+     * @param {BinaryTreeNodeId} id - The `id` parameter is the identifier for the binary tree node. It is of type
+     * `BinaryTreeNodeId`, which could be a string or a number, depending on how you want to identify your nodes.
+     * @param {T | null} val - The `val` parameter represents the value to be stored in the binary tree node. It can be of
+     * any type `T` or `null`.
+     * @param {number} [count] - The count parameter is an optional parameter that represents the number of occurrences of
+     * the value in the binary tree node. It is of type number.
+     * @returns The function `createNode` returns a `BinaryTreeNode<T>` object if the `val` parameter is not null.
+     * Otherwise, it returns null.
+     */
+    BinaryTree.prototype.createNode = function (id, val, count) {
         return val !== null ? new BinaryTreeNode(id, val, count) : null;
-    }
-    clear() {
+    };
+    /**
+     * The clear function resets the state of an object by setting its properties to their initial values.
+     */
+    BinaryTree.prototype.clear = function () {
         this.root = null;
         this.size = 0;
         this.count = 0;
         this._maxId = -1;
-    }
-    isEmpty() {
+    };
+    /**
+     * 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.
+     */
+    BinaryTree.prototype.isEmpty = function () {
         return this.size === 0;
-    }
-    insertTo({ newNode, parent }) {
+    };
+    /**
+     * The function inserts a new node into a binary tree as the left or right child of a given parent node.
+     * @param {BinaryTreeNode<T> | null} newNode - The `newNode` parameter is an instance of the `BinaryTreeNode` class or
+     * `null`. It represents the node that needs to be inserted into the binary tree.
+     * @param parent - The `parent` parameter is a BinaryTreeNode object representing the parent node to which the new node
+     * will be inserted as a child.
+     * @returns The method returns the newly inserted node, either as the left child or the right child of the parent node.
+     */
+    BinaryTree.prototype.putTo = function (newNode, parent) {
         var _a, _b;
         if (parent) {
             if (parent.left === undefined) {
@@ -196,17 +296,29 @@ class BinaryTree {
         else {
             return;
         }
-    }
-    put(id, val, count) {
+    };
+    /**
+     * The `put` function inserts a new node with a given ID and value into a binary tree, updating the count if the node
+     * already exists.
+     * @param {BinaryTreeNodeId} id - The id parameter is the identifier of the binary tree node. It is used to uniquely
+     * identify each node in the binary tree.
+     * @param {T} val - The value to be inserted into the binary tree.
+     * @param {number} [count] - The `count` parameter is an optional parameter that specifies the number of times the
+     * value should be inserted into the binary tree. If not provided, it defaults to 1.
+     * @returns The function `put` returns a `BinaryTreeNode<T>` object if a new node is inserted, or `null` if no new node
+     * is inserted, or `undefined` if the insertion fails.
+     */
+    BinaryTree.prototype.put = function (id, val, count) {
+        var _this = this;
         count = count !== null && count !== void 0 ? count : 1;
-        const _bfs = (root, newNode) => {
-            const queue = [root];
+        var _bfs = function (root, newNode) {
+            var queue = [root];
             while (queue.length > 0) {
-                const cur = queue.shift();
+                var cur = queue.shift();
                 if (cur) {
-                    const inserted = this.insertTo({ newNode, parent: cur });
-                    if (inserted !== undefined)
-                        return inserted;
+                    var inserted_1 = _this.putTo(newNode, cur);
+                    if (inserted_1 !== undefined)
+                        return inserted_1;
                     if (cur.left)
                         queue.push(cur.left);
                     if (cur.right)
@@ -217,9 +329,9 @@ class BinaryTree {
             }
             return;
         };
-        let inserted;
-        const needInsert = val !== null ? new BinaryTreeNode(id, val, count) : null;
-        const existNode = val !== null ? this.get(id, 'id') : null;
+        var inserted;
+        var needInsert = val !== null ? new BinaryTreeNode(id, val, count) : null;
+        var existNode = val !== null ? this.get(id, 'id') : null;
         if (this.root) {
             if (existNode) {
                 existNode.count += count;
@@ -242,57 +354,104 @@ class BinaryTree {
             inserted = this.root;
         }
         return inserted;
-    }
-    insertMany(data) {
-        var _a;
-        const inserted = [];
-        const map = new Map();
+    };
+    /**
+     * The `insertMany` function inserts multiple items into a binary tree and returns an array of the inserted nodes or
+     * null/undefined values.
+     * @param {T[] | BinaryTreeNode<T>[]} data - The `data` parameter can be either an array of elements of type `T` or an
+     * array of `BinaryTreeNode<T>` objects.
+     * @returns The function `insertMany` returns an array of `BinaryTreeNode<T>`, `null`, or `undefined` values.
+     */
+    BinaryTree.prototype.insertMany = function (data) {
+        var e_1, _a, e_2, _b;
+        var _c;
+        var inserted = [];
+        var map = new Map();
         if (!this._isDuplicatedVal) {
-            for (const i of data)
-                map.set(i, ((_a = map.get(i)) !== null && _a !== void 0 ? _a : 0) + 1);
-        }
-        for (const item of data) {
-            const count = this._isDuplicatedVal ? 1 : map.get(item);
-            if (item instanceof BinaryTreeNode) {
-                inserted.push(this.put(item.id, item.val, item.count));
-            }
-            else if (typeof item === 'number' && !this._autoIncrementId) {
-                if (!this._isDuplicatedVal) {
-                    if (map.get(item) !== undefined) {
-                        inserted.push(this.put(item, item, count));
-                        map.delete(item);
-                    }
+            try {
+                for (var data_1 = __values(data), data_1_1 = data_1.next(); !data_1_1.done; data_1_1 = data_1.next()) {
+                    var i = data_1_1.value;
+                    map.set(i, ((_c = map.get(i)) !== null && _c !== void 0 ? _c : 0) + 1);
                 }
-                else {
-                    inserted.push(this.put(item, item, 1));
+            }
+            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; }
             }
-            else {
-                if (item !== null) {
+        }
+        try {
+            for (var data_2 = __values(data), data_2_1 = data_2.next(); !data_2_1.done; data_2_1 = data_2.next()) {
+                var item = data_2_1.value;
+                var count = this._isDuplicatedVal ? 1 : map.get(item);
+                if (item instanceof BinaryTreeNode) {
+                    inserted.push(this.put(item.id, item.val, item.count));
+                }
+                else if (typeof item === 'number' && !this._autoIncrementId) {
                     if (!this._isDuplicatedVal) {
                         if (map.get(item) !== undefined) {
-                            inserted.push(this.put(++this._maxId, item, count));
+                            inserted.push(this.put(item, item, count));
                             map.delete(item);
                         }
                     }
                     else {
-                        inserted.push(this.put(++this._maxId, item, 1));
+                        inserted.push(this.put(item, item, 1));
                     }
                 }
                 else {
-                    inserted.push(this.put(Number.MAX_SAFE_INTEGER, item, 0));
+                    if (item !== null) {
+                        if (!this._isDuplicatedVal) {
+                            if (map.get(item) !== undefined) {
+                                inserted.push(this.put(++this._maxId, item, count));
+                                map.delete(item);
+                            }
+                        }
+                        else {
+                            inserted.push(this.put(++this._maxId, item, 1));
+                        }
+                    }
+                    else {
+                        inserted.push(this.put(Number.MAX_SAFE_INTEGER, item, 0));
+                    }
                 }
             }
         }
+        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);
+            }
+            finally { if (e_2) throw e_2.error; }
+        }
         return inserted;
-    }
-    fill(data) {
+    };
+    /**
+     * The `fill` function clears the current data and inserts new data, returning a boolean indicating if the insertion
+     * was successful.
+     * @param {T[] | BinaryTreeNode<T>[]} data - The `data` parameter can be either an array of elements of type `T` or an
+     * array of `BinaryTreeNode<T>` objects.
+     * @returns The method is returning a boolean value.
+     */
+    BinaryTree.prototype.fill = function (data) {
         this.clear();
         return data.length === this.insertMany(data).length;
-    }
-    remove(id, ignoreCount) {
-        const nodes = this.getNodes(id, 'id', true);
-        let node = nodes[0];
+    };
+    /**
+     * The function removes a node from a binary tree and returns information about the deleted node.
+     * @param {BinaryTreeNodeId} id - The `id` parameter is the identifier of the binary tree node that you want to remove.
+     * It is of type `BinaryTreeNodeId`.
+     * @param {boolean} [ignoreCount] - The `ignoreCount` parameter is an optional boolean parameter that determines
+     * whether to ignore the count of the node being removed. If `ignoreCount` is set to `true`, the count of the node will
+     * not be decremented and the overall count of the binary tree will not be updated. If `
+     * @returns An array of objects is being returned. Each object in the array has two properties: "deleted" and
+     * "needBalanced". The "deleted" property contains the deleted node or undefined if no node was deleted. The
+     * "needBalanced" property is always null.
+     */
+    BinaryTree.prototype.remove = function (id, ignoreCount) {
+        var nodes = this.getNodes(id, 'id', true);
+        var node = nodes[0];
         if (!node)
             node = undefined;
         else if (node.count > 1 && !ignoreCount) {
@@ -300,7 +459,7 @@ class BinaryTree {
             this.count--;
         }
         else if (node instanceof BinaryTreeNode) {
-            const [subSize, subCount] = this.getSubTreeSizeAndCount(node);
+            var _a = __read(this.getSubTreeSizeAndCount(node), 2), subSize = _a[0], subCount = _a[1];
             switch (node.familyPosition) {
                 case 0:
                     this.size -= subSize;
@@ -324,33 +483,48 @@ class BinaryTree {
             }
         }
         return [{ deleted: node, needBalanced: null }];
-    }
-    getDepth(node) {
-        let depth = 0;
+    };
+    /**
+     * The function calculates the depth of a binary tree node by traversing its parent nodes.
+     * @param node - BinaryTreeNode<T> - This is the node for which we want to calculate the depth. It is a generic type,
+     * meaning it can represent any type of data that we want to store in the node.
+     * @returns The depth of the given binary tree node.
+     */
+    BinaryTree.prototype.getDepth = function (node) {
+        var depth = 0;
         while (node.parent) {
             depth++;
             node = node.parent;
         }
         return depth;
-    }
-    getHeight(beginRoot) {
+    };
+    /**
+     * The `getHeight` function calculates the maximum height of a binary tree using either a recursive or iterative
+     * approach.
+     * @param {BinaryTreeNode<T> | null} [beginRoot] - The `beginRoot` parameter is an optional parameter of type
+     * `BinaryTreeNode<T> | null`. It represents the starting node from which to calculate the height of the binary tree.
+     * If no value is provided for `beginRoot`, the function will use the `root` property of the class instance as
+     * @returns the height of the binary tree.
+     */
+    BinaryTree.prototype.getHeight = function (beginRoot) {
         var _a, _b, _c;
         beginRoot = beginRoot !== null && beginRoot !== void 0 ? beginRoot : this.root;
         if (!beginRoot)
             return -1;
         if (this._loopType === 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 {
-            const stack = [];
-            let node = beginRoot, last = null, depths = new Map();
+            var stack = [];
+            var node = beginRoot, last = null;
+            var depths = new Map();
             while (stack.length > 0 || node) {
                 if (node) {
                     stack.push(node);
@@ -361,8 +535,8 @@ class BinaryTree {
                     if (!node.right || last === node.right) {
                         node = stack.pop();
                         if (node) {
-                            let leftHeight = node.left ? (_a = depths.get(node.left)) !== null && _a !== void 0 ? _a : -1 : -1;
-                            let rightHeight = node.right ? (_b = depths.get(node.right)) !== null && _b !== void 0 ? _b : -1 : -1;
+                            var leftHeight = node.left ? (_a = depths.get(node.left)) !== null && _a !== void 0 ? _a : -1 : -1;
+                            var rightHeight = node.right ? (_b = depths.get(node.right)) !== null && _b !== void 0 ? _b : -1 : -1;
                             depths.set(node, 1 + Math.max(leftHeight, rightHeight));
                             last = node;
                             node = null;
@@ -374,27 +548,36 @@ class BinaryTree {
             }
             return (_c = depths.get(beginRoot)) !== null && _c !== void 0 ? _c : -1;
         }
-    }
-    getMinHeight(beginRoot) {
+    };
+    /**
+     * The `getMinHeight` function calculates the minimum height of a binary tree using either a recursive or iterative
+     * approach.
+     * @param {BinaryTreeNode<T> | null} [beginRoot] - The `beginRoot` parameter is an optional parameter of type
+     * `BinaryTreeNode<T> | null`. It represents the starting node from which to calculate the minimum height of the binary
+     * tree. If no value is provided for `beginRoot`, the function will use the root node of the binary tree.
+     * @returns The function `getMinHeight` returns the minimum height of the binary tree.
+     */
+    BinaryTree.prototype.getMinHeight = function (beginRoot) {
         var _a, _b, _c;
         beginRoot = beginRoot || this.root;
         if (!beginRoot)
             return -1;
         if (this._loopType === 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, depths = new Map();
+            var stack = [];
+            var node = beginRoot, last = null;
+            var depths = new Map();
             while (stack.length > 0 || node) {
                 if (node) {
                     stack.push(node);
@@ -405,8 +588,8 @@ class BinaryTree {
                     if (!node.right || last === node.right) {
                         node = stack.pop();
                         if (node) {
-                            let leftMinHeight = node.left ? (_a = depths.get(node.left)) !== null && _a !== void 0 ? _a : -1 : -1;
-                            let 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;
@@ -418,30 +601,49 @@ class BinaryTree {
             }
             return (_c = depths.get(beginRoot)) !== null && _c !== void 0 ? _c : -1;
         }
-    }
-    isBalanced(beginRoot) {
+    };
+    /**
+     * The function checks if a binary tree is balanced by comparing the minimum height and the maximum height of the tree.
+     * @param {BinaryTreeNode<T> | null} [beginRoot] - The `beginRoot` parameter is the root node of a binary tree. It is
+     * of type `BinaryTreeNode<T> | null`, which means it can either be a `BinaryTreeNode` object or `null`.
+     * @returns The method is returning a boolean value.
+     */
+    BinaryTree.prototype.isBalanced = function (beginRoot) {
         return (this.getMinHeight(beginRoot) + 1 >= this.getHeight(beginRoot));
-    }
-    getNodes(nodeProperty, propertyName, onlyOne) {
+    };
+    /**
+     * The function `getNodes` returns an array of binary tree nodes that match a given property value, with options for
+     * searching recursively or iteratively.
+     * @param {BinaryTreeNodeId | T} nodeProperty - The `nodeProperty` parameter can be either a `BinaryTreeNodeId` or a
+     * generic type `T`. 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 `nodeProperty` or `propertyName` criteria. If `onlyOne` is set to `true`, the
+     * function will stop traversing the tree and return the first matching node. If `
+     * @returns The function `getNodes` returns an array of `BinaryTreeNode<T> | null | undefined` objects.
+     */
+    BinaryTree.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 === 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;
@@ -451,181 +653,175 @@ class BinaryTree {
             }
         }
         return result;
-    }
-    has(nodeProperty, propertyName) {
+    };
+    /**
+     * The function checks if a binary tree node has a specific property or if any node in the tree has a specific
+     * property.
+     * @param {BinaryTreeNodeId | T} nodeProperty - The `nodeProperty` parameter can be either a `BinaryTreeNodeId` or a
+     * generic type `T`. It represents the property of a 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 check for in the nodes.
+     * @returns a boolean value.
+     */
+    BinaryTree.prototype.has = function (nodeProperty, propertyName) {
         return this.getNodes(nodeProperty, propertyName).length > 0;
-    }
-    get(nodeProperty, propertyName) {
+    };
+    /**
+     * The function returns the first binary tree node that matches the given property name and value, or null if no match
+     * is found.
+     * @param {BinaryTreeNodeId | T} nodeProperty - The `nodeProperty` parameter can be either a `BinaryTreeNodeId` or a
+     * generic type `T`. 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 of the binary tree node to search for. If not provided, it defaults to `'id'`.
+     * @returns a BinaryTreeNode object or null.
+     */
+    BinaryTree.prototype.get = function (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;
-    }
-    getPathToRoot(node) {
-        const result = [];
+    };
+    /**
+     * The function getPathToRoot returns an array of BinaryTreeNode objects representing the path from a given node to the
+     * root of a binary tree.
+     * @param node - The `node` parameter is a BinaryTreeNode object.
+     * @returns The function `getPathToRoot` returns an array of `BinaryTreeNode<T>` objects, representing the path from
+     * the given `node` to the root of the binary tree.
+     */
+    BinaryTree.prototype.getPathToRoot = function (node) {
+        var result = [];
         while (node.parent) {
             result.unshift(node);
             node = node.parent;
         }
         result.unshift(node);
         return result;
-    }
-    _pushByPropertyNameStopOrNot(cur, result, nodeProperty, propertyName, onlyOne) {
-        switch (propertyName) {
-            case 'id':
-                if (cur.id === nodeProperty) {
-                    result.push(cur);
-                    return !!onlyOne;
-                }
-                break;
-            case 'count':
-                if (cur.count === nodeProperty) {
-                    result.push(cur);
-                    return !!onlyOne;
-                }
-                break;
-            case 'val':
-                if (cur.val === nodeProperty) {
-                    result.push(cur);
-                    return !!onlyOne;
-                }
-                break;
-            default:
-                if (cur.id === nodeProperty) {
-                    result.push(cur);
-                    return !!onlyOne;
-                }
-                break;
-        }
-    }
-    _accumulatedByPropertyName(node, nodeOrPropertyName) {
-        nodeOrPropertyName = nodeOrPropertyName !== null && nodeOrPropertyName !== void 0 ? nodeOrPropertyName : 'id';
-        switch (nodeOrPropertyName) {
-            case 'id':
-                this._visitedId.push(node.id);
-                break;
-            case 'val':
-                this._visitedVal.push(node.val);
-                break;
-            case 'node':
-                this._visitedNode.push(node);
-                break;
-            case 'count':
-                this._visitedCount.push(node.count);
-                break;
-            default:
-                this._visitedId.push(node.id);
-                break;
-        }
-    }
-    _getResultByPropertyName(nodeOrPropertyName) {
-        nodeOrPropertyName = nodeOrPropertyName !== null && nodeOrPropertyName !== void 0 ? nodeOrPropertyName : 'id';
-        switch (nodeOrPropertyName) {
-            case 'id':
-                return this._visitedId;
-            case 'val':
-                return this._visitedVal;
-            case 'node':
-                return this._visitedNode;
-            case 'count':
-                return this._visitedCount;
-            default:
-                return this._visitedId;
-        }
-    }
-    getLeftMost(node) {
+    };
+    /**
+     * The `getLeftMost` function returns the leftmost node in a binary tree, either recursively or iteratively using tail
+     * recursion optimization.
+     * @param {BinaryTreeNode<T> | null} [node] - The `node` parameter is an optional parameter of type `BinaryTreeNode<T>
+     * | null`. It represents the starting node from which to find the leftmost node in a binary tree. If no node is
+     * provided, the function will use the root node of the binary tree.
+     * @returns The `getLeftMost` function returns the leftmost node in a binary tree.
+     */
+    BinaryTree.prototype.getLeftMost = function (node) {
         node = node !== null && node !== void 0 ? node : this.root;
         if (!node)
             return node;
         if (this._loopType === 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(node);
+            return _traverse_2(node);
         }
         else {
             // Indirect implementation of iteration using tail recursion optimization
-            const _traverse = (0, trampoline_1.trampoline)((cur) => {
+            var _traverse_3 = (0, trampoline_1.trampoline)(function (cur) {
                 if (!cur.left)
                     return cur;
-                return _traverse.cont(cur.left);
+                return _traverse_3.cont(cur.left);
             });
-            return _traverse(node);
+            return _traverse_3(node);
         }
-    }
-    getRightMost(node) {
+    };
+    /**
+     * The `getRightMost` function returns the rightmost node in a binary tree, either recursively or iteratively using
+     * tail recursion optimization.
+     * @param {BinaryTreeNode<T> | null} [node] - The `node` parameter is an optional parameter of type `BinaryTreeNode<T>
+     * | null`. It represents the starting node from which to find the rightmost node in a binary tree. If no node is
+     * provided, the function will use the root node of the binary tree.
+     * @returns The `getRightMost` function returns the rightmost node in a binary tree.
+     */
+    BinaryTree.prototype.getRightMost = function (node) {
         node = node !== null && node !== void 0 ? node : this.root;
         if (!node)
             return node;
         if (this._loopType === 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, trampoline_1.trampoline)((cur) => {
+            var _traverse_5 = (0, trampoline_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);
         }
-    }
+    };
     // --- start additional methods ---
-    isBST(node) {
+    /**
+     * The `isBST` function checks if a binary tree is a binary search tree.
+     * @param {BinaryTreeNode<T> | null} [node] - The `node` parameter is an optional parameter of type `BinaryTreeNode<T>
+     * | null`. It represents the root node of the binary search tree (BST) that we want to check for validity. If no node
+     * is provided, the function will default to using the root node of the BST instance that
+     * @returns The `isBST` function returns a boolean value. It returns `true` if the binary tree is a valid binary search
+     * tree, and `false` otherwise.
+     */
+    BinaryTree.prototype.isBST = function (node) {
         node = node !== null && node !== void 0 ? node : this.root;
         if (!node)
             return true;
         if (this._loopType === 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 (prev >= curr.id)
+                if (!(curr) || prev >= curr.id)
                     return false;
                 prev = curr.id;
                 curr = curr.right;
             }
             return true;
         }
-    }
-    getSubTreeSizeAndCount(subTreeRoot) {
-        const res = [0, 0];
+    };
+    /**
+     * The function calculates the size and count of a subtree in a binary tree using either recursive or iterative
+     * traversal.
+     * @param {BinaryTreeNode<T> | null | undefined} subTreeRoot - The `subTreeRoot` parameter is the root node of a binary
+     * tree.
+     * @returns The function `getSubTreeSizeAndCount` returns an array `[number, number]`. The first element of the array
+     * represents the size of the subtree, and the second element represents the count of the nodes in the subtree.
+     */
+    BinaryTree.prototype.getSubTreeSizeAndCount = function (subTreeRoot) {
+        var res = [0, 0];
         if (!subTreeRoot)
             return res;
         if (this._loopType === LoopType.recursive) {
-            const _traverse = (cur) => {
+            var _traverse_6 = function (cur) {
                 res[0]++;
                 res[1] += cur.count;
-                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 res;
         }
         else {
-            const stack = [subTreeRoot];
+            var stack = [subTreeRoot];
             while (stack.length > 0) {
-                const cur = stack.pop();
+                var cur = stack.pop();
                 res[0]++;
                 res[1] += cur.count;
                 cur.right && stack.push(cur.right);
@@ -633,14 +829,24 @@ class BinaryTree {
             }
             return res;
         }
-    }
-    subTreeSum(subTreeRoot, propertyName) {
+    };
+    /**
+     * The function `subTreeSum` calculates the sum of a specified property in a binary tree, either recursively or
+     * iteratively.
+     * @param subTreeRoot - The subTreeRoot parameter is the root node of the subtree for which you want to calculate the
+     * sum.
+     * @param {BinaryTreeNodePropertyName} [propertyName] - The `propertyName` parameter is an optional parameter that
+     * specifies the property of the `BinaryTreeNode` object to use for calculating the sum. If `propertyName` is not
+     * provided, it defaults to `'val'`.
+     * @returns a number, which is the sum of the values of the nodes in the subtree rooted at `subTreeRoot`.
+     */
+    BinaryTree.prototype.subTreeSum = function (subTreeRoot, propertyName) {
         propertyName = propertyName !== null && propertyName !== void 0 ? propertyName : 'val';
         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;
@@ -658,36 +864,46 @@ class BinaryTree {
             return needSum;
         };
         if (this._loopType === 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;
-    }
-    subTreeAdd(subTreeRoot, delta, propertyName) {
+    };
+    /**
+     * The function `subTreeAdd` adds a specified delta value to a property of each node in a binary tree.
+     * @param subTreeRoot - The `subTreeRoot` parameter is the root node of the subtree where the values will be modified.
+     * @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 increased or decreased.
+     * @param {BinaryTreeNodePropertyName} [propertyName] - The `propertyName` parameter is an optional parameter that
+     * specifies the property of the `BinaryTreeNode` that should be modified. It defaults to `'id'` if not provided.
+     * @returns a boolean value, which is `true`.
+     */
+    BinaryTree.prototype.subTreeAdd = function (subTreeRoot, delta, propertyName) {
+        var _this = this;
         propertyName = propertyName !== null && propertyName !== void 0 ? propertyName : 'id';
         if (!subTreeRoot)
             return false;
-        const _addByProperty = (cur) => {
+        var _addByProperty = function (cur) {
             switch (propertyName) {
                 case 'id':
                     cur.id += delta;
                     break;
                 case 'count':
                     cur.count += delta;
-                    this.count += delta;
+                    _this.count += delta;
                     break;
                 default:
                     cur.id += delta;
@@ -695,30 +911,39 @@ class BinaryTree {
             }
         };
         if (this._loopType === 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;
-    }
-    BFS(nodeOrPropertyName) {
+    };
+    /**
+     * The BFS function performs a breadth-first search on a binary tree and returns the results based on a specified node
+     * or 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 algorithm will be
+     * performed starting from that node. If a property name is provided, the breadth-first search algorithm will be
+     * performed starting from the root node
+     * @returns an object of type `ResultsByProperty<T>`.
+     */
+    BinaryTree.prototype.BFS = function (nodeOrPropertyName) {
         nodeOrPropertyName = nodeOrPropertyName !== null && nodeOrPropertyName !== void 0 ? nodeOrPropertyName : 'id';
         this._resetResults();
-        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)
@@ -728,22 +953,35 @@ class BinaryTree {
             }
         }
         return this._getResultByPropertyName(nodeOrPropertyName);
-    }
-    DFS(pattern, nodeOrPropertyName) {
+    };
+    /**
+     * The DFS function performs a depth-first search traversal on a binary tree and returns the results based on the
+     * specified pattern and node or property name.
+     * @param {'in' | 'pre' | 'post'} [pattern] - The "pattern" parameter is used to specify the order in which the nodes
+     * of a binary tree are traversed during the Depth-First Search (DFS) algorithm. It can take one of three values: 'in',
+     * 'pre', or 'post'.
+     * @param {NodeOrPropertyName} [nodeOrPropertyName] - The `nodeOrPropertyName` parameter is a string that represents
+     * either the name of a property in the `BinaryTreeNode` object or the value of the `id` property in the
+     * `BinaryTreeNode` object. This parameter is used to accumulate the results based on the specified property name. If
+     * no value
+     * @returns an object of type `ResultsByProperty<T>`.
+     */
+    BinaryTree.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._resetResults();
-        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)
@@ -754,13 +992,13 @@ class BinaryTree {
                         _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);
-    }
+    };
     /**
      * Time complexity is O(n)
      * Space complexity of Iterative DFS equals to recursive DFS which is O(n) because of the stack
@@ -768,16 +1006,16 @@ class BinaryTree {
      * @param nodeOrPropertyName
      * @constructor
      */
-    DFSIterative(pattern, nodeOrPropertyName) {
+    BinaryTree.prototype.DFSIterative = function (pattern, nodeOrPropertyName) {
         pattern = pattern || 'in';
         nodeOrPropertyName = nodeOrPropertyName || 'id';
         this._resetResults();
         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) {
@@ -809,16 +1047,28 @@ class BinaryTree {
             }
         }
         return this._getResultByPropertyName(nodeOrPropertyName);
-    }
-    levelIterative(node, 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 {BinaryTreeNode<T> | 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 `ResultsByProperty<T>`.
+     */
+    BinaryTree.prototype.levelIterative = function (node, nodeOrPropertyName) {
         nodeOrPropertyName = nodeOrPropertyName || 'id';
         node = node || this.root;
         if (!node)
             return [];
         this._resetResults();
-        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) {
@@ -830,14 +1080,23 @@ class BinaryTree {
             }
         }
         return this._getResultByPropertyName(nodeOrPropertyName);
-    }
-    listLevels(node, nodeOrPropertyName) {
+    };
+    /**
+     * The `listLevels` function collects nodes from a binary tree by a specified property and organizes them into levels.
+     * @param {BinaryTreeNode<T> | 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 `ResultByProperty<T>` objects.
+     */
+    BinaryTree.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);
@@ -857,61 +1116,75 @@ class BinaryTree {
             }
         };
         if (this._loopType === 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;
-    }
-    getPredecessor(node) {
+    };
+    /**
+     * 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.
+     */
+    BinaryTree.prototype.getPredecessor = function (node) {
         if (node.left) {
-            let predecessor = node.left;
-            while (predecessor.right && predecessor.right !== node) {
-                predecessor = predecessor.right;
+            var predecessor = node.left;
+            while (!(predecessor) || predecessor.right && predecessor.right !== node) {
+                if (predecessor) {
+                    predecessor = predecessor.right;
+                }
             }
             return predecessor;
         }
         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 and returns the results based on the specified property name.
      * 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
-     * @param pattern
-     * @param nodeOrPropertyName
+     * @param {'in' | 'pre' | 'post'} [pattern] - The `pattern` parameter is an optional parameter that determines the
+     * traversal pattern of the binary tree. It can have one of three values:
+     * @param {NodeOrPropertyName} [nodeOrPropertyName] - The `nodeOrPropertyName` parameter is used to specify the
+     * property of the nodes that you want to retrieve in the results. It can be either the node itself or the name of the
+     * property. If not provided, it defaults to `'id'`.
+     * @returns The function `morris` returns an object of type `ResultsByProperty<T>`.
      */
-    morris(pattern, nodeOrPropertyName) {
+    BinaryTree.prototype.morris = function (pattern, nodeOrPropertyName) {
+        var _this = this;
         if (this.root === null)
             return [];
         pattern = pattern || 'in';
         nodeOrPropertyName = nodeOrPropertyName || 'id';
         this._resetResults();
-        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;
@@ -920,11 +1193,11 @@ class BinaryTree {
             }
             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);
@@ -933,7 +1206,7 @@ class BinaryTree {
             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;
@@ -950,7 +1223,7 @@ class BinaryTree {
             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);
@@ -970,7 +1243,7 @@ class BinaryTree {
             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;
@@ -987,6 +1260,111 @@ class BinaryTree {
                 break;
         }
         return this._getResultByPropertyName(nodeOrPropertyName);
-    }
-}
+    };
+    /**
+     * The function resets the values of several arrays used for tracking visited nodes and their properties.
+     */
+    BinaryTree.prototype._resetResults = function () {
+        this._visitedId = [];
+        this._visitedVal = [];
+        this._visitedNode = [];
+        this._visitedCount = [];
+        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 cur - The current binary tree node that is being checked.
+     * @param {(BinaryTreeNode<T> | null | undefined)[]} result - An array that stores the matching nodes found during the
+     * traversal.
+     * @param {BinaryTreeNodeId | T} nodeProperty - The `nodeProperty` parameter is the value that we are searching for in
+     * the binary tree nodes. It can be either the `id`, `count`, or `val` property of the node.
+     * @param {BinaryTreeNodePropertyName} [propertyName] - The `propertyName` parameter is an optional parameter that
+     * specifies the property of the `BinaryTreeNode` object that you want to compare with the `nodeProperty` value. It can
+     * be one of the following values: 'id', 'count', or 'val'. If no `propertyName` is provided,
+     * @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 or not a node was pushed into the result array.
+     */
+    BinaryTree.prototype._pushByPropertyNameStopOrNot = function (cur, result, nodeProperty, propertyName, onlyOne) {
+        switch (propertyName) {
+            case 'id':
+                if (cur.id === nodeProperty) {
+                    result.push(cur);
+                    return !!onlyOne;
+                }
+                break;
+            case 'count':
+                if (cur.count === nodeProperty) {
+                    result.push(cur);
+                    return !!onlyOne;
+                }
+                break;
+            case 'val':
+                if (cur.val === nodeProperty) {
+                    result.push(cur);
+                    return !!onlyOne;
+                }
+                break;
+            default:
+                if (cur.id === nodeProperty) {
+                    result.push(cur);
+                    return !!onlyOne;
+                }
+                break;
+        }
+    };
+    /**
+     * The function `_accumulatedByPropertyName` pushes a property value of a binary tree node into an array based on the
+     * provided property name or a default property name.
+     * @param node - The `node` parameter is of type `BinaryTreeNode<T>`, which represents a node in a binary tree.
+     * @param {NodeOrPropertyName} [nodeOrPropertyName] - The parameter `nodeOrPropertyName` 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 of the node that should be accumulated. If it is a node object, it specifies the node itself
+     */
+    BinaryTree.prototype._accumulatedByPropertyName = function (node, nodeOrPropertyName) {
+        nodeOrPropertyName = nodeOrPropertyName !== null && nodeOrPropertyName !== void 0 ? nodeOrPropertyName : 'id';
+        switch (nodeOrPropertyName) {
+            case 'id':
+                this._visitedId.push(node.id);
+                break;
+            case 'val':
+                this._visitedVal.push(node.val);
+                break;
+            case 'node':
+                this._visitedNode.push(node);
+                break;
+            case 'count':
+                this._visitedCount.push(node.count);
+                break;
+            default:
+                this._visitedId.push(node.id);
+                break;
+        }
+    };
+    /**
+     * The function `_getResultByPropertyName` returns different results based on the provided property name or defaulting
+     * to 'id'.
+     * @param {NodeOrPropertyName} [nodeOrPropertyName] - The parameter `nodeOrPropertyName` is an optional parameter that
+     * can accept a value of type `NodeOrPropertyName`.
+     * @returns The method returns an object of type `ResultsByProperty<T>`.
+     */
+    BinaryTree.prototype._getResultByPropertyName = function (nodeOrPropertyName) {
+        nodeOrPropertyName = nodeOrPropertyName !== null && nodeOrPropertyName !== void 0 ? nodeOrPropertyName : 'id';
+        switch (nodeOrPropertyName) {
+            case 'id':
+                return this._visitedId;
+            case 'val':
+                return this._visitedVal;
+            case 'node':
+                return this._visitedNode;
+            case 'count':
+                return this._visitedCount;
+            default:
+                return this._visitedId;
+        }
+    };
+    return BinaryTree;
+}());
 exports.BinaryTree = BinaryTree;