data-structure-typed 1.18.5 → 1.18.7

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

@@ -0,0 +1,1480 @@
+"use strict";
+/**
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @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 () {
+    /**
+     * The constructor function initializes a BinaryTreeNode object with an id, value, and count.
+     * @param {BinaryTreeNodeId} id - The `id` parameter is of type `BinaryTreeNodeId` and represents the unique identifier
+     * for the binary tree node.
+     * @param {T} [val] - The `val` parameter is an optional parameter of type `T`. It represents the value of the binary
+     * tree node. If no value is provided, it will be `undefined`.
+     * @param {number} [count] - The `count` parameter is an optional parameter that represents the number of times the
+     * value `val` appears in the binary tree node. If the `count` parameter is not provided, it defaults to 1.
+     */
+    function AbstractBinaryTreeNode(id, val, count) {
+        this._familyPosition = types_1.FamilyPosition.ROOT;
+        this._count = 1;
+        this._height = 0;
+        this._id = id;
+        this._val = val;
+        this._count = count !== null && count !== void 0 ? count : 1;
+    }
+    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;
+                v.familyPosition = types_1.FamilyPosition.LEFT;
+            }
+            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;
+                v.familyPosition = types_1.FamilyPosition.RIGHT;
+            }
+            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, "familyPosition", {
+        get: function () {
+            return this._familyPosition;
+        },
+        set: function (v) {
+            this._familyPosition = v;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(AbstractBinaryTreeNode.prototype, "count", {
+        get: function () {
+            return this._count;
+        },
+        set: function (v) {
+            this._count = 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
+    });
+    /**
+     * The function swaps the location of two nodes in a binary tree.
+     * @param {FAMILY} swapNode - The `swapNode` parameter is of type `FAMILY`, which represents a node in a family tree.
+     * @returns the `swapNode` object after swapping its properties with the properties of `this` object.
+     */
+    AbstractBinaryTreeNode.prototype.swapLocation = function (swapNode) {
+        var val = swapNode.val, count = swapNode.count, height = swapNode.height;
+        var tempNode = this.createNode(swapNode.id, val);
+        if (tempNode instanceof AbstractBinaryTreeNode) {
+            tempNode.val = val;
+            tempNode.count = count;
+            tempNode.height = height;
+            swapNode.id = this.id;
+            swapNode.val = this.val;
+            swapNode.count = this.count;
+            swapNode.height = this.height;
+            this.id = tempNode.id;
+            this.val = tempNode.val;
+            this.count = tempNode.count;
+            this.height = tempNode.height;
+        }
+        return swapNode;
+    };
+    /**
+     * The `clone` function returns a new instance of the `FAMILY` class with the same `id`, `val`, and `count` properties.
+     * @returns The `clone()` method is returning a new instance of the `FAMILY` class with the same `id`, `val`, and
+     * `count` values as the current instance.
+     */
+    AbstractBinaryTreeNode.prototype.clone = function () {
+        return this.createNode(this.id, this.val, this.count);
+    };
+    return AbstractBinaryTreeNode;
+}());
+exports.AbstractBinaryTreeNode = AbstractBinaryTreeNode;
+var AbstractBinaryTree = /** @class */ (function () {
+    /**
+     * 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) {
+        this._loopType = types_1.LoopType.ITERATIVE;
+        this._visitedId = [];
+        this._visitedVal = [];
+        this._visitedNode = [];
+        this._visitedCount = [];
+        this._visitedLeftSum = [];
+        this._autoIncrementId = false;
+        this._maxId = -1;
+        this._isDuplicatedVal = false;
+        this._root = null;
+        this._size = 0;
+        this._count = 0;
+        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.isDuplicatedVal, isDuplicatedVal = _c === void 0 ? false : _c;
+            this._isDuplicatedVal = isDuplicatedVal;
+            this._autoIncrementId = autoIncrementId;
+            this._loopType = loopType;
+        }
+    }
+    Object.defineProperty(AbstractBinaryTree.prototype, "loopType", {
+        get: function () {
+            return this._loopType;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(AbstractBinaryTree.prototype, "visitedId", {
+        get: function () {
+            return this._visitedId;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(AbstractBinaryTree.prototype, "visitedVal", {
+        get: function () {
+            return this._visitedVal;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(AbstractBinaryTree.prototype, "visitedNode", {
+        get: function () {
+            return this._visitedNode;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(AbstractBinaryTree.prototype, "visitedCount", {
+        get: function () {
+            return this._visitedCount;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(AbstractBinaryTree.prototype, "visitedLeftSum", {
+        get: function () {
+            return this._visitedLeftSum;
+        },
+        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, "isDuplicatedVal", {
+        get: function () {
+            return this._isDuplicatedVal;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    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, "count", {
+        get: function () {
+            return this._count;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    /**
+     * The clear function resets the state of an object by setting its properties to their initial values.
+     */
+    AbstractBinaryTree.prototype.clear = function () {
+        this._setRoot(null);
+        this._setSize(0);
+        this._setCount(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 () {
+        return this.size === 0;
+    };
+    /**
+     * The `add` 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 {N} 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 `add` returns a `N` object if a new node is inserted, or `null` if no new node
+     * is inserted, or `undefined` if the insertion fails.
+     */
+    AbstractBinaryTree.prototype.add = function (id, val, count) {
+        var _this = this;
+        count = count !== null && count !== void 0 ? count : 1;
+        var _bfs = function (root, newNode) {
+            var queue = [root];
+            while (queue.length > 0) {
+                var cur = queue.shift();
+                if (cur) {
+                    var inserted_1 = _this.addTo(newNode, cur);
+                    if (inserted_1 !== undefined)
+                        return inserted_1;
+                    if (cur.left)
+                        queue.push(cur.left);
+                    if (cur.right)
+                        queue.push(cur.right);
+                }
+                else
+                    return;
+            }
+            return;
+        };
+        var inserted;
+        var needInsert = val !== null ? this.createNode(id, val !== null && val !== void 0 ? val : id, count) : null;
+        var existNode = val !== null ? this.get(id, 'id') : null;
+        if (this.root) {
+            if (existNode) {
+                existNode.count += count;
+                existNode.val = val !== null && val !== void 0 ? val : id;
+                if (needInsert !== null) {
+                    this._setCount(this.count + count);
+                    inserted = existNode;
+                }
+            }
+            else {
+                inserted = _bfs(this.root, needInsert);
+            }
+        }
+        else {
+            this._setRoot(val !== null ? this.createNode(id, val !== null && val !== void 0 ? val : id, count) : null);
+            if (needInsert !== null) {
+                this._setSize(1);
+                this._setCount(count);
+            }
+            inserted = this.root;
+        }
+        return inserted;
+    };
+    /**
+     * The function adds a new node to a binary tree as the left or right child of a given parent node.
+     * @param {N | null} newNode - The `newNode` parameter represents the node that you want to add to the tree. It can be
+     * either a node object (`N`) or `null`.
+     * @param {N} parent - The `parent` parameter represents the parent node to which the new node will be added as a
+     * child.
+     * @returns either the left or right child node that was added to the parent node. It can also return `null` or
+     * `undefined` in certain cases.
+     */
+    AbstractBinaryTree.prototype.addTo = function (newNode, parent) {
+        var _a, _b;
+        if (parent) {
+            if (parent.left === undefined) {
+                if (newNode) {
+                    newNode.parent = parent;
+                    newNode.familyPosition = types_1.FamilyPosition.LEFT;
+                }
+                parent.left = newNode;
+                if (newNode !== null) {
+                    this._setSize(this.size + 1);
+                    this._setCount((_a = this.count + newNode.count) !== null && _a !== void 0 ? _a : 0);
+                }
+                return parent.left;
+            }
+            else if (parent.right === undefined) {
+                if (newNode) {
+                    newNode.parent = parent;
+                    newNode.familyPosition = types_1.FamilyPosition.RIGHT;
+                }
+                parent.right = newNode;
+                if (newNode !== null) {
+                    this._setSize(this.size + 1);
+                    this._setCount((_b = this.count + newNode.count) !== null && _b !== void 0 ? _b : 0);
+                }
+                return parent.right;
+            }
+            else {
+                return;
+            }
+        }
+        else {
+            return;
+        }
+    };
+    /**
+     * The `addMany` function inserts multiple items into a binary tree and returns an array of the inserted nodes or
+     * null/undefined values.
+     * @param {N[] | N[]} data - The `data` parameter can be either an array of elements of type `N` or an
+     * array of `N` objects.
+     * @returns The function `addMany` returns an array of `N`, `null`, or `undefined` values.
+     */
+    AbstractBinaryTree.prototype.addMany = function (data) {
+        var e_1, _a, e_2, _b;
+        var _c;
+        var inserted = [];
+        var map = new Map();
+        if (!this._isDuplicatedVal) {
+            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);
+                }
+            }
+            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; }
+            }
+        }
+        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;
+                // TODO will this cause an issue?
+                var count = this._isDuplicatedVal ? 1 : map.get(item);
+                if (item instanceof AbstractBinaryTreeNode) {
+                    inserted.push(this.add(item.id, item.val, item.count));
+                }
+                else if (typeof item === 'number') {
+                    if (!this._autoIncrementId) {
+                        if (!this._isDuplicatedVal) {
+                            if (map.get(item) !== undefined) {
+                                inserted.push(this.add(item, item, count));
+                                map.delete(item);
+                            }
+                        }
+                        else {
+                            inserted.push(this.add(item, item, 1));
+                        }
+                    }
+                }
+                else if (item instanceof Object) {
+                    if (!this._isDuplicatedVal) {
+                        if (map.has(item)) {
+                            var newId = void 0;
+                            if (!this._autoIncrementId) {
+                                if (Object.keys(item).includes('id')) {
+                                    newId = item.id;
+                                }
+                                else {
+                                    console.warn('Object value must has an id property when the autoIncrementId is false');
+                                    break;
+                                }
+                            }
+                            else {
+                                newId = this.maxId + 1;
+                                this._setMaxId(newId);
+                            }
+                            inserted.push(this.add(newId, item, count));
+                            map.delete(item);
+                        }
+                    }
+                    else {
+                        inserted.push(this.add(++this._maxId, item, 1));
+                    }
+                }
+                else if (item === null) {
+                    inserted.push(this.add(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;
+    };
+    /**
+     * The `fill` function clears the current data and inserts new data, returning a boolean indicating if the insertion
+     * was successful.
+     * @param {N[] | N[]} data - The `data` parameter can be either an array of elements of type `N` or an
+     * array of `N` objects.
+     * @returns The method is returning a boolean value.
+     */
+    AbstractBinaryTree.prototype.fill = function (data) {
+        this.clear();
+        return data.length === this.addMany(data).length;
+    };
+    /**
+     * 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.
+     */
+    AbstractBinaryTree.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) {
+            node.count--;
+            this._setCount(this.count - 1);
+        }
+        else if (node instanceof AbstractBinaryTreeNode) {
+            var _a = __read(this.getSubTreeSizeAndCount(node), 2), subSize = _a[0], subCount = _a[1];
+            switch (node.familyPosition) {
+                case 0:
+                    this._setSize(this.size - subSize);
+                    this._setCount(this.count - subCount);
+                    node = undefined;
+                    break;
+                case 1:
+                    if (node.parent) {
+                        this._setSize(this.size - subSize);
+                        this._setCount(this.count - subCount);
+                        node.parent.left = null;
+                    }
+                    break;
+                case 2:
+                    if (node.parent) {
+                        this._setSize(this.size - subSize);
+                        this._setCount(this.count - subCount);
+                        node.parent.right = null;
+                    }
+                    break;
+            }
+        }
+        return [{ deleted: node, needBalanced: null }];
+    };
+    /**
+     * The function calculates the depth of a binary tree node by traversing its parent nodes.
+     * @param node - N - 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.
+     */
+    AbstractBinaryTree.prototype.getDepth = function (node) {
+        var depth = 0;
+        while (node.parent) {
+            depth++;
+            node = node.parent;
+        }
+        return depth;
+    };
+    /**
+     * The `getHeight` function calculates the maximum height of a binary tree using either a recursive or iterative
+     * approach.
+     * @param {N | null} [beginRoot] - The `beginRoot` parameter is an optional parameter of type
+     * `N | 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.
+     */
+    AbstractBinaryTree.prototype.getHeight = function (beginRoot) {
+        var _a, _b, _c;
+        beginRoot = beginRoot !== null && beginRoot !== void 0 ? beginRoot : this.root;
+        if (!beginRoot)
+            return -1;
+        if (this._loopType === types_1.LoopType.RECURSIVE) {
+            var _getMaxHeight_1 = function (cur) {
+                if (!cur)
+                    return -1;
+                var leftHeight = _getMaxHeight_1(cur.left);
+                var rightHeight = _getMaxHeight_1(cur.right);
+                return Math.max(leftHeight, rightHeight) + 1;
+            };
+            return _getMaxHeight_1(beginRoot);
+        }
+        else {
+            var stack = [];
+            var node = beginRoot, last = null;
+            var depths = new Map();
+            while (stack.length > 0 || node) {
+                if (node) {
+                    stack.push(node);
+                    node = node.left;
+                }
+                else {
+                    node = stack[stack.length - 1];
+                    if (!node.right || last === node.right) {
+                        node = stack.pop();
+                        if (node) {
+                            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;
+                        }
+                    }
+                    else
+                        node = node.right;
+                }
+            }
+            return (_c = depths.get(beginRoot)) !== null && _c !== void 0 ? _c : -1;
+        }
+    };
+    /**
+     * The `getMinHeight` function calculates the minimum height of a binary tree using either a recursive or iterative
+     * approach.
+     * @param {N | null} [beginRoot] - The `beginRoot` parameter is an optional parameter of type
+     * `N | 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.
+     */
+    AbstractBinaryTree.prototype.getMinHeight = function (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) {
+                if (!cur)
+                    return 0;
+                if (!cur.left && !cur.right)
+                    return 0;
+                var leftMinHeight = _getMinHeight_1(cur.left);
+                var rightMinHeight = _getMinHeight_1(cur.right);
+                return Math.min(leftMinHeight, rightMinHeight) + 1;
+            };
+            return _getMinHeight_1(beginRoot);
+        }
+        else {
+            var stack = [];
+            var node = beginRoot, last = null;
+            var depths = new Map();
+            while (stack.length > 0 || node) {
+                if (node) {
+                    stack.push(node);
+                    node = node.left;
+                }
+                else {
+                    node = stack[stack.length - 1];
+                    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;
+                            depths.set(node, 1 + Math.min(leftMinHeight, rightMinHeight));
+                            last = node;
+                            node = null;
+                        }
+                    }
+                    else
+                        node = node.right;
+                }
+            }
+            return (_c = depths.get(beginRoot)) !== null && _c !== void 0 ? _c : -1;
+        }
+    };
+    /**
+     * The function checks if a binary tree is balanced by comparing the minimum height and the maximum height of the tree.
+     * @param {N | null} [beginRoot] - The `beginRoot` parameter is the root node of a binary tree. It is
+     * of type `N | null`, which means it can either be a `BinaryTreeNode` object or `null`.
+     * @returns The method is returning a boolean value.
+     */
+    AbstractBinaryTree.prototype.isBalanced = function (beginRoot) {
+        return (this.getMinHeight(beginRoot) + 1 >= this.getHeight(beginRoot));
+    };
+    /**
+     * 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 | N} nodeProperty - The `nodeProperty` parameter can be either a `BinaryTreeNodeId` or a
+     * generic type `N`. It represents the property of the binary tree node that you want to search for.
+     * @param {BinaryTreeNodePropertyName} [propertyName] - The `propertyName` parameter is an optional parameter that
+     * specifies the property name to use when searching for nodes. If not provided, it defaults to 'id'.
+     * @param {boolean} [onlyOne] - The `onlyOne` parameter is an optional boolean parameter that determines whether to
+     * return only one node that matches the `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 `N | null | undefined` objects.
+     */
+    AbstractBinaryTree.prototype.getNodes = function (nodeProperty, propertyName, onlyOne) {
+        var _this = this;
+        if (!this.root)
+            return [];
+        propertyName = propertyName !== null && propertyName !== void 0 ? propertyName : 'id';
+        var result = [];
+        if (this._loopType === types_1.LoopType.RECURSIVE) {
+            var _traverse_1 = function (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);
+            };
+            _traverse_1(this.root);
+        }
+        else {
+            var queue = [this.root];
+            while (queue.length > 0) {
+                var cur = queue.shift();
+                if (cur) {
+                    if (this._pushByPropertyNameStopOrNot(cur, result, nodeProperty, propertyName, onlyOne))
+                        return result;
+                    cur.left && queue.push(cur.left);
+                    cur.right && queue.push(cur.right);
+                }
+            }
+        }
+        return result;
+    };
+    /**
+     * 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 | N} nodeProperty - The `nodeProperty` parameter can be either a `BinaryTreeNodeId` or a
+     * generic type `N`. 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.
+     */
+    AbstractBinaryTree.prototype.has = function (nodeProperty, propertyName) {
+        return this.getNodes(nodeProperty, propertyName).length > 0;
+    };
+    /**
+     * 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 | N} nodeProperty - The `nodeProperty` parameter can be either a `BinaryTreeNodeId` or a
+     * generic type `N`. It represents the property of the binary tree node that you want to search for.
+     * @param {BinaryTreeNodePropertyName} [propertyName] - The `propertyName` parameter is an optional parameter that
+     * specifies the property of the binary tree node to search for. If not provided, it defaults to `'id'`.
+     * @returns a BinaryTreeNode object or null.
+     */
+    AbstractBinaryTree.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;
+    };
+    /**
+     * 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 `N` objects, representing the path from
+     * the given `node` to the root of the binary tree.
+     */
+    AbstractBinaryTree.prototype.getPathToRoot = function (node) {
+        var 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, either recursively or iteratively using tail
+     * recursion optimization.
+     * @param {N | null} [node] - The `node` parameter is an optional parameter of type `N
+     * | 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.
+     */
+    AbstractBinaryTree.prototype.getLeftMost = function (node) {
+        node = node !== null && node !== void 0 ? node : this.root;
+        if (!node)
+            return node;
+        if (this._loopType === types_1.LoopType.RECURSIVE) {
+            var _traverse_2 = function (cur) {
+                if (!cur.left)
+                    return cur;
+                return _traverse_2(cur.left);
+            };
+            return _traverse_2(node);
+        }
+        else {
+            // Indirect implementation of iteration using tail recursion optimization
+            var _traverse_3 = (0, utils_1.trampoline)(function (cur) {
+                if (!cur.left)
+                    return cur;
+                return _traverse_3.cont(cur.left);
+            });
+            return _traverse_3(node);
+        }
+    };
+    /**
+     * The `getRightMost` function returns the rightmost node in a binary tree, either recursively or iteratively using
+     * tail recursion optimization.
+     * @param {N | null} [node] - The `node` parameter is an optional parameter of type `N
+     * | 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.
+     */
+    AbstractBinaryTree.prototype.getRightMost = function (node) {
+        node = node !== null && node !== void 0 ? node : this.root;
+        if (!node)
+            return node;
+        if (this._loopType === types_1.LoopType.RECURSIVE) {
+            var _traverse_4 = function (cur) {
+                if (!cur.right)
+                    return cur;
+                return _traverse_4(cur.right);
+            };
+            return _traverse_4(node);
+        }
+        else {
+            // Indirect implementation of iteration using tail recursion optimization
+            var _traverse_5 = (0, utils_1.trampoline)(function (cur) {
+                if (!cur.right)
+                    return cur;
+                return _traverse_5.cont(cur.right);
+            });
+            return _traverse_5(node);
+        }
+    };
+    /**
+     * The function `isBSTByRooted` checks if a binary tree is a binary search tree (BST) by rooted traversal.
+     * @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) {
+        if (!node)
+            return true;
+        if (this._loopType === types_1.LoopType.RECURSIVE) {
+            var dfs_1 = function (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_1(node, Number.MIN_SAFE_INTEGER, Number.MAX_SAFE_INTEGER);
+        }
+        else {
+            var stack = [];
+            var prev = Number.MIN_SAFE_INTEGER, curr = node;
+            while (curr || stack.length > 0) {
+                while (curr) {
+                    stack.push(curr);
+                    curr = curr.left;
+                }
+                curr = stack.pop();
+                if (!(curr) || prev >= curr.id)
+                    return false;
+                prev = curr.id;
+                curr = curr.right;
+            }
+            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) {
+        return this.isBSTByRooted(this.root);
+    };
+    /**
+     * The function calculates the size and count of a subtree in a binary tree using either recursive or iterative
+     * traversal.
+     * @param {N | 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.
+     */
+    AbstractBinaryTree.prototype.getSubTreeSizeAndCount = function (subTreeRoot) {
+        var res = [0, 0];
+        if (!subTreeRoot)
+            return res;
+        if (this._loopType === types_1.LoopType.RECURSIVE) {
+            var _traverse_6 = function (cur) {
+                res[0]++;
+                res[1] += cur.count;
+                cur.left && _traverse_6(cur.left);
+                cur.right && _traverse_6(cur.right);
+            };
+            _traverse_6(subTreeRoot);
+            return res;
+        }
+        else {
+            var stack = [subTreeRoot];
+            while (stack.length > 0) {
+                var cur = stack.pop();
+                res[0]++;
+                res[1] += cur.count;
+                cur.right && stack.push(cur.right);
+                cur.left && stack.push(cur.left);
+            }
+            return res;
+        }
+    };
+    // --- start additional methods ---
+    /**
+     * 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`.
+     */
+    AbstractBinaryTree.prototype.subTreeSum = function (subTreeRoot, propertyName) {
+        propertyName = propertyName !== null && propertyName !== void 0 ? propertyName : 'id';
+        if (!subTreeRoot)
+            return 0;
+        var sum = 0;
+        var _sumByProperty = function (cur) {
+            var needSum;
+            switch (propertyName) {
+                case 'id':
+                    needSum = cur.id;
+                    break;
+                case 'count':
+                    needSum = cur.count;
+                    break;
+                case 'val':
+                    needSum = typeof cur.val === 'number' ? cur.val : 0;
+                    break;
+                default:
+                    needSum = cur.id;
+                    break;
+            }
+            return needSum;
+        };
+        if (this._loopType === types_1.LoopType.RECURSIVE) {
+            var _traverse_7 = function (cur) {
+                sum += _sumByProperty(cur);
+                cur.left && _traverse_7(cur.left);
+                cur.right && _traverse_7(cur.right);
+            };
+            _traverse_7(subTreeRoot);
+        }
+        else {
+            var stack = [subTreeRoot];
+            while (stack.length > 0) {
+                var cur = stack.pop();
+                sum += _sumByProperty(cur);
+                cur.right && stack.push(cur.right);
+                cur.left && stack.push(cur.left);
+            }
+        }
+        return sum;
+    };
+    /**
+     * The function `subTreeAdd` adds a 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`.
+     */
+    AbstractBinaryTree.prototype.subTreeAdd = function (subTreeRoot, delta, propertyName) {
+        var _this = this;
+        propertyName = propertyName !== null && propertyName !== void 0 ? propertyName : 'id';
+        if (!subTreeRoot)
+            return false;
+        var _addByProperty = function (cur) {
+            switch (propertyName) {
+                case 'id':
+                    cur.id += delta;
+                    break;
+                case 'count':
+                    cur.count += delta;
+                    _this._setCount(_this.count + delta);
+                    break;
+                default:
+                    cur.id += delta;
+                    break;
+            }
+        };
+        if (this._loopType === types_1.LoopType.RECURSIVE) {
+            var _traverse_8 = function (cur) {
+                _addByProperty(cur);
+                cur.left && _traverse_8(cur.left);
+                cur.right && _traverse_8(cur.right);
+            };
+            _traverse_8(subTreeRoot);
+        }
+        else {
+            var stack = [subTreeRoot];
+            while (stack.length > 0) {
+                var cur = stack.pop();
+                _addByProperty(cur);
+                cur.right && stack.push(cur.right);
+                cur.left && stack.push(cur.left);
+            }
+        }
+        return true;
+    };
+    /**
+     * The BFS function performs a breadth-first search on a binary tree 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 `AbstractBinaryTreeNodeProperties<N>`.
+     */
+    AbstractBinaryTree.prototype.BFS = function (nodeOrPropertyName) {
+        nodeOrPropertyName = nodeOrPropertyName !== null && nodeOrPropertyName !== void 0 ? nodeOrPropertyName : 'id';
+        this._resetResults();
+        var queue = [this.root];
+        while (queue.length !== 0) {
+            var cur = queue.shift();
+            if (cur) {
+                this._accumulatedByPropertyName(cur, nodeOrPropertyName);
+                if ((cur === null || cur === void 0 ? void 0 : cur.left) !== null)
+                    queue.push(cur.left);
+                if ((cur === null || cur === void 0 ? void 0 : cur.right) !== null)
+                    queue.push(cur.right);
+            }
+        }
+        return this._getResultByPropertyName(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 `AbstractBinaryTreeNodeProperties<N>`.
+     */
+    AbstractBinaryTree.prototype.DFS = function (pattern, nodeOrPropertyName) {
+        var _this = this;
+        pattern = pattern !== null && pattern !== void 0 ? pattern : 'in';
+        nodeOrPropertyName = nodeOrPropertyName !== null && nodeOrPropertyName !== void 0 ? nodeOrPropertyName : 'id';
+        this._resetResults();
+        var _traverse = function (node) {
+            switch (pattern) {
+                case 'in':
+                    if (node.left)
+                        _traverse(node.left);
+                    _this._accumulatedByPropertyName(node, nodeOrPropertyName);
+                    if (node.right)
+                        _traverse(node.right);
+                    break;
+                case 'pre':
+                    _this._accumulatedByPropertyName(node, nodeOrPropertyName);
+                    if (node.left)
+                        _traverse(node.left);
+                    if (node.right)
+                        _traverse(node.right);
+                    break;
+                case 'post':
+                    if (node.left)
+                        _traverse(node.left);
+                    if (node.right)
+                        _traverse(node.right);
+                    _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
+     * @param pattern
+     * @param nodeOrPropertyName
+     * @constructor
+     */
+    AbstractBinaryTree.prototype.DFSIterative = function (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 }];
+        while (stack.length > 0) {
+            var cur = stack.pop();
+            if (!cur || !cur.node)
+                continue;
+            if (cur.opt === 1) {
+                this._accumulatedByPropertyName(cur.node, nodeOrPropertyName);
+            }
+            else {
+                switch (pattern) {
+                    case 'in':
+                        stack.push({ opt: 0, node: cur.node.right });
+                        stack.push({ opt: 1, node: cur.node });
+                        stack.push({ opt: 0, node: cur.node.left });
+                        break;
+                    case 'pre':
+                        stack.push({ opt: 0, node: cur.node.right });
+                        stack.push({ opt: 0, node: cur.node.left });
+                        stack.push({ opt: 1, node: cur.node });
+                        break;
+                    case 'post':
+                        stack.push({ opt: 1, node: cur.node });
+                        stack.push({ opt: 0, node: cur.node.right });
+                        stack.push({ opt: 0, node: cur.node.left });
+                        break;
+                    default:
+                        stack.push({ opt: 0, node: cur.node.right });
+                        stack.push({ opt: 1, node: cur.node });
+                        stack.push({ opt: 0, node: cur.node.left });
+                        break;
+                }
+            }
+        }
+        return this._getResultByPropertyName(nodeOrPropertyName);
+    };
+    /**
+     * The `levelIterative` function performs a level-order traversal on a binary tree and returns the values of the nodes
+     * in an array, based on a specified property name.
+     * @param {N | null} node - The `node` parameter is a BinaryTreeNode object representing the starting
+     * node for the level order traversal. It can be null if no specific node is provided, in which case the root node of
+     * the tree is used as the starting node.
+     * @param {NodeOrPropertyName} [nodeOrPropertyName] - The `nodeOrPropertyName` parameter is an optional parameter that
+     * can be either a `BinaryTreeNode` property name or the string `'id'`. If a property name is provided, the function
+     * will accumulate results based on that property. If no property name is provided, the function will default to
+     * accumulating results
+     * @returns The function `levelIterative` returns an object of type `AbstractBinaryTreeNodeProperties<N>`.
+     */
+    AbstractBinaryTree.prototype.levelIterative = function (node, nodeOrPropertyName) {
+        nodeOrPropertyName = nodeOrPropertyName || 'id';
+        node = node || this.root;
+        if (!node)
+            return [];
+        this._resetResults();
+        var queue = [node];
+        while (queue.length > 0) {
+            var cur = queue.shift();
+            if (cur) {
+                this._accumulatedByPropertyName(cur, nodeOrPropertyName);
+                if (cur.left) {
+                    queue.push(cur.left);
+                }
+                if (cur.right) {
+                    queue.push(cur.right);
+                }
+            }
+        }
+        return this._getResultByPropertyName(nodeOrPropertyName);
+    };
+    /**
+     * The `listLevels` function collects nodes from a binary tree by a specified property and organizes them into levels.
+     * @param {N | null} node - The `node` parameter is a BinaryTreeNode object or null. It represents the
+     * root node of a binary tree. If it is null, the function will use the root node of the current binary tree instance.
+     * @param {NodeOrPropertyName} [nodeOrPropertyName] - The `nodeOrPropertyName` parameter is an optional parameter that
+     * specifies the property of the `BinaryTreeNode` object to collect at each level. It can be one of the following
+     * values:
+     * @returns The function `listLevels` returns a 2D array of `AbstractBinaryTreeNodeProperty<N>` objects.
+     */
+    AbstractBinaryTree.prototype.listLevels = function (node, nodeOrPropertyName) {
+        nodeOrPropertyName = nodeOrPropertyName || 'id';
+        node = node || this.root;
+        if (!node)
+            return [];
+        var levelsNodes = [];
+        var collectByProperty = function (node, level) {
+            switch (nodeOrPropertyName) {
+                case 'id':
+                    levelsNodes[level].push(node.id);
+                    break;
+                case 'val':
+                    levelsNodes[level].push(node.val);
+                    break;
+                case 'node':
+                    levelsNodes[level].push(node);
+                    break;
+                case 'count':
+                    levelsNodes[level].push(node.count);
+                    break;
+                default:
+                    levelsNodes[level].push(node.id);
+                    break;
+            }
+        };
+        if (this._loopType === types_1.LoopType.RECURSIVE) {
+            var _recursive_1 = function (node, level) {
+                if (!levelsNodes[level])
+                    levelsNodes[level] = [];
+                collectByProperty(node, level);
+                if (node.left)
+                    _recursive_1(node.left, level + 1);
+                if (node.right)
+                    _recursive_1(node.right, level + 1);
+            };
+            _recursive_1(node, 0);
+        }
+        else {
+            var stack = [[node, 0]];
+            while (stack.length > 0) {
+                var head = stack.pop();
+                var _a = __read(head, 2), node_1 = _a[0], level = _a[1];
+                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]);
+            }
+        }
+        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) {
+        if (node.left) {
+            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 {'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 `AbstractBinaryTreeNodeProperties<N>`.
+     */
+    AbstractBinaryTree.prototype.morris = function (pattern, nodeOrPropertyName) {
+        var _this = this;
+        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;
+            while (node) {
+                next = node.right;
+                node.right = pre;
+                pre = node;
+                node = next;
+            }
+            return pre;
+        };
+        var _printEdge = function (node) {
+            var tail = _reverseEdge(node);
+            var cur = tail;
+            while (cur) {
+                _this._accumulatedByPropertyName(cur, nodeOrPropertyName);
+                cur = cur.right;
+            }
+            _reverseEdge(tail);
+        };
+        switch (pattern) {
+            case 'in':
+                while (cur) {
+                    if (cur.left) {
+                        var predecessor = this.getPredecessor(cur);
+                        if (!predecessor.right) {
+                            predecessor.right = cur;
+                            cur = cur.left;
+                            continue;
+                        }
+                        else {
+                            predecessor.right = null;
+                        }
+                    }
+                    this._accumulatedByPropertyName(cur, nodeOrPropertyName);
+                    cur = cur.right;
+                }
+                break;
+            case 'pre':
+                while (cur) {
+                    if (cur.left) {
+                        var predecessor = this.getPredecessor(cur);
+                        if (!predecessor.right) {
+                            predecessor.right = cur;
+                            this._accumulatedByPropertyName(cur, nodeOrPropertyName);
+                            cur = cur.left;
+                            continue;
+                        }
+                        else {
+                            predecessor.right = null;
+                        }
+                    }
+                    else {
+                        this._accumulatedByPropertyName(cur, nodeOrPropertyName);
+                    }
+                    cur = cur.right;
+                }
+                break;
+            case 'post':
+                while (cur) {
+                    if (cur.left) {
+                        var predecessor = this.getPredecessor(cur);
+                        if (predecessor.right === null) {
+                            predecessor.right = cur;
+                            cur = cur.left;
+                            continue;
+                        }
+                        else {
+                            predecessor.right = null;
+                            _printEdge(cur.left);
+                        }
+                    }
+                    cur = cur.right;
+                }
+                _printEdge(this.root);
+                break;
+        }
+        return this._getResultByPropertyName(nodeOrPropertyName);
+    };
+    AbstractBinaryTree.prototype._setLoopType = function (value) {
+        this._loopType = value;
+    };
+    AbstractBinaryTree.prototype._setVisitedId = function (value) {
+        this._visitedId = value;
+    };
+    AbstractBinaryTree.prototype._setVisitedVal = function (value) {
+        this._visitedVal = value;
+    };
+    AbstractBinaryTree.prototype._setVisitedNode = function (value) {
+        this._visitedNode = value;
+    };
+    AbstractBinaryTree.prototype.setVisitedCount = function (value) {
+        this._visitedCount = value;
+    };
+    AbstractBinaryTree.prototype._setVisitedLeftSum = function (value) {
+        this._visitedLeftSum = value;
+    };
+    AbstractBinaryTree.prototype._setAutoIncrementId = function (value) {
+        this._autoIncrementId = value;
+    };
+    AbstractBinaryTree.prototype._setMaxId = function (value) {
+        this._maxId = value;
+    };
+    AbstractBinaryTree.prototype._setIsDuplicatedVal = function (value) {
+        this._isDuplicatedVal = value;
+    };
+    AbstractBinaryTree.prototype._setRoot = function (v) {
+        if (v) {
+            v.parent = null;
+            v.familyPosition = types_1.FamilyPosition.ROOT;
+        }
+        this._root = v;
+    };
+    AbstractBinaryTree.prototype._setSize = function (v) {
+        this._size = v;
+    };
+    AbstractBinaryTree.prototype._setCount = function (v) {
+        this._count = v;
+    };
+    /**
+     * The function resets the values of several arrays used for tracking visited nodes and their properties.
+     */
+    AbstractBinaryTree.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 {(N | null | undefined)[]} result - An array that stores the matching nodes found during the
+     * traversal.
+     * @param {BinaryTreeNodeId | N} 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.
+     */
+    AbstractBinaryTree.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 `N`, 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
+     */
+    AbstractBinaryTree.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 `AbstractBinaryTreeNodeProperties<T>`.
+     */
+    AbstractBinaryTree.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 AbstractBinaryTree;
+}());
+exports.AbstractBinaryTree = AbstractBinaryTree;