avl-tree-typed 2.0.4 → 2.1.0

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

@@ -1,19 +1,30 @@
 "use strict";
+/**
+ * data-structure-typed
+ *
+ * @author Pablo Zeng
+ * @copyright Copyright (c) 2022 Pablo Zeng <zrwusa@gmail.com>
+ * @license MIT License
+ */
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.BST = exports.BSTNode = void 0;
 const binary_tree_1 = require("./binary-tree");
 const queue_1 = require("../queue");
 const utils_1 = require("../../utils");
 const common_1 = require("../../common");
+/**
+ * Represents a Node in a Binary Search Tree.
+ *
+ * @template K - The type of the key.
+ * @template V - The type of the value.
+ */
 class BSTNode extends binary_tree_1.BinaryTreeNode {
     /**
-     * This TypeScript constructor function initializes an instance with a key and an optional value.
-     * @param {K} key - The `key` parameter is typically used to uniquely identify an object or element
-     * within a data structure. It serves as a reference or identifier for accessing or manipulating the
-     * associated value.
-     * @param {V} [value] - The `value` parameter in the constructor is optional, meaning it does not
-     * have to be provided when creating an instance of the class. If a value is not provided, it will
-     * default to `undefined`.
+     * Creates an instance of BSTNode.
+     * @remarks Time O(1), Space O(1)
+     *
+     * @param key - The key of the node.
+     * @param [value] - The value associated with the key.
      */
     constructor(key, value) {
         super(key, value);
@@ -21,27 +32,55 @@ class BSTNode extends binary_tree_1.BinaryTreeNode {
         this._left = undefined;
         this._right = undefined;
     }
+    /**
+     * Gets the left child of the node.
+     * @remarks Time O(1), Space O(1)
+     *
+     * @returns The left child.
+     */
     get left() {
         return this._left;
     }
+    /**
+     * Sets the left child of the node and updates its parent reference.
+     * @remarks Time O(1), Space O(1)
+     *
+     * @param v - The node to set as the left child.
+     */
     set left(v) {
-        if (v) {
+        if (v)
             v.parent = this;
-        }
         this._left = v;
     }
+    /**
+     * Gets the right child of the node.
+     * @remarks Time O(1), Space O(1)
+     *
+     * @returns The right child.
+     */
     get right() {
         return this._right;
     }
+    /**
+     * Sets the right child of the node and updates its parent reference.
+     * @remarks Time O(1), Space O(1)
+     *
+     * @param v - The node to set as the right child.
+     */
     set right(v) {
-        if (v) {
+        if (v)
             v.parent = this;
-        }
         this._right = v;
     }
 }
 exports.BSTNode = BSTNode;
 /**
+ * Represents a Binary Search Tree (BST).
+ * Keys are ordered, allowing for faster search operations compared to a standard Binary Tree.
+ * @template K - The type of the key.
+ * @template V - The type of the value.
+ * @template R - The type of the raw data object (if using `toEntryFn`).
+ *
  * 1. Node Order: Each node's left child has a lesser value, and the right child has a greater value.
  * 2. Unique Keys: No duplicate keys in a standard BST.
  * 3. Efficient Search: Enables quick search, minimum, and maximum operations.
@@ -108,18 +147,20 @@ exports.BSTNode = BSTNode;
  */
 class BST extends binary_tree_1.BinaryTree {
     /**
-     * This TypeScript constructor initializes a binary search tree with optional options and adds
-     * elements if provided.
-     * @param keysNodesEntriesOrRaws - The `keysNodesEntriesOrRaws` parameter in the constructor is an
-     * iterable that can contain elements of type `K |  BSTNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  ` or `R`. It is used to
-     * initialize the binary search tree with keys, nodes, entries, or raw data.
-     * @param [options] - The `options` parameter is an optional object that can contain the following
-     * properties:
+     * Creates an instance of BST.
+     * @remarks Time O(N log N) or O(N^2) depending on `isBalanceAdd` in `addMany` and input order. Space O(N).
+     *
+     * @param [keysNodesEntriesOrRaws=[]] - An iterable of items to add.
+     * @param [options] - Configuration options for the BST, including comparator.
      */
     constructor(keysNodesEntriesOrRaws = [], options) {
         super([], options);
         this._root = undefined;
         this._isReverse = false;
+        /**
+         * The default comparator function.
+         * @remarks Time O(1) (or O(C) if `specifyComparable` is used, C is complexity of that function).
+         */
         this._comparator = (a, b) => {
             if ((0, utils_1.isComparable)(a) && (0, utils_1.isComparable)(b)) {
                 if (a > b)
@@ -129,14 +170,16 @@ class BST extends binary_tree_1.BinaryTree {
                 return 0;
             }
             if (this._specifyComparable) {
-                if (this._specifyComparable(a) > this._specifyComparable(b))
+                const va = this._specifyComparable(a);
+                const vb = this._specifyComparable(b);
+                if (va > vb)
                     return 1;
-                if (this._specifyComparable(a) < this._specifyComparable(b))
+                if (va < vb)
                     return -1;
                 return 0;
             }
             if (typeof a === 'object' || typeof b === 'object') {
-                throw TypeError(`When comparing object types, a custom specifyComparable must be defined in the constructor's options parameter.`);
+                throw TypeError(`When comparing object types, a custom specifyComparable must be defined in the constructor's options.`);
             }
             return 0;
         };
@@ -150,101 +193,240 @@ class BST extends binary_tree_1.BinaryTree {
         if (keysNodesEntriesOrRaws)
             this.addMany(keysNodesEntriesOrRaws);
     }
+    /**
+     * Gets the root node of the tree.
+     * @remarks Time O(1)
+     *
+     * @returns The root node.
+     */
     get root() {
         return this._root;
     }
+    /**
+     * Gets whether the tree's comparison logic is reversed.
+     * @remarks Time O(1)
+     *
+     * @returns True if the tree is reversed (e.g., a max-heap logic).
+     */
     get isReverse() {
         return this._isReverse;
     }
+    /**
+     * Gets the comparator function used by the tree.
+     * @remarks Time O(1)
+     *
+     * @returns The comparator function.
+     */
     get comparator() {
         return this._comparator;
     }
-    get specifyComparable() {
-        return this._specifyComparable;
-    }
     /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
+     * Gets the function used to extract a comparable value from a complex key.
+     * @remarks Time O(1)
      *
-     * The function creates a new BSTNode with the given key and value and returns it.
-     * @param {K} key - The key parameter is of type K, which represents the type of the key for the node
-     * being created.
-     * @param {V} [value] - The "value" parameter is an optional parameter of type V. It represents the
-     * value associated with the key in the node being created.
-     * @returns The method is returning a new instance of the BSTNode class, casted as the BSTNode<K, V> type.
+     * @returns The key-to-comparable conversion function.
      */
-    createNode(key, value) {
-        return new BSTNode(key, this._isMapMode ? undefined : value);
+    get specifyComparable() {
+        return this._specifyComparable;
     }
     /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
+     * (Protected) Creates a new BST node.
+     * @remarks Time O(1), Space O(1)
      *
-     * The function creates a new binary search tree with the specified options.
-     * @param [options] - The `options` parameter is an optional object that allows you to customize the
-     * behavior of the `createTree` method. It accepts a partial `BSTOptions` object, which has the
-     * following properties:
-     * @returns a new instance of the BST class with the provided options.
+     * @param key - The key for the new node.
+     * @param [value] - The value for the new node (used if not in Map mode).
+     * @returns The newly created BSTNode.
      */
-    createTree(options) {
-        return new BST([], Object.assign({ iterationType: this.iterationType, isMapMode: this._isMapMode, specifyComparable: this._specifyComparable, toEntryFn: this._toEntryFn, isReverse: this._isReverse }, options));
+    _createNode(key, value) {
+        return new BSTNode(key, this._isMapMode ? undefined : value);
     }
     /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(log n)
+     * Ensures the input is a node. If it's a key or entry, it searches for the node.
+     * @remarks Time O(log N) (height of the tree), O(N) worst-case.
      *
-     * The function ensures the existence of a node in a data structure and returns it, or undefined if
-     * it doesn't exist.
-     * @param {K |  BSTNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  } keyNodeOrEntry - The parameter
-     * `keyNodeOrEntry` can accept a value of type `R`, which represents the key, node,
-     * entry, or raw element that needs to be ensured in the tree.
-     * @param {IterationType} [iterationType=ITERATIVE] - The `iterationType` parameter is an optional
-     * parameter that specifies the type of iteration to be used when ensuring a node. It has a default
-     * value of `'ITERATIVE'`.
-     * @returns The method is returning either the node that was ensured or `undefined` if the node could
-     * not be ensured.
+     * @param keyNodeOrEntry - The item to resolve to a node.
+     * @param [iterationType=this.iterationType] - The traversal method to use if searching.
+     * @returns The resolved node, or undefined if not found.
      */
     ensureNode(keyNodeOrEntry, iterationType = this.iterationType) {
         var _a;
         return (_a = super.ensureNode(keyNodeOrEntry, iterationType)) !== null && _a !== void 0 ? _a : undefined;
     }
     /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
+     * Checks if the given item is a `BSTNode` instance.
+     * @remarks Time O(1), Space O(1)
      *
-     * The function checks if the input is an instance of the BSTNode class.
-     * @param {K |  BSTNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  } keyNodeOrEntry - The parameter
-     * `keyNodeOrEntry` can be of type `R` or `K |  BSTNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  `.
-     * @returns a boolean value indicating whether the input parameter `keyNodeOrEntry` is
-     * an instance of the `BSTNode` class.
+     * @param keyNodeOrEntry - The item to check.
+     * @returns True if it's a BSTNode, false otherwise.
      */
     isNode(keyNodeOrEntry) {
         return keyNodeOrEntry instanceof BSTNode;
     }
     /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
+     * Checks if the given key is valid (comparable).
+     * @remarks Time O(1)
      *
-     * The function "override isValidKey" checks if a key is comparable based on a given comparator.
-     * @param {any} key - The `key` parameter is a value that will be checked to determine if it is of
-     * type `K`.
-     * @returns The `override isValidKey(key: any): key is K` function is returning a boolean value based on
-     * the result of the `isComparable` function with the condition `this._compare !==
-     * this._DEFAULT_COMPARATOR`.
+     * @param key - The key to validate.
+     * @returns True if the key is valid, false otherwise.
      */
     isValidKey(key) {
         return (0, utils_1.isComparable)(key, this._specifyComparable !== undefined);
     }
     /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(log n)
+     * Performs a Depth-First Search (DFS) traversal.
+     * @remarks Time O(N), visits every node. Space O(log N) for the call/explicit stack. O(N) worst-case.
+     *
+     * @template C - The type of the callback function.
+     * @param [callback=this._DEFAULT_NODE_CALLBACK] - Function to call on each node.
+     * @param [pattern='IN'] - The traversal order ('IN', 'PRE', 'POST').
+     * @param [onlyOne=false] - If true, stops after the first callback.
+     * @param [startNode=this._root] - The node to start from.
+     * @param [iterationType=this.iterationType] - The traversal method.
+     * @returns An array of callback results.
+     */
+    dfs(callback = this._DEFAULT_NODE_CALLBACK, pattern = 'IN', onlyOne = false, startNode = this._root, iterationType = this.iterationType) {
+        return super.dfs(callback, pattern, onlyOne, startNode, iterationType);
+    }
+    /**
+     * Performs a Breadth-First Search (BFS) or Level-Order traversal.
+     * @remarks Time O(N), visits every node. Space O(N) in the worst case for the queue.
+     *
+     * @template C - The type of the callback function.
+     * @param [callback=this._DEFAULT_NODE_CALLBACK] - Function to call on each node.
+     * @param [startNode=this._root] - The node to start from.
+     * @param [iterationType=this.iterationType] - The traversal method.
+     * @returns An array of callback results.
+     */
+    bfs(callback = this._DEFAULT_NODE_CALLBACK, startNode = this._root, iterationType = this.iterationType) {
+        return super.bfs(callback, startNode, iterationType, false);
+    }
+    /**
+     * Returns a 2D array of nodes, grouped by level.
+     * @remarks Time O(N), visits every node. Space O(N) for the result array and the queue/stack.
+     *
+     * @template C - The type of the callback function.
+     * @param [callback=this._DEFAULT_NODE_CALLBACK] - Function to call on each node.
+     * @param [startNode=this._root] - The node to start from.
+     * @param [iterationType=this.iterationType] - The traversal method.
+     * @returns A 2D array of callback results.
+     */
+    listLevels(callback = this._DEFAULT_NODE_CALLBACK, startNode = this._root, iterationType = this.iterationType) {
+        return super.listLevels(callback, startNode, iterationType, false);
+    }
+    /**
+     * Gets the first node matching a predicate.
+     * @remarks Time O(log N) if searching by key, O(N) if searching by predicate. Space O(log N) or O(N).
+     *
+     * @param keyNodeEntryOrPredicate - The key, node, entry, or predicate function to search for.
+     * @param [startNode=this._root] - The node to start the search from.
+     * @param [iterationType=this.iterationType] - The traversal method.
+     * @returns The first matching node, or undefined if not found.
+     */
+    getNode(keyNodeEntryOrPredicate, startNode = this._root, iterationType = this.iterationType) {
+        var _a;
+        return (_a = this.getNodes(keyNodeEntryOrPredicate, true, startNode, iterationType)[0]) !== null && _a !== void 0 ? _a : undefined;
+    }
+    /**
+     * Searches the tree for nodes matching a predicate, key, or range.
+     * @remarks This is an optimized search for a BST. If searching by key or range, it prunes branches.
+     * Time O(H + M) for key/range search (H=height, M=matches). O(N) for predicate search.
+     * Space O(log N) for the stack.
+     *
+     * @template C - The type of the callback function.
+     * @param keyNodeEntryOrPredicate - The key, node, entry, predicate, or range to search for.
+     * @param [onlyOne=false] - If true, stops after finding the first match.
+     * @param [callback=this._DEFAULT_NODE_CALLBACK] - A function to call on matching nodes.
+     * @param [startNode=this._root] - The node to start the search from.
+     * @param [iterationType=this.iterationType] - Whether to use 'RECURSIVE' or 'ITERATIVE' search.
+     * @returns An array of results from the callback function for each matching node.
+     */
+    search(keyNodeEntryOrPredicate, onlyOne = false, callback = this._DEFAULT_NODE_CALLBACK, startNode = this._root, iterationType = this.iterationType) {
+        if (keyNodeEntryOrPredicate === undefined)
+            return [];
+        if (keyNodeEntryOrPredicate === null)
+            return [];
+        startNode = this.ensureNode(startNode);
+        if (!startNode)
+            return [];
+        let predicate;
+        const isRange = this.isRange(keyNodeEntryOrPredicate);
+        if (isRange) {
+            predicate = node => {
+                if (!node)
+                    return false;
+                return keyNodeEntryOrPredicate.isInRange(node.key, this._comparator);
+            };
+        }
+        else {
+            predicate = this._ensurePredicate(keyNodeEntryOrPredicate);
+        }
+        // Optimization: Pruning logic
+        const shouldVisitLeft = (cur) => {
+            if (!cur)
+                return false;
+            if (!this.isRealNode(cur.left))
+                return false;
+            if (isRange) {
+                // Range search: Only go left if the current key is >= the lower bound
+                const range = keyNodeEntryOrPredicate;
+                const leftS = this.isReverse ? range.high : range.low;
+                const leftI = this.isReverse ? range.includeHigh : range.includeLow;
+                return (leftI && this._compare(cur.key, leftS) >= 0) || (!leftI && this._compare(cur.key, leftS) > 0);
+            }
+            if (!isRange && !this._isPredicate(keyNodeEntryOrPredicate)) {
+                // Key search: Only go left if current key > target key
+                const benchmarkKey = this._extractKey(keyNodeEntryOrPredicate);
+                return benchmarkKey !== null && benchmarkKey !== undefined && this._compare(cur.key, benchmarkKey) > 0;
+            }
+            return true; // Predicate search: must visit all
+        };
+        const shouldVisitRight = (cur) => {
+            if (!cur)
+                return false;
+            if (!this.isRealNode(cur.right))
+                return false;
+            if (isRange) {
+                // Range search: Only go right if current key <= upper bound
+                const range = keyNodeEntryOrPredicate;
+                const rightS = this.isReverse ? range.low : range.high;
+                const rightI = this.isReverse ? range.includeLow : range.includeHigh;
+                return (rightI && this._compare(cur.key, rightS) <= 0) || (!rightI && this._compare(cur.key, rightS) < 0);
+            }
+            if (!isRange && !this._isPredicate(keyNodeEntryOrPredicate)) {
+                // Key search: Only go right if current key < target key
+                const benchmarkKey = this._extractKey(keyNodeEntryOrPredicate);
+                return benchmarkKey !== null && benchmarkKey !== undefined && this._compare(cur.key, benchmarkKey) < 0;
+            }
+            return true; // Predicate search: must visit all
+        };
+        return super._dfs(callback, 'IN', // In-order is efficient for range/key search
+        onlyOne, startNode, iterationType, false, shouldVisitLeft, shouldVisitRight, () => true, // shouldVisitRoot (always visit)
+        // shouldVisitRoot (always visit)
+        cur => !!cur && predicate(cur) // shouldProcessRoot (only process if predicate matches)
+        );
+    }
+    /**
+     * Performs an optimized search for nodes within a given key range.
+     * @remarks Time O(H + M), where H is tree height and M is the number of matches.
      *
-     * The `add` function in TypeScript adds a new node to a binary search tree based on the key value.
-     * @param {K |  BSTNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  } keyNodeOrEntry - The parameter
-     * `keyNodeOrEntry` can accept a value of type `R` or `K |  BSTNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  `.
-     * @param {V} [value] - The `value` parameter is an optional value that can be associated with the
-     * key in the binary search tree. If provided, it will be stored in the node along with the key.
-     * @returns a boolean value.
+     * @template C - The type of the callback function.
+     * @param range - A `Range` object or a `[low, high]` tuple.
+     * @param [callback=this._DEFAULT_NODE_CALLBACK] - A function to call on matching nodes.
+     * @param [startNode=this._root] - The node to start the search from.
+     * @param [iterationType=this.iterationType] - The traversal method.
+     * @returns An array of callback results.
+     */
+    rangeSearch(range, callback = this._DEFAULT_NODE_CALLBACK, startNode = this._root, iterationType = this.iterationType) {
+        const searchRange = range instanceof common_1.Range ? range : new common_1.Range(range[0], range[1]);
+        return this.search(searchRange, false, callback, startNode, iterationType);
+    }
+    /**
+     * Adds a new node to the BST based on key comparison.
+     * @remarks Time O(log N), where H is tree height. O(N) worst-case (unbalanced tree), O(log N) average. Space O(1).
+     *
+     * @param keyNodeOrEntry - The key, node, or entry to add.
+     * @param [value] - The value, if providing just a key.
+     * @returns True if the addition was successful, false otherwise.
      */
     add(keyNodeOrEntry, value) {
         const [newNode, newValue] = this._keyValueNodeOrEntryToNodeAndValue(keyNodeOrEntry, value);
@@ -260,12 +442,14 @@ class BST extends binary_tree_1.BinaryTree {
         let current = this._root;
         while (current !== undefined) {
             if (this._compare(current.key, newNode.key) === 0) {
+                // Key exists, replace node
                 this._replaceNode(current, newNode);
                 if (this._isMapMode)
                     this._setValue(current.key, newValue);
                 return true;
             }
             else if (this._compare(current.key, newNode.key) > 0) {
+                // Go left
                 if (current.left === undefined) {
                     current.left = newNode;
                     if (this._isMapMode)
@@ -277,6 +461,7 @@ class BST extends binary_tree_1.BinaryTree {
                     current = current.left;
             }
             else {
+                // Go right
                 if (current.right === undefined) {
                     current.right = newNode;
                     if (this._isMapMode)
@@ -291,49 +476,38 @@ class BST extends binary_tree_1.BinaryTree {
         return false;
     }
     /**
-     * Time Complexity: O(k log n)
-     * Space Complexity: O(k + log n)
-     *
-     * The `addMany` function in TypeScript adds multiple keys or nodes to a data structure and returns
-     * an array indicating whether each key or node was successfully inserted.
-     * @param keysNodesEntriesOrRaws - An iterable containing keys, nodes, entries, or raw
-     * elements to be added to the data structure.
-     * @param [values] - An optional iterable of values to be associated with the keys or nodes being
-     * added. If provided, the values will be assigned to the corresponding keys or nodes in the same
-     * order. If not provided, undefined will be assigned as the value for each key or node.
-     * @param [isBalanceAdd=true] - A boolean flag indicating whether the tree should be balanced after
-     * adding the elements. If set to true, the tree will be balanced using a binary search tree
-     * algorithm. If set to false, the elements will be added without balancing the tree. The default
-     * value is true.
-     * @param {IterationType} iterationType - The `iterationType` parameter is an optional parameter that
-     * specifies the type of iteration to use when adding multiple keys or nodes to the binary search
-     * tree. It can have two possible values:
-     * @returns The function `addMany` returns an array of booleans indicating whether each element was
-     * successfully inserted into the data structure.
+     * Adds multiple items to the tree.
+     * @remarks If `isBalanceAdd` is true, sorts the input and builds a balanced tree. Time O(N log N) (due to sort and balanced add).
+     * If false, adds items one by one. Time O(N * H), which is O(N^2) worst-case.
+     * Space O(N) for sorting and recursion/iteration stack.
+     *
+     * @param keysNodesEntriesOrRaws - An iterable of items to add.
+     * @param [values] - An optional parallel iterable of values.
+     * @param [isBalanceAdd=true] - If true, builds a balanced tree from the items.
+     * @param [iterationType=this.iterationType] - The traversal method for balanced add (recursive or iterative).
+     * @returns An array of booleans indicating the success of each individual `add` operation.
      */
     addMany(keysNodesEntriesOrRaws, values, isBalanceAdd = true, iterationType = this.iterationType) {
         const inserted = [];
-        let valuesIterator;
-        if (values) {
-            valuesIterator = values[Symbol.iterator]();
-        }
+        const valuesIterator = values === null || values === void 0 ? void 0 : values[Symbol.iterator]();
         if (!isBalanceAdd) {
+            // Standard O(N*H) insertion
             for (let kve of keysNodesEntriesOrRaws) {
-                const value = valuesIterator === null || valuesIterator === void 0 ? void 0 : valuesIterator.next().value;
+                const val = valuesIterator === null || valuesIterator === void 0 ? void 0 : valuesIterator.next().value;
                 if (this.isRaw(kve))
                     kve = this._toEntryFn(kve);
-                inserted.push(this.add(kve, value));
+                inserted.push(this.add(kve, val));
             }
             return inserted;
         }
+        // Balanced O(N log N) insertion
         const realBTNExemplars = [];
         let i = 0;
         for (const kve of keysNodesEntriesOrRaws) {
-            realBTNExemplars.push({ key: kve, value: valuesIterator === null || valuesIterator === void 0 ? void 0 : valuesIterator.next().value, orgIndex: i });
-            i++;
+            realBTNExemplars.push({ key: kve, value: valuesIterator === null || valuesIterator === void 0 ? void 0 : valuesIterator.next().value, orgIndex: i++ });
         }
-        let sorted = [];
-        sorted = realBTNExemplars.sort(({ key: a }, { key: b }) => {
+        // Sort items by key
+        const sorted = realBTNExemplars.sort(({ key: a }, { key: b }) => {
             let keyA, keyB;
             if (this.isRaw(a))
                 keyA = this._toEntryFn(a)[0];
@@ -341,29 +515,26 @@ class BST extends binary_tree_1.BinaryTree {
                 keyA = a[0];
             else if (this.isRealNode(a))
                 keyA = a.key;
-            else {
+            else
                 keyA = a;
-            }
             if (this.isRaw(b))
                 keyB = this._toEntryFn(b)[0];
             else if (this.isEntry(b))
                 keyB = b[0];
             else if (this.isRealNode(b))
                 keyB = b.key;
-            else {
+            else
                 keyB = b;
-            }
-            if (keyA !== undefined && keyA !== null && keyB !== undefined && keyB !== null) {
+            if (keyA != null && keyB != null)
                 return this._compare(keyA, keyB);
-            }
             return 0;
         });
+        // Recursive balanced build
         const _dfs = (arr) => {
             if (arr.length === 0)
                 return;
             const mid = Math.floor((arr.length - 1) / 2);
-            const { key, value } = arr[mid];
-            const { orgIndex } = arr[mid];
+            const { key, value, orgIndex } = arr[mid];
             if (this.isRaw(key)) {
                 const entry = this._toEntryFn(key);
                 inserted[orgIndex] = this.add(entry);
@@ -374,281 +545,58 @@ class BST extends binary_tree_1.BinaryTree {
             _dfs(arr.slice(0, mid));
             _dfs(arr.slice(mid + 1));
         };
+        // Iterative balanced build
         const _iterate = () => {
             const n = sorted.length;
             const stack = [[0, n - 1]];
             while (stack.length > 0) {
                 const popped = stack.pop();
-                if (popped) {
-                    const [l, r] = popped;
-                    if (l <= r) {
-                        const m = l + Math.floor((r - l) / 2);
-                        const { key, value } = sorted[m];
-                        const { orgIndex } = sorted[m];
-                        if (this.isRaw(key)) {
-                            const entry = this._toEntryFn(key);
-                            inserted[orgIndex] = this.add(entry);
-                        }
-                        else {
-                            inserted[orgIndex] = this.add(key, value);
-                        }
-                        stack.push([m + 1, r]);
-                        stack.push([l, m - 1]);
-                    }
+                if (!popped)
+                    continue;
+                const [l, r] = popped;
+                if (l > r)
+                    continue;
+                const m = l + Math.floor((r - l) / 2);
+                const { key, value, orgIndex } = sorted[m];
+                if (this.isRaw(key)) {
+                    const entry = this._toEntryFn(key);
+                    inserted[orgIndex] = this.add(entry);
                 }
+                else {
+                    inserted[orgIndex] = this.add(key, value);
+                }
+                stack.push([m + 1, r]);
+                stack.push([l, m - 1]);
             }
         };
-        if (iterationType === 'RECURSIVE') {
+        if (iterationType === 'RECURSIVE')
             _dfs(sorted);
-        }
-        else {
+        else
             _iterate();
-        }
         return inserted;
     }
     /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(k + log n)
-     *
-     * The function `search` in TypeScript overrides the search behavior in a binary tree structure based
-     * on specified criteria.
-     * @param {K |  BSTNode<K, V> | [K | null | undefined, V | undefined] | null | undefined   | NodePredicate<BSTNode<K, V>>} keyNodeEntryOrPredicate - The
-     * `keyNodeEntryOrPredicate` parameter in the `override search` method can accept one of the
-     * following types:
-     * @param [onlyOne=false] - The `onlyOne` parameter is a boolean flag that determines whether the
-     * search should stop after finding the first matching node. If `onlyOne` is set to `true`, the
-     * search will return as soon as a matching node is found. If `onlyOne` is set to `false`, the
-     * @param {C} callback - The `callback` parameter in the `override search` function is a function
-     * that will be called on each node that matches the search criteria. It is of type `C`, which
-     * extends `NodeCallback<BSTNode<K, V> | null>`. The callback function should accept a node of type `BSTNode<K, V>` as its
-     * argument and
-     * @param {K |  BSTNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  } startNode - The `startNode` parameter in the `override search`
-     * method represents the node from which the search operation will begin. It is the starting point
-     * for searching within the tree data structure. The method ensures that the `startNode` is a valid
-     * node before proceeding with the search operation. If the `
-     * @param {IterationType} iterationType - The `iterationType` parameter in the `override search`
-     * function determines the type of iteration to be used during the search operation. It can have two
-     * possible values:
-     * @returns The `override search` method returns an array of values that match the search criteria
-     * specified by the input parameters. The method performs a search operation on a binary tree
-     * structure based on the provided key, predicate, and other options. The search results are
-     * collected in an array and returned as the output of the method.
-     */
-    search(keyNodeEntryOrPredicate, onlyOne = false, callback = this._DEFAULT_NODE_CALLBACK, startNode = this._root, iterationType = this.iterationType) {
-        if (keyNodeEntryOrPredicate === undefined)
-            return [];
-        if (keyNodeEntryOrPredicate === null)
-            return [];
-        startNode = this.ensureNode(startNode);
-        if (!startNode)
-            return [];
-        let predicate;
-        const isRange = this.isRange(keyNodeEntryOrPredicate);
-        // Set predicate based on parameter type
-        if (isRange) {
-            predicate = node => {
-                if (!node)
-                    return false;
-                return keyNodeEntryOrPredicate.isInRange(node.key, this._comparator);
-            };
-        }
-        else {
-            predicate = this._ensurePredicate(keyNodeEntryOrPredicate);
-        }
-        const shouldVisitLeft = (cur) => {
-            if (!cur)
-                return false;
-            if (!this.isRealNode(cur.left))
-                return false;
-            if (isRange) {
-                const range = keyNodeEntryOrPredicate;
-                const leftS = this.isReverse ? range.high : range.low;
-                const leftI = this.isReverse ? range.includeHigh : range.includeLow;
-                return (leftI && this._compare(cur.key, leftS) >= 0) || (!leftI && this._compare(cur.key, leftS) > 0);
-            }
-            if (!isRange && !this._isPredicate(keyNodeEntryOrPredicate)) {
-                const benchmarkKey = this._extractKey(keyNodeEntryOrPredicate);
-                return benchmarkKey !== null && benchmarkKey !== undefined && this._compare(cur.key, benchmarkKey) > 0;
-            }
-            return true;
-        };
-        const shouldVisitRight = (cur) => {
-            if (!cur)
-                return false;
-            if (!this.isRealNode(cur.right))
-                return false;
-            if (isRange) {
-                const range = keyNodeEntryOrPredicate;
-                const rightS = this.isReverse ? range.low : range.high;
-                const rightI = this.isReverse ? range.includeLow : range.includeLow;
-                return (rightI && this._compare(cur.key, rightS) <= 0) || (!rightI && this._compare(cur.key, rightS) < 0);
-            }
-            if (!isRange && !this._isPredicate(keyNodeEntryOrPredicate)) {
-                const benchmarkKey = this._extractKey(keyNodeEntryOrPredicate);
-                return benchmarkKey !== null && benchmarkKey !== undefined && this._compare(cur.key, benchmarkKey) < 0;
-            }
-            return true;
-        };
-        return super._dfs(callback, 'IN', onlyOne, startNode, iterationType, false, shouldVisitLeft, shouldVisitRight, () => true, cur => {
-            if (cur)
-                return predicate(cur);
-            return false;
-        });
-    }
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(k + log n)
-     *
-     * The `rangeSearch` function searches for nodes within a specified range in a binary search tree.
-     * @param {Range<K> | [K, K]} range - The `range` parameter in the `rangeSearch` function can be
-     * either a `Range` object or an array of two elements representing the range boundaries.
-     * @param {C} callback - The `callback` parameter in the `rangeSearch` function is a callback
-     * function that is used to process each node that is found within the specified range during the
-     * search operation. It is of type `NodeCallback<BSTNode<K, V> | null>`, where `BSTNode<K, V>` is the type of nodes in the
-     * data structure.
-     * @param {K |  BSTNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  } startNode - The `startNode` parameter in the `rangeSearch`
-     * function represents the node from which the search for nodes within the specified range will
-     * begin. It is the starting point for the range search operation.
-     * @param {IterationType} iterationType - The `iterationType` parameter in the `rangeSearch` function
-     * is used to specify the type of iteration to be performed during the search operation. It has a
-     * default value of `this.iterationType`, which suggests that it is likely a property of the class or
-     * object that the `rangeSearch`
-     * @returns The `rangeSearch` function is returning the result of calling the `search` method with
-     * the specified parameters.
-     */
-    rangeSearch(range, callback = this._DEFAULT_NODE_CALLBACK, startNode = this._root, iterationType = this.iterationType) {
-        const searchRange = range instanceof common_1.Range ? range : new common_1.Range(range[0], range[1]);
-        return this.search(searchRange, false, callback, startNode, iterationType);
-    }
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(log n)
-     *
-     * This function retrieves a node based on a given keyNodeEntryOrPredicate within a binary search tree structure.
-     * @param {K |  BSTNode<K, V> | [K | null | undefined, V | undefined] | null | undefined   | NodePredicate<BSTNode<K, V>>} keyNodeEntryOrPredicate - The `keyNodeEntryOrPredicate`
-     * parameter can be of type `K |  BSTNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  `, `R`, or `NodePredicate<BSTNode<K, V>>`.
-     * @param {BSTNOptKeyOrNode<K, BSTNode<K, V>>} startNode - The `startNode` parameter in the `getNode` method
-     * is used to specify the starting point for searching nodes in the binary search tree. If no
-     * specific starting point is provided, the default value is set to `this._root`, which is the root
-     * node of the binary search tree.
-     * @param {IterationType} iterationType - The `iterationType` parameter in the `getNode` method is a
-     * parameter that specifies the type of iteration to be used. It has a default value of
-     * `this.iterationType`, which means it will use the iteration type defined in the class instance if
-     * no value is provided when calling the method.
-     * @returns The `getNode` method is returning an optional binary search tree node (`OptNode<BSTNode<K, V>>`).
-     * It is using the `getNodes` method to find the node based on the provided keyNodeEntryOrPredicate, beginning at
-     * the specified root node (`startNode`) and using the specified iteration type. The method then
-     * returns the first node found or `undefined` if no node is found.
-     */
-    getNode(keyNodeEntryOrPredicate, startNode = this._root, iterationType = this.iterationType) {
-        var _a;
-        return (_a = this.getNodes(keyNodeEntryOrPredicate, true, startNode, iterationType)[0]) !== null && _a !== void 0 ? _a : undefined;
-    }
-    /**
-     * Time complexity: O(n)
-     * Space complexity: O(n)
-     *
-     * The function `dfs` in TypeScript overrides the base class method with default parameters and
-     * returns the result of the super class `dfs` method.
-     * @param {C} callback - The `callback` parameter is a function that will be called for each node
-     * visited during the Depth-First Search traversal. It is a generic type `C` that extends the
-     * `NodeCallback` interface for `BSTNode<K, V>`. The default value for `callback` is `this._
-     * @param {DFSOrderPattern} [pattern=IN] - The `pattern` parameter in the `override dfs` method
-     * specifies the order in which the Depth-First Search (DFS) traversal should be performed on the
-     * Binary Search Tree (BST). The possible values for the `pattern` parameter are:
-     * @param {boolean} [onlyOne=false] - The `onlyOne` parameter in the `override dfs` method is a
-     * boolean flag that indicates whether you want to stop the depth-first search traversal after
-     * finding the first matching node or continue searching for all matching nodes. If `onlyOne` is set
-     * to `true`, the traversal will stop after finding
-     * @param {K | BSTNode<K, V> | [K | null | undefined, V | undefined] | null | undefined} startNode -
-     * The `startNode` parameter in the `override dfs` method can be one of the following types:
-     * @param {IterationType} iterationType - The `iterationType` parameter in the `override dfs` method
-     * specifies the type of iteration to be performed during the Depth-First Search (DFS) traversal of a
-     * Binary Search Tree (BST). It is used to determine the order in which nodes are visited during the
-     * traversal. The possible values for `
-     * @returns The `override` function is returning the result of calling the `dfs` method from the
-     * superclass, with the provided arguments `callback`, `pattern`, `onlyOne`, `startNode`, and
-     * `iterationType`. The return type is an array of the return type of the callback function `C`.
-     */
-    dfs(callback = this._DEFAULT_NODE_CALLBACK, pattern = 'IN', onlyOne = false, startNode = this._root, iterationType = this.iterationType) {
-        return super.dfs(callback, pattern, onlyOne, startNode, iterationType);
-    }
-    /**
-     * Time complexity: O(n)
-     * Space complexity: O(n)
-     *
-     * The function overrides the breadth-first search method and returns an array of the return types of
-     * the callback function.
-     * @param {C} callback - The `callback` parameter is a function that will be called for each node
-     * visited during the breadth-first search. It should take a single argument, which is the current
-     * node being visited, and it can return a value of any type.
-     * @param {K |  BSTNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  } startNode - The `startNode` parameter is the starting
-     * point for the breadth-first search. It can be either a root node, a key-value pair, or an entry
-     * object. If no value is provided, the default value is the root of the tree.
-     * @param {IterationType} iterationType - The `iterationType` parameter is used to specify the type
-     * of iteration to be performed during the breadth-first search (BFS) traversal. It can have one of
-     * the following values:
-     * @returns an array of the return type of the callback function.
-     */
-    bfs(callback = this._DEFAULT_NODE_CALLBACK, startNode = this._root, iterationType = this.iterationType) {
-        return super.bfs(callback, startNode, iterationType, false);
-    }
-    /**
-     * Time complexity: O(n)
-     * Space complexity: O(n)
+     * Traverses the tree and returns nodes that are lesser or greater than a target node.
+     * @remarks Time O(N), as it performs a full traversal. Space O(log N) or O(N).
      *
-     * The function overrides the listLevels method from the superclass and returns an array of arrays
-     * containing the results of the callback function applied to each level of the tree.
-     * @param {C} callback - The `callback` parameter is a generic type `C` that extends
-     * `NodeCallback<BSTNode<K, V> | null>`. It represents a callback function that will be called for each node in the
-     * tree during the iteration process.
-     * @param {K |  BSTNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  } startNode - The `startNode` parameter is the starting
-     * point for listing the levels of the binary tree. It can be either a root node of the tree, a
-     * key-value pair representing a node in the tree, or a key representing a node in the tree. If no
-     * value is provided, the root of
-     * @param {IterationType} iterationType - The `iterationType` parameter is used to specify the type
-     * of iteration to be performed on the tree. It can have one of the following values:
-     * @returns The method is returning a two-dimensional array of the return type of the callback
-     * function.
-     */
-    listLevels(callback = this._DEFAULT_NODE_CALLBACK, startNode = this._root, iterationType = this.iterationType) {
-        return super.listLevels(callback, startNode, iterationType, false);
-    }
-    /**
-     * Time complexity: O(n)
-     * Space complexity: O(n)
-     *
-     * The `lesserOrGreaterTraverse` function traverses a binary tree and applies a callback function to
-     * each node that meets a certain condition based on a target node and a comparison value.
-     * @param {C} callback - The `callback` parameter is a function that will be called for each node
-     * that meets the condition specified by the `lesserOrGreater` parameter. It takes a single argument,
-     * which is the current node being traversed, and returns a value of any type.
-     * @param {CP} lesserOrGreater - The `lesserOrGreater` parameter is used to determine whether to
-     * traverse nodes that are lesser, greater, or both than the `targetNode`. It accepts the values -1,
-     * 0, or 1, where:
-     * @param {K |  BSTNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  } targetNode - The `targetNode` parameter is the node in
-     * the binary tree that you want to start traversing from. It can be specified either by providing
-     * the key of the node, the node itself, or an entry containing the key and value of the node. If no
-     * `targetNode` is provided,
-     * @param {IterationType} iterationType - The `iterationType` parameter determines the type of
-     * traversal to be performed on the binary tree. It can have two possible values:
-     * @returns The function `lesserOrGreaterTraverse` returns an array of values of type
-     * `ReturnType<C>`, which is the return type of the callback function passed as an argument.
+     * @template C - The type of the callback function.
+     * @param [callback=this._DEFAULT_NODE_CALLBACK] - Function to call on matching nodes.
+     * @param [lesserOrGreater=-1] - -1 for lesser, 1 for greater, 0 for equal.
+     * @param [targetNode=this._root] - The node to compare against.
+     * @param [iterationType=this.iterationType] - The traversal method.
+     * @returns An array of callback results.
      */
     lesserOrGreaterTraverse(callback = this._DEFAULT_NODE_CALLBACK, lesserOrGreater = -1, targetNode = this._root, iterationType = this.iterationType) {
         const targetNodeEnsured = this.ensureNode(targetNode);
         const ans = [];
-        if (!this._root)
-            return ans;
-        if (!targetNodeEnsured)
+        if (!this._root || !targetNodeEnsured)
             return ans;
         const targetKey = targetNodeEnsured.key;
         if (iterationType === 'RECURSIVE') {
             const dfs = (cur) => {
                 const compared = this._compare(cur.key, targetKey);
-                if (Math.sign(compared) === lesserOrGreater)
+                if (Math.sign(compared) == lesserOrGreater)
                     ans.push(callback(cur));
-                // TODO here can be optimized to O(log n)
                 if (this.isRealNode(cur.left))
                     dfs(cur.left);
                 if (this.isRealNode(cur.right))
@@ -663,7 +611,7 @@ class BST extends binary_tree_1.BinaryTree {
                 const cur = queue.shift();
                 if (this.isRealNode(cur)) {
                     const compared = this._compare(cur.key, targetKey);
-                    if (Math.sign(compared) === lesserOrGreater)
+                    if (Math.sign(compared) == lesserOrGreater)
                         ans.push(callback(cur));
                     if (this.isRealNode(cur.left))
                         queue.push(cur.left);
@@ -675,80 +623,54 @@ class BST extends binary_tree_1.BinaryTree {
         }
     }
     /**
-     * Time complexity: O(n)
-     * Space complexity: O(n)
+     * Rebuilds the tree to be perfectly balanced.
+     * @remarks Time O(N) (O(N) for DFS, O(N) for sorted build). Space O(N) for node array and recursion stack.
      *
-     * The `perfectlyBalance` function takes an optional `iterationType` parameter and returns `true` if
-     * the binary search tree is perfectly balanced, otherwise it returns `false`.
-     * @param {IterationType} iterationType - The `iterationType` parameter is an optional parameter that
-     * specifies the type of iteration to use when building a balanced binary search tree. It has a
-     * default value of `this.iterationType`, which means it will use the iteration type specified in the
-     * current instance of the class.
-     * @returns The function `perfectlyBalance` returns a boolean value.
+     * @param [iterationType=this.iterationType] - The traversal method for the initial node export.
+     * @returns True if successful, false if the tree was empty.
      */
     perfectlyBalance(iterationType = this.iterationType) {
-        const sorted = this.dfs(node => node, 'IN'), n = sorted.length;
+        const nodes = this.dfs(node => node, 'IN', false, this._root, iterationType);
+        const n = nodes.length;
         this._clearNodes();
-        if (sorted.length < 1)
+        if (n === 0)
             return false;
-        if (iterationType === 'RECURSIVE') {
-            const buildBalanceBST = (l, r) => {
-                if (l > r)
-                    return;
-                const m = l + Math.floor((r - l) / 2);
-                const midNode = sorted[m];
-                if (this._isMapMode && midNode !== null)
-                    this.add(midNode.key);
-                else if (midNode !== null)
-                    this.add([midNode.key, midNode.value]);
-                buildBalanceBST(l, m - 1);
-                buildBalanceBST(m + 1, r);
-            };
-            buildBalanceBST(0, n - 1);
-            return true;
-        }
-        else {
-            const stack = [[0, n - 1]];
-            while (stack.length > 0) {
-                const popped = stack.pop();
-                if (popped) {
-                    const [l, r] = popped;
-                    if (l <= r) {
-                        const m = l + Math.floor((r - l) / 2);
-                        const midNode = sorted[m];
-                        if (this._isMapMode && midNode !== null)
-                            this.add(midNode.key);
-                        else if (midNode !== null)
-                            this.add([midNode.key, midNode.value]);
-                        stack.push([m + 1, r]);
-                        stack.push([l, m - 1]);
-                    }
-                }
-            }
-            return true;
-        }
+        // Build balanced tree from sorted array
+        const build = (l, r, parent) => {
+            if (l > r)
+                return undefined;
+            const m = l + ((r - l) >> 1);
+            const root = nodes[m];
+            const leftChild = build(l, m - 1, root);
+            const rightChild = build(m + 1, r, root);
+            root.left = leftChild;
+            root.right = rightChild;
+            root.parent = parent;
+            return root;
+        };
+        const newRoot = build(0, n - 1, undefined);
+        this._setRoot(newRoot);
+        this._size = n;
+        return true;
     }
     /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(log n)
+     * Checks if the tree meets the AVL balance condition (height difference <= 1).
+     * @remarks Time O(N), as it must visit every node to compute height. Space O(log N) for recursion or O(N) for iterative map.
      *
-     * The function `isAVLBalanced` checks if a binary tree is AVL balanced using either a recursive or
-     * iterative approach.
-     * @param {IterationType} iterationType - The `iterationType` parameter is an optional parameter that
-     * specifies the type of iteration to use when checking if the AVL tree is balanced. It has a default
-     * value of `this.iterationType`, which means it will use the iteration type specified in the current
-     * instance of the AVL tree.
-     * @returns a boolean value.
+     * @param [iterationType=this.iterationType] - The traversal method.
+     * @returns True if the tree is AVL balanced, false otherwise.
      */
     isAVLBalanced(iterationType = this.iterationType) {
         if (!this._root)
             return true;
         let balanced = true;
         if (iterationType === 'RECURSIVE') {
+            // Recursive height check
             const _height = (cur) => {
                 if (!cur)
                     return 0;
-                const leftHeight = _height(cur.left), rightHeight = _height(cur.right);
+                const leftHeight = _height(cur.left);
+                const rightHeight = _height(cur.right);
                 if (Math.abs(leftHeight - rightHeight) > 1)
                     balanced = false;
                 return Math.max(leftHeight, rightHeight) + 1;
@@ -756,6 +678,7 @@ class BST extends binary_tree_1.BinaryTree {
             _height(this._root);
         }
         else {
+            // Iterative post-order height check
             const stack = [];
             let node = this._root, last = undefined;
             const depths = new Map();
@@ -787,93 +710,194 @@ class BST extends binary_tree_1.BinaryTree {
         return balanced;
     }
     /**
-     * Time complexity: O(n)
-     * Space complexity: O(n)
-     *
-     * The `map` function in TypeScript overrides the default map behavior for a binary search tree by
-     * applying a callback function to each entry and creating a new tree with the results.
-     * @param callback - A function that will be called for each entry in the BST. It takes four
-     * arguments: the key, the value (which can be undefined), the index of the entry, and a reference to
-     * the BST itself.
-     * @param [options] - The `options` parameter in the `override map` method is of type `BSTOptions<MK,
-     * MV, MR>`. It is an optional parameter that allows you to specify additional options for the Binary
-     * Search Tree (BST) being created in the `map` method. These options could include configuration
-     * @param {any} [thisArg] - The `thisArg` parameter in the `override map` method is used to specify
-     * the value of `this` that should be used when executing the `callback` function. It allows you to
-     * set the context or scope in which the callback function will be called. This can be useful when
-     * you want
-     * @returns The `map` method is returning a new Binary Search Tree (`BST`) instance with the entries
-     * transformed by the provided callback function.
+     * Creates a new BST by mapping each [key, value] pair to a new entry.
+     * @remarks Time O(N * H), where N is nodes in this tree, and H is height of the new tree during insertion.
+     * Space O(N) for the new tree.
+     *
+     * @template MK - New key type.
+     * @template MV - New value type.
+     * @template MR - New raw type.
+     * @param callback - A function to map each [key, value] pair.
+     * @param [options] - Options for the new BST.
+     * @param [thisArg] - `this` context for the callback.
+     * @returns A new, mapped BST.
      */
     map(callback, options, thisArg) {
-        const newTree = new BST([], options);
+        const out = this._createLike([], options);
         let index = 0;
+        // Iterates in-order
         for (const [key, value] of this) {
-            newTree.add(callback.call(thisArg, key, value, index++, this));
+            out.add(callback.call(thisArg, key, value, index++, this));
         }
-        return newTree;
+        return out;
     }
     /**
-     * Time complexity: O(n)
-     * Space complexity: O(n)
+     * Deletes the first node found that satisfies the predicate.
+     * @remarks Performs an in-order traversal. Time O(N) worst-case (O(log N) to find + O(log N) to delete). Space O(log N) for stack.
      *
-     * The function `clone` overrides the default cloning behavior to create a deep copy of a tree
-     * structure.
-     * @returns The `cloned` object is being returned.
+     * @param predicate - A function to test each [key, value] pair.
+     * @returns True if a node was deleted, false otherwise.
      */
-    clone() {
-        const cloned = this.createTree();
-        this._clone(cloned);
-        return cloned;
+    deleteWhere(predicate) {
+        const stack = [];
+        let cur = this._root;
+        let index = 0;
+        // In-order traversal to find the node
+        while (stack.length > 0 || cur !== undefined) {
+            while (cur !== undefined && cur !== null) {
+                stack.push(cur);
+                cur = cur.left;
+            }
+            const node = stack.pop();
+            if (!node)
+                break;
+            const key = node.key;
+            const val = node.value;
+            if (predicate(key, val, index++, this)) {
+                return this._deleteByKey(key); // Found, now delete
+            }
+            cur = node.right;
+        }
+        return false;
+    }
+    /**
+     * (Protected) Creates a new, empty instance of the same BST constructor.
+     * @remarks Time O(1)
+     *
+     * @template TK, TV, TR - Generic types for the new instance.
+     * @param [options] - Options for the new BST.
+     * @returns A new, empty BST.
+     */
+    _createInstance(options) {
+        const Ctor = this.constructor;
+        return new Ctor([], Object.assign(Object.assign({}, this._snapshotOptions()), (options !== null && options !== void 0 ? options : {})));
     }
     /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
+     * (Protected) Creates a new instance of the same BST constructor, potentially with different generic types.
+     * @remarks Time O(N log N) or O(N^2) (from constructor) due to processing the iterable.
      *
-     * The function overrides a method and converts a key, value pair or entry or raw element to a node.
-     * @param {K |  BSTNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  } keyNodeOrEntry - A variable that can be of
-     * type R or K |  BSTNode<K, V> | [K | null | undefined, V | undefined] | null | undefined  . It represents either a key, a node, an entry, or a raw
-     * element.
-     * @param {V} [value] - The `value` parameter is an optional value of type `V`. It represents the
-     * value associated with a key in a key-value pair.
-     * @returns either a BSTNode<K, V> object or undefined.
+     * @template TK, TV, TR - Generic types for the new instance.
+     * @param [iter=[]] - An iterable to populate the new BST.
+     * @param [options] - Options for the new BST.
+     * @returns A new BST.
+     */
+    _createLike(iter = [], options) {
+        const Ctor = this.constructor;
+        return new Ctor(iter, Object.assign(Object.assign({}, this._snapshotOptions()), (options !== null && options !== void 0 ? options : {})));
+    }
+    /**
+     * (Protected) Snapshots the current BST's configuration options.
+     * @remarks Time O(1)
+     *
+     * @template TK, TV, TR - Generic types for the options.
+     * @returns The options object.
+     */
+    _snapshotOptions() {
+        return Object.assign(Object.assign({}, super._snapshotOptions()), { specifyComparable: this.specifyComparable, isReverse: this.isReverse });
+    }
+    /**
+     * (Protected) Converts a key, node, or entry into a standardized [node, value] tuple.
+     * @remarks Time O(1)
+     *
+     * @param keyNodeOrEntry - The input item.
+     * @param [value] - An optional value (used if input is just a key).
+     * @returns A tuple of [node, value].
      */
     _keyValueNodeOrEntryToNodeAndValue(keyNodeOrEntry, value) {
         const [node, entryValue] = super._keyValueNodeOrEntryToNodeAndValue(keyNodeOrEntry, value);
         if (node === null)
-            return [undefined, undefined];
+            return [undefined, undefined]; // BST handles null differently (as undefined)
         return [node, value !== null && value !== void 0 ? value : entryValue];
     }
     /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
+     * (Protected) Sets the root node and clears its parent reference.
+     * @remarks Time O(1)
      *
-     * The function sets the root of a tree-like structure and updates the parent property of the new
-     * root.
-     * @param {OptNode<BSTNode<K, V>>} v - v is a parameter of type BSTNode<K, V> or undefined.
+     * @param v - The node to set as root.
      */
     _setRoot(v) {
-        if (v) {
+        if (v)
             v.parent = undefined;
-        }
         this._root = v;
     }
     /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
+     * (Protected) Compares two keys using the tree's comparator and reverse setting.
+     * @remarks Time O(1) (or O(C) if `specifyComparable` is used).
      *
-     * The _compare function compares two values using a specified comparator function and optionally
-     * reverses the result.
-     * @param {K} a - The parameter `a` is of type `K`, which is used as an input for comparison in the
-     * `_compare` method.
-     * @param {K} b - The parameter `b` in the `_compare` function is of type `K`.
-     * @returns The `_compare` method is returning the result of the ternary expression. If `_isReverse`
-     * is true, it returns the negation of the result of calling the `_comparator` function with
-     * arguments `a` and `b`. If `_isReverse` is false, it returns the result of calling the
-     * `_comparator` function with arguments `a` and `b`.
+     * @param a - The first key.
+     * @param b - The second key.
+     * @returns A number (1, -1, or 0) representing the comparison.
      */
     _compare(a, b) {
         return this._isReverse ? -this._comparator(a, b) : this._comparator(a, b);
     }
+    /**
+     * (Private) Deletes a node by its key.
+     * @remarks Standard BST deletion algorithm. Time O(log N), O(N) worst-case. Space O(1).
+     *
+     * @param key - The key of the node to delete.
+     * @returns True if the node was found and deleted, false otherwise.
+     */
+    _deleteByKey(key) {
+        var _a;
+        let node = this._root;
+        // 1. Find the node
+        while (node) {
+            const cmp = this._compare(node.key, key);
+            if (cmp === 0)
+                break;
+            node = cmp > 0 ? node.left : node.right;
+        }
+        if (!node)
+            return false; // Not found
+        // Helper to replace node `u` with node `v`
+        const transplant = (u, v) => {
+            const p = u === null || u === void 0 ? void 0 : u.parent;
+            if (!p) {
+                this._setRoot(v);
+            }
+            else if (p.left === u) {
+                p.left = v;
+            }
+            else {
+                p.right = v;
+            }
+            if (v)
+                v.parent = p;
+        };
+        // Helper to find the minimum node in a subtree
+        const minNode = (x) => {
+            if (!x)
+                return undefined;
+            while (x.left !== undefined && x.left !== null)
+                x = x.left;
+            return x;
+        };
+        // 2. Perform deletion
+        if (node.left === undefined) {
+            // Case 1: No left child
+            transplant(node, node.right);
+        }
+        else if (node.right === undefined) {
+            // Case 2: No right child
+            transplant(node, node.left);
+        }
+        else {
+            // Case 3: Two children
+            const succ = minNode(node.right); // Find successor
+            if (succ.parent !== node) {
+                transplant(succ, succ.right);
+                succ.right = node.right;
+                if (succ.right)
+                    succ.right.parent = succ;
+            }
+            transplant(node, succ);
+            succ.left = node.left;
+            if (succ.left)
+                succ.left.parent = succ;
+        }
+        this._size = Math.max(0, ((_a = this._size) !== null && _a !== void 0 ? _a : 0) - 1);
+        return true;
+    }
 }
 exports.BST = BST;