data-structure-typed 0.9.16 → 1.3.1

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

@@ -1,1102 +1,40 @@
 "use strict";
-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;
-};
+/**
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
+ */
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.BinaryTree = exports.BinaryTreeNode = exports.LoopType = exports.FamilyPosition = void 0;
-var trampoline_1 = require("../trampoline");
-var FamilyPosition;
-(function (FamilyPosition) {
-    FamilyPosition[FamilyPosition["root"] = 0] = "root";
-    FamilyPosition[FamilyPosition["left"] = 1] = "left";
-    FamilyPosition[FamilyPosition["right"] = 2] = "right";
-})(FamilyPosition = exports.FamilyPosition || (exports.FamilyPosition = {}));
-var LoopType;
-(function (LoopType) {
-    LoopType[LoopType["iterative"] = 1] = "iterative";
-    LoopType[LoopType["recursive"] = 2] = "recursive";
-})(LoopType = exports.LoopType || (exports.LoopType = {}));
-var BinaryTreeNode = /** @class */ (function () {
-    function BinaryTreeNode(id, val, count) {
-        this._familyPosition = FamilyPosition.root;
-        this._count = 1;
-        this._height = 0;
-        this._id = id;
-        this._val = val;
-        this._count = count !== null && count !== void 0 ? count : 1;
+exports.BinaryTree = exports.BinaryTreeNode = void 0;
+const abstract_binary_tree_1 = require("./abstract-binary-tree");
+class BinaryTreeNode extends abstract_binary_tree_1.AbstractBinaryTreeNode {
+    constructor(id, val) {
+        super(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;
-        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;
-    };
-    BinaryTreeNode.prototype.clone = function () {
-        return new BinaryTreeNode(this.id, this.val, this.count);
-    };
-    return BinaryTreeNode;
-}());
+}
 exports.BinaryTreeNode = BinaryTreeNode;
-var BinaryTree = /** @class */ (function () {
-    function BinaryTree(options) {
-        this._loopType = 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 ? 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(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
-    });
-    BinaryTree.prototype.getCount = function () {
-        return this._count;
-    };
-    BinaryTree.prototype.createNode = function (id, val, count) {
-        return val !== null ? new BinaryTreeNode(id, val, count) : null;
-    };
-    BinaryTree.prototype.clear = function () {
-        this.root = null;
-        this.size = 0;
-        this.count = 0;
-        this._maxId = -1;
-    };
-    BinaryTree.prototype.isEmpty = function () {
-        return this.size === 0;
-    };
-    BinaryTree.prototype.insertTo = function (_a) {
-        var _b, _c;
-        var newNode = _a.newNode, parent = _a.parent;
-        if (parent) {
-            if (parent.left === undefined) {
-                if (newNode) {
-                    newNode.parent = parent;
-                    newNode.familyPosition = FamilyPosition.left;
-                }
-                parent.left = newNode;
-                if (newNode !== null) {
-                    this.size++;
-                    this.count += (_b = newNode === null || newNode === void 0 ? void 0 : newNode.count) !== null && _b !== void 0 ? _b : 0;
-                }
-                return parent.left;
-            }
-            else if (parent.right === undefined) {
-                if (newNode) {
-                    newNode.parent = parent;
-                    newNode.familyPosition = FamilyPosition.right;
-                }
-                parent.right = newNode;
-                if (newNode !== null) {
-                    this.size++;
-                    this.count += (_c = newNode === null || newNode === void 0 ? void 0 : newNode.count) !== null && _c !== void 0 ? _c : 0;
-                }
-                return parent.right;
-            }
-            else {
-                return;
-            }
-        }
-        else {
-            return;
-        }
-    };
-    BinaryTree.prototype.put = 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.insertTo({ newNode: newNode, parent: 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 ? new BinaryTreeNode(id, val, count) : null;
-        var existNode = val !== null ? this.get(id, 'id') : null;
-        if (this.root) {
-            if (existNode) {
-                existNode.count += count;
-                existNode.val = val;
-                if (needInsert !== null) {
-                    this.count += count;
-                    inserted = existNode;
-                }
-            }
-            else {
-                inserted = _bfs(this.root, needInsert);
-            }
-        }
-        else {
-            this.root = val !== null ? new BinaryTreeNode(id, val, count) : null;
-            if (needInsert !== null) {
-                this.size = 1;
-                this.count = count;
-            }
-            inserted = this.root;
-        }
-        return inserted;
-    };
-    BinaryTree.prototype.insertMany = 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;
-                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(item, item, count));
-                            map.delete(item);
-                        }
-                    }
-                    else {
-                        inserted.push(this.put(item, item, 1));
-                    }
-                }
-                else {
-                    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;
-    };
-    BinaryTree.prototype.fill = function (data) {
-        this.clear();
-        return data.length === this.insertMany(data).length;
-    };
-    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) {
-            node.count--;
-            this.count--;
-        }
-        else if (node instanceof BinaryTreeNode) {
-            var _a = __read(this.getSubTreeSizeAndCount(node), 2), subSize = _a[0], subCount = _a[1];
-            switch (node.familyPosition) {
-                case 0:
-                    this.size -= subSize;
-                    this.count -= subCount;
-                    node = undefined;
-                    break;
-                case 1:
-                    if (node.parent) {
-                        this.size -= subSize;
-                        this.count -= subCount;
-                        node.parent.left = null;
-                    }
-                    break;
-                case 2:
-                    if (node.parent) {
-                        this.size -= subSize;
-                        this.count -= subCount;
-                        node.parent.right = null;
-                    }
-                    break;
-            }
-        }
-        return [{ deleted: node, needBalanced: null }];
-    };
-    BinaryTree.prototype.getDepth = function (node) {
-        var depth = 0;
-        while (node.parent) {
-            depth++;
-            node = node.parent;
-        }
-        return depth;
-    };
-    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) {
-            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;
-        }
-    };
-    BinaryTree.prototype.getMinHeight = function (beginRoot) {
-        var _a, _b, _c;
-        beginRoot = beginRoot || this.root;
-        if (!beginRoot)
-            return -1;
-        if (this._loopType === 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;
-        }
-    };
-    BinaryTree.prototype.isBalanced = function (beginRoot) {
-        return (this.getMinHeight(beginRoot) + 1 >= this.getHeight(beginRoot));
-    };
-    BinaryTree.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 === 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;
-    };
-    BinaryTree.prototype.has = function (nodeProperty, propertyName) {
-        return this.getNodes(nodeProperty, propertyName).length > 0;
-    };
-    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;
-    };
-    BinaryTree.prototype.getPathToRoot = function (node) {
-        var result = [];
-        while (node.parent) {
-            result.unshift(node);
-            node = node.parent;
-        }
-        result.unshift(node);
-        return result;
-    };
-    BinaryTree.prototype.getRoot = function () {
-        return this.root;
-    };
-    BinaryTree.prototype.getLeftMost = function (node) {
-        node = node !== null && node !== void 0 ? node : this.root;
-        if (!node)
-            return node;
-        if (this._loopType === 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, trampoline_1.trampoline)(function (cur) {
-                if (!cur.left)
-                    return cur;
-                return _traverse_3.cont(cur.left);
-            });
-            return _traverse_3(node);
-        }
-    };
-    BinaryTree.prototype.getRightMost = function (node) {
-        node = node !== null && node !== void 0 ? node : this.root;
-        if (!node)
-            return node;
-        if (this._loopType === 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, trampoline_1.trampoline)(function (cur) {
-                if (!cur.right)
-                    return cur;
-                return _traverse_5.cont(cur.right);
-            });
-            return _traverse_5(node);
-        }
-    };
-    // --- start additional methods ---
-    BinaryTree.prototype.isBST = function (node) {
-        node = node !== null && node !== void 0 ? node : this.root;
-        if (!node)
-            return true;
-        if (this._loopType === 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;
-        }
-    };
-    BinaryTree.prototype.getSubTreeSizeAndCount = function (subTreeRoot) {
-        var res = [0, 0];
-        if (!subTreeRoot)
-            return res;
-        if (this._loopType === 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;
-        }
-    };
-    BinaryTree.prototype.subTreeSum = function (subTreeRoot, propertyName) {
-        propertyName = propertyName !== null && propertyName !== void 0 ? propertyName : 'val';
-        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 === 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;
-    };
-    BinaryTree.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.count += delta;
-                    break;
-                default:
-                    cur.id += delta;
-                    break;
-            }
-        };
-        if (this._loopType === 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;
-    };
-    BinaryTree.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);
-    };
-    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();
-        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);
-    };
+class BinaryTree extends abstract_binary_tree_1.AbstractBinaryTree {
     /**
-     * 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
+     * This is a constructor function for a binary tree class that takes an optional options parameter.
+     * @param {BinaryTreeOptions} [options] - The `options` parameter is an optional object that can be passed to the
+     * constructor of the `BinaryTree` class. It allows you to customize the behavior of the binary tree by providing
+     * different configuration options.
      */
-    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
-        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);
-    };
-    BinaryTree.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);
-    };
-    BinaryTree.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 === 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;
-    };
-    BinaryTree.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;
-        }
-    };
+    constructor(options) {
+        super(options);
+    }
     /**
-     * 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
+     * The function creates a new binary tree node with an optional value.
+     * @param {BinaryTreeNodeId} id - The `id` parameter is the identifier for the binary tree node. It is of type
+     * `BinaryTreeNodeId`, which represents the unique identifier for each node in the binary tree.
+     * @param [val] - The `val` parameter is an optional value that can be assigned to the node. It represents the value
+     * stored in the node.
+     * @returns a new instance of a BinaryTreeNode with the specified id and value.
      */
-    BinaryTree.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);
-    };
-    BinaryTree.prototype._resetResults = function () {
-        this._visitedId = [];
-        this._visitedVal = [];
-        this._visitedNode = [];
-        this._visitedCount = [];
-        this._visitedLeftSum = [];
-    };
-    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;
-        }
-    };
-    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;
-        }
-    };
-    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;
-}());
+    createNode(id, val) {
+        return new BinaryTreeNode(id, val);
+    }
+}
 exports.BinaryTree = BinaryTree;