data-structure-typed 2.6.0 → 2.6.2

package/docs-site-docusaurus/docs/api/classes/RedBlackTree.md

@@ -6,7 +6,7 @@
 
 # Class: RedBlackTree\<K, V, R\>
 
-Defined in: [data-structures/binary-tree/red-black-tree.ts:254](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L254)
+Defined in: [data-structures/binary-tree/red-black-tree.ts:248](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L248)
 
 Represents a Red-Black Tree (self-balancing BST) supporting map-like mode and stable O(log n) updates.
 
@@ -132,7 +132,7 @@ Operation complexity depends on the method; see each method's docs.
 get comparator(): Comparator<K>;
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:384](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L384)
+Defined in: [data-structures/binary-tree/bst.ts:390](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L390)
 
 Gets the comparator function used by the tree.
 
@@ -160,7 +160,7 @@ The comparator function.
 get isDuplicate(): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:322](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L322)
+Defined in: [data-structures/binary-tree/binary-tree.ts:326](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L326)
 
 Gets whether the tree allows duplicate keys.
 
@@ -194,7 +194,7 @@ IBinaryTree.isDuplicate
 get isMapMode(): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:310](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L310)
+Defined in: [data-structures/binary-tree/binary-tree.ts:316](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L316)
 
 Gets whether the tree is in Map mode.
 
@@ -262,7 +262,7 @@ IBinaryTree.NIL
 get root(): RedBlackTreeNode<K, V> | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/red-black-tree.ts:305](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L305)
+Defined in: [data-structures/binary-tree/red-black-tree.ts:295](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L295)
 
 Get the current root node.
 
@@ -296,7 +296,7 @@ IBinaryTree.root
 get size(): number;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:361](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L361)
+Defined in: [data-structures/binary-tree/binary-tree.ts:363](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L363)
 
 Gets the number of nodes in the tree.
 
@@ -330,7 +330,7 @@ IBinaryTree.size
 get store(): Map<K, BinaryTreeNode<K, V>>;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:337](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L337)
+Defined in: [data-structures/binary-tree/binary-tree.ts:339](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L339)
 
 Gets the external value store (used in Map mode).
 
@@ -364,7 +364,7 @@ IBinaryTree.store
 get toEntryFn(): ToEntryFn<K, V, R> | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:385](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L385)
+Defined in: [data-structures/binary-tree/binary-tree.ts:383](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L383)
 
 Gets the function used to convert raw data objects (R) into [key, value] entries.
 
@@ -434,7 +434,7 @@ IBinaryTree.[iterator]
 add(keyNodeOrEntry): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:612](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L612)
+Defined in: [data-structures/binary-tree/binary-tree.ts:609](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L609)
 
 Adds a new node to the tree.
 
@@ -456,8 +456,6 @@ The key, node, or entry to add.
 
 True if the addition was successful, false otherwise.
 
- *
-
 #### Remarks
 
 Time O(N) — level-order traversal to find an empty slot. Space O(N) for the BFS queue. BST/Red-Black Tree/AVL Tree subclasses override to O(log N).
@@ -492,7 +490,7 @@ IBinaryTree.add
 addMany(keysNodesEntriesOrRaws): boolean[];
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:793](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L793)
+Defined in: [data-structures/binary-tree/binary-tree.ts:711](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L711)
 
 Adds multiple items to the tree.
 
@@ -516,8 +514,6 @@ An iterable of items to set.
 
 An array of booleans indicating the success of each individual `set` operation.
 
- *
-
 #### Remarks
 
 Time O(N * M), where N is the number of items to set and M is the size of the tree at insertion (due to O(M) `set` operation). Space O(M) (from `set`) + O(N) (for the `inserted` array).
@@ -573,12 +569,10 @@ The traversal method.
 bfs(): (K | undefined)[];
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:635](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L635)
+Defined in: [data-structures/binary-tree/bst.ts:493](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L493)
 
 BinaryTree level-order traversal
 
- *
-
 ##### Returns
 
 (`K` \| `undefined`)[]
@@ -611,12 +605,10 @@ bfs<C>(
    iterationType?): ReturnType<C>[];
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:636](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L636)
+Defined in: [data-structures/binary-tree/bst.ts:494](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L494)
 
 BinaryTree level-order traversal
 
- *
-
 ##### Type Parameters
 
 ###### C
@@ -673,15 +665,13 @@ IBinaryTree.bfs
 ceiling(keyNodeEntryOrPredicate): K | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:1849](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L1849)
+Defined in: [data-structures/binary-tree/bst.ts:1253](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L1253)
 
 Returns the first key with a value >= target.
 Equivalent to Java TreeMap.ceiling.
 Time Complexity: O(log n) average, O(h) worst case.
 Space Complexity: O(h) for recursion, O(1) for iteration.
 
- *
-
 ##### Parameters
 
 ###### keyNodeEntryOrPredicate
@@ -720,7 +710,7 @@ ceiling<C>(
 iterationType?): ReturnType<C>;
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:1864](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L1864)
+Defined in: [data-structures/binary-tree/bst.ts:1268](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L1268)
 
 Returns the first node with a key >= target and applies callback.
 Time Complexity: O(log n) average, O(h) worst case.
@@ -767,7 +757,7 @@ Space Complexity: O(h) for recursion, O(1) for iteration.
 clear(): void;
 ```
 
-Defined in: [data-structures/binary-tree/red-black-tree.ts:490](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L490)
+Defined in: [data-structures/binary-tree/red-black-tree.ts:332](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L332)
 
 Remove all nodes, clear the key→value store (if in map mode) and internal caches.
 
@@ -779,8 +769,6 @@ Remove all nodes, clear the key→value store (if in map mode) and internal cach
 
 Time O(n), Space O(1)
 
- *
-
 #### Example
 
 ```ts
@@ -808,7 +796,7 @@ IBinaryTree.clear
 clone(): this;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:2771](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2771)
+Defined in: [data-structures/binary-tree/binary-tree.ts:1939](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1939)
 
 Clones the tree.
 
@@ -818,8 +806,6 @@ Clones the tree.
 
 A new, cloned instance of the tree.
 
- *
-
 #### Remarks
 
 Time O(N * M), where N is the number of nodes and M is the tree size during insertion (due to `bfs` + `set`, and `set` is O(M)). Space O(N) for the new tree and the BFS queue.
@@ -855,7 +841,7 @@ createNode(
 color?): RedBlackTreeNode<K, V>;
 ```
 
-Defined in: [data-structures/binary-tree/red-black-tree.ts:317](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L317)
+Defined in: [data-structures/binary-tree/red-black-tree.ts:307](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L307)
 
 Create a red-black node for the given key/value (value ignored in map mode).
 
@@ -907,7 +893,7 @@ IBinaryTree.createNode
 createTree(options?): this;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:408](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L408)
+Defined in: [data-structures/binary-tree/binary-tree.ts:439](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L439)
 
 Creates a new, empty tree of the same type and configuration.
 
@@ -947,7 +933,7 @@ IBinaryTree.createTree
 delete(keyNodeEntryRawOrPredicate): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/red-black-tree.ts:1267](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L1267)
+Defined in: [data-structures/binary-tree/red-black-tree.ts:534](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L534)
 
 Delete a node by key/node/entry and rebalance as needed.
 
@@ -966,8 +952,6 @@ Key, node, or [key, value] entry identifying the node to delete.
 
 Array with deletion metadata (removed node, rebalancing hint if any).
 
- *
-
 #### Remarks
 
 Time O(log n) average, Space O(1)
@@ -1004,7 +988,7 @@ deleteWhere(
    iterationType?): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:2692](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L2692)
+Defined in: [data-structures/binary-tree/bst.ts:1838](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L1838)
 
 Deletes nodes that match a key, node, entry, predicate, or range.
 
@@ -1115,12 +1099,10 @@ The traversal method.
 dfs(): (K | undefined)[];
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:525](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L525)
+Defined in: [data-structures/binary-tree/bst.ts:453](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L453)
 
 Depth-first search traversal
 
- *
-
 ##### Returns
 
 (`K` \| `undefined`)[]
@@ -1155,12 +1137,10 @@ dfs<C>(
    iterationType?): ReturnType<C>[];
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:527](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L527)
+Defined in: [data-structures/binary-tree/bst.ts:455](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L455)
 
 Depth-first search traversal
 
- *
-
 ##### Type Parameters
 
 ###### C
@@ -1223,7 +1203,7 @@ IBinaryTree.dfs
 ensureNode(keyNodeOrEntry, iterationType?): OptNode<BSTNode<K, V>>;
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:408](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L408)
+Defined in: [data-structures/binary-tree/bst.ts:414](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L414)
 
 Ensures the input is a node. If it's a key or entry, it searches for the node.
 
@@ -1345,7 +1325,7 @@ IBinaryTree.every
 filter(predicate, thisArg?): this;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:2827](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2827)
+Defined in: [data-structures/binary-tree/binary-tree.ts:1958](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1958)
 
 Creates a new tree containing only the entries that satisfy the predicate.
 
@@ -1369,8 +1349,6 @@ A function to test each [key, value] pair.
 
 A new, filtered tree.
 
- *
-
 #### Remarks
 
 Time O(N * M), where N is nodes in this tree, and M is size of the new tree during insertion (O(N) iteration + O(M) `set` for each item). Space O(N) for the new tree.
@@ -1450,15 +1428,13 @@ IBinaryTree.find
 floor(keyNodeEntryOrPredicate): K | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:2068](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L2068)
+Defined in: [data-structures/binary-tree/bst.ts:1394](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L1394)
 
 Returns the first key with a value <= target.
 Equivalent to Java TreeMap.floor.
 Time Complexity: O(log n) average, O(h) worst case.
 Space Complexity: O(h) for recursion, O(1) for iteration.
 
- *
-
 ##### Parameters
 
 ###### keyNodeEntryOrPredicate
@@ -1497,7 +1473,7 @@ floor<C>(
 iterationType?): ReturnType<C>;
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:2083](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L2083)
+Defined in: [data-structures/binary-tree/bst.ts:1409](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L1409)
 
 Returns the first node with a key <= target and applies callback.
 Time Complexity: O(log n) average, O(h) worst case.
@@ -1591,7 +1567,7 @@ get(
    iterationType?): V | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:1375](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1375)
+Defined in: [data-structures/binary-tree/binary-tree.ts:995](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L995)
 
 Gets the value associated with a key.
 
@@ -1628,8 +1604,6 @@ The traversal method (if not in Map mode).
 
 The associated value, or undefined.
 
- *
-
 #### Remarks
 
 Time O(1) in Map mode, O(N) otherwise (via `getNode`). Space O(1) in Map mode, O(H) or O(N) otherwise. BST subclasses override non-Map-mode to O(log N).
@@ -1638,7 +1612,11 @@ Time O(1) in Map mode, O(N) otherwise (via `getNode`). Space O(1) in Map mode, O
 
 ```ts
 // Retrieve value by key
- const tree = new BinaryTree<number, string>([[1, 'root'], [2, 'left'], [3, 'right']]);
+ const tree = new BinaryTree<number, string>([
+      [1, 'root'],
+      [2, 'left'],
+      [3, 'right']
+    ]);
     console.log(tree.get(2)); // 'left';
     console.log(tree.get(99)); // undefined;
 ```
@@ -1663,7 +1641,7 @@ IBinaryTree.get
 getByRank(k): K | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:1240](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L1240)
+Defined in: [data-structures/binary-tree/bst.ts:853](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L853)
 
 Returns the element at the k-th position in tree order (0-indexed).
 
@@ -1680,7 +1658,6 @@ The 0-based position in tree order (0 = first element).
 `K` \| `undefined`
 
 The key at position k, or `undefined` if out of bounds.
- *
 
 ##### Remarks
 
@@ -1710,7 +1687,7 @@ getByRank<C>(
    iterationType?): ReturnType<C> | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:1251](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L1251)
+Defined in: [data-structures/binary-tree/bst.ts:864](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L864)
 
 Returns the element at the k-th position in tree order and applies a callback.
 
@@ -1762,7 +1739,7 @@ Time O(log n), Space O(1) iterative / O(log n) recursive. Requires `enableOrderS
 getDepth(dist, startNode?): number;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:1756](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1756)
+Defined in: [data-structures/binary-tree/binary-tree.ts:1187](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1187)
 
 Gets the depth of a node (distance from `startNode`).
 
@@ -1793,8 +1770,6 @@ The node to measure depth from (defaults to root).
 
 The depth (0 if `dist` is `startNode`).
 
- *
-
 #### Remarks
 
 Time O(H), where H is the depth of the `dist` node relative to `startNode`. O(N) worst-case. Space O(1).
@@ -1826,7 +1801,7 @@ IBinaryTree.getDepth
 getHeight(startNode?, iterationType?): number;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:1824](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1824)
+Defined in: [data-structures/binary-tree/binary-tree.ts:1216](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1216)
 
 Gets the maximum height of the tree (longest path from startNode to a leaf).
 
@@ -1853,8 +1828,6 @@ The traversal method.
 
 The height ( -1 for an empty tree, 0 for a single-node tree).
 
- *
-
 #### Remarks
 
 Time O(N), as it must visit every node. Space O(H) for recursive stack (O(N) worst-case) or O(N) for iterative stack (storing node + depth).
@@ -1909,7 +1882,7 @@ The traversal method.
 getLeftMost(): K | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:1951](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1951)
+Defined in: [data-structures/binary-tree/binary-tree.ts:1343](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1343)
 
 ##### Returns
 
@@ -1934,7 +1907,7 @@ getLeftMost<C>(
 iterationType?): ReturnType<C>;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:1953](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1953)
+Defined in: [data-structures/binary-tree/binary-tree.ts:1345](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1345)
 
 ##### Type Parameters
 
@@ -1981,7 +1954,7 @@ IBinaryTree.getLeftMost
 getMinHeight(startNode?, iterationType?): number;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:1866](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1866)
+Defined in: [data-structures/binary-tree/binary-tree.ts:1258](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1258)
 
 Gets the minimum height of the tree (shortest path from startNode to a leaf).
 
@@ -2033,7 +2006,7 @@ getNode(
 iterationType?): OptNode<BSTNode<K, V>>;
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:860](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L860)
+Defined in: [data-structures/binary-tree/bst.ts:574](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L574)
 
 Gets the first node matching a predicate.
 
@@ -2068,8 +2041,6 @@ The traversal method.
 
 The first matching node, or undefined if not found.
 
- *
-
 #### Remarks
 
 Time O(log N) if searching by key, O(N) if searching by predicate. Space O(log N) or O(N).
@@ -2078,7 +2049,11 @@ Time O(log N) if searching by key, O(N) if searching by predicate. Space O(log N
 
 ```ts
 // Get node object by key
- const bst = new BST<number, string>([[5, 'root'], [3, 'left'], [7, 'right']]);
+ const bst = new BST<number, string>([
+      [5, 'root'],
+      [3, 'left'],
+      [7, 'right']
+    ]);
     const node = bst.getNode(3);
     console.log(node?.key); // 3;
     console.log(node?.value); // 'left';
@@ -2106,7 +2081,7 @@ getNodes(
    iterationType?): BinaryTreeNode<K, V>[];
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:1223](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1223)
+Defined in: [data-structures/binary-tree/binary-tree.ts:912](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L912)
 
 Gets all nodes matching a predicate.
 
@@ -2150,8 +2125,6 @@ The traversal method.
 
 An array of matching nodes.
 
- *
-
 #### Remarks
 
 Time O(N) (via `search`). Space O(H) or O(N) (via `search`).
@@ -2201,7 +2174,7 @@ If true, returns the path from root-to-node.
 getPathToRoot(beginNode): (K | undefined)[];
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:1913](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1913)
+Defined in: [data-structures/binary-tree/binary-tree.ts:1305](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1305)
 
 ##### Parameters
 
@@ -2236,7 +2209,7 @@ getPathToRoot<C>(
    isReverse?): ReturnType<C>[];
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:1917](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1917)
+Defined in: [data-structures/binary-tree/binary-tree.ts:1309](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1309)
 
 ##### Type Parameters
 
@@ -2284,7 +2257,7 @@ IBinaryTree.getPathToRoot
 getPredecessor(node): BinaryTreeNode<K, V>;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:2051](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2051)
+Defined in: [data-structures/binary-tree/binary-tree.ts:1443](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1443)
 
 Gets the Morris traversal predecessor (rightmost node in the left subtree, or node itself).
 
@@ -2320,7 +2293,7 @@ This is primarily a helper for Morris traversal. Time O(H), where H is the heigh
 getRank(keyNodeEntryOrPredicate): number;
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:1295](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L1295)
+Defined in: [data-structures/binary-tree/bst.ts:909](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L909)
 
 Returns the 0-based rank of a key (number of elements that precede it in tree order).
 
@@ -2358,7 +2331,7 @@ Tree order is defined by the comparator. When the key is not found, returns the
 getRank(keyNodeEntryOrPredicate, iterationType): number;
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:1313](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L1313)
+Defined in: [data-structures/binary-tree/bst.ts:927](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L927)
 
 Returns the 0-based rank (number of preceding elements in tree order) with explicit iteration type.
 
@@ -2427,7 +2400,7 @@ The traversal method.
 getRightMost(): K | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:1998](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1998)
+Defined in: [data-structures/binary-tree/binary-tree.ts:1390](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1390)
 
 ##### Returns
 
@@ -2452,7 +2425,7 @@ getRightMost<C>(
 iterationType?): ReturnType<C>;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:2000](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2000)
+Defined in: [data-structures/binary-tree/binary-tree.ts:1392](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1392)
 
 ##### Type Parameters
 
@@ -2499,7 +2472,7 @@ IBinaryTree.getRightMost
 getSuccessor(x?): BinaryTreeNode<K, V> | null | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:2072](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2072)
+Defined in: [data-structures/binary-tree/binary-tree.ts:1464](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1464)
 
 Gets the in-order successor of a node in a BST.
 
@@ -2536,7 +2509,7 @@ has(
    iterationType?): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:1464](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1464)
+Defined in: [data-structures/binary-tree/binary-tree.ts:1045](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1045)
 
 Checks if a node matching the predicate exists in the tree.
 
@@ -2573,8 +2546,6 @@ The traversal method.
 
 True if a matching node exists, false otherwise.
 
- *
-
 #### Remarks
 
 Time O(N) via `search`. Space O(H) or O(N). BST/Red-Black Tree/AVL Tree subclasses override to O(log N) for key lookups.
@@ -2671,15 +2642,13 @@ IBinaryTree.hasValue
 higher(keyNodeEntryOrPredicate): K | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:1958](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L1958)
+Defined in: [data-structures/binary-tree/bst.ts:1323](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L1323)
 
 Returns the first key with a value > target.
 Equivalent to Java TreeMap.higher.
 Time Complexity: O(log n) average, O(h) worst case.
 Space Complexity: O(h) for recursion, O(1) for iteration.
 
- *
-
 ##### Parameters
 
 ###### keyNodeEntryOrPredicate
@@ -2717,7 +2686,7 @@ higher<C>(
 iterationType?): ReturnType<C>;
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:1973](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L1973)
+Defined in: [data-structures/binary-tree/bst.ts:1338](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L1338)
 
 Returns the first node with a key > target and applies callback.
 Time Complexity: O(log n) average, O(h) worst case.
@@ -2764,7 +2733,7 @@ Space Complexity: O(h) for recursion, O(1) for iteration.
 isAVLBalanced(iterationType?): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:2505](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L2505)
+Defined in: [data-structures/binary-tree/bst.ts:1722](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L1722)
 
 Checks if the tree meets the AVL balance condition (height difference <= 1).
 
@@ -2782,8 +2751,6 @@ The traversal method.
 
 True if the tree is AVL balanced, false otherwise.
 
- *
-
 #### 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.
@@ -2808,7 +2775,7 @@ Time O(N), as it must visit every node to compute height. Space O(log N) for rec
 isBST(startNode?, iterationType?): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:1661](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1661)
+Defined in: [data-structures/binary-tree/binary-tree.ts:1131](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1131)
 
 Checks if the tree is a valid Binary Search Tree (BST).
 
@@ -2835,8 +2802,6 @@ The traversal method.
 
 True if it's a valid BST, false otherwise.
 
- *
-
 #### Remarks
 
 Time O(N), as it must visit every node. Space O(H) for the call stack (recursive) or explicit stack (iterative), where H is the tree height (O(N) worst-case).
@@ -2868,7 +2833,7 @@ IBinaryTree.isBST
 isEmpty(): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:1594](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1594)
+Defined in: [data-structures/binary-tree/binary-tree.ts:1101](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1101)
 
 Checks if the tree is empty.
 
@@ -2878,8 +2843,6 @@ Checks if the tree is empty.
 
 True if the tree has no nodes, false otherwise.
 
- *
-
 #### Remarks
 
 Time O(1), Space O(1)
@@ -2909,7 +2872,7 @@ IBinaryTree.isEmpty
 isEntry(keyNodeOrEntry): keyNodeOrEntry is BTNEntry<K, V>;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:545](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L545)
+Defined in: [data-structures/binary-tree/binary-tree.ts:576](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L576)
 
 Checks if the given item is a [key, value] entry pair.
 
@@ -2947,7 +2910,7 @@ Time O(1), Space O(1)
 isLeaf(keyNodeOrEntry): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:531](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L531)
+Defined in: [data-structures/binary-tree/binary-tree.ts:562](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L562)
 
 Checks if a node is a leaf (has no real children).
 
@@ -2985,7 +2948,7 @@ Time O(N) if a key/entry is passed (due to `ensureNode`). O(1) if a node is pass
 isNIL(keyNodeOrEntry): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:500](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L500)
+Defined in: [data-structures/binary-tree/binary-tree.ts:531](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L531)
 
 Checks if the given item is the sentinel NIL node.
 
@@ -3023,7 +2986,7 @@ Time O(1), Space O(1)
 isNode(keyNodeOrEntry): keyNodeOrEntry is RedBlackTreeNode<K, V>;
 ```
 
-Defined in: [data-structures/binary-tree/red-black-tree.ts:328](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L328)
+Defined in: [data-structures/binary-tree/red-black-tree.ts:317](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L317)
 
 Type guard: check whether the input is a RedBlackTreeNode.
 
@@ -3061,7 +3024,7 @@ Time O(1), Space O(1)
 isPerfectlyBalanced(startNode?): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:1605](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1605)
+Defined in: [data-structures/binary-tree/binary-tree.ts:1112](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1112)
 
 Checks if the tree is perfectly balanced.
 
@@ -3104,7 +3067,7 @@ IBinaryTree.isPerfectlyBalanced
 isRange(keyNodeEntryOrPredicate): keyNodeEntryOrPredicate is Range<K>;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:511](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L511)
+Defined in: [data-structures/binary-tree/binary-tree.ts:542](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L542)
 
 Checks if the given item is a `Range` object.
 
@@ -3144,7 +3107,7 @@ Time O(1), Space O(1)
 isRaw(keyNodeEntryOrRaw): keyNodeEntryOrRaw is R;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:460](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L460)
+Defined in: [data-structures/binary-tree/binary-tree.ts:491](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L491)
 
 Checks if the given item is a raw data object (R) that needs conversion via `toEntryFn`.
 
@@ -3183,7 +3146,7 @@ Time O(1), Space O(1)
 isRealNode(keyNodeOrEntry): keyNodeOrEntry is BinaryTreeNode<K, V>;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:473](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L473)
+Defined in: [data-structures/binary-tree/binary-tree.ts:504](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L504)
 
 Checks if the given item is a "real" node (i.e., not null, undefined, or NIL).
 
@@ -3221,7 +3184,7 @@ Time O(1), Space O(1)
 isRealNodeOrNull(keyNodeOrEntry): keyNodeOrEntry is BinaryTreeNode<K, V> | null;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:487](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L487)
+Defined in: [data-structures/binary-tree/binary-tree.ts:518](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L518)
 
 Checks if the given item is either a "real" node or null.
 
@@ -3259,7 +3222,7 @@ Time O(1), Space O(1)
 isValidKey(key): key is K;
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:435](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L435)
+Defined in: [data-structures/binary-tree/bst.ts:441](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L441)
 
 Checks if the given key is valid (comparable).
 
@@ -3349,12 +3312,10 @@ The traversal method.
 leaves(): (K | undefined)[];
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:2378](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2378)
+Defined in: [data-structures/binary-tree/binary-tree.ts:1655](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1655)
 
 Get leaf nodes
 
- *
-
 ##### Returns
 
 (`K` \| `undefined`)[]
@@ -3387,12 +3348,10 @@ leaves<C>(
    iterationType?): ReturnType<C>[];
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:2380](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2380)
+Defined in: [data-structures/binary-tree/binary-tree.ts:1657](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1657)
 
 Get leaf nodes
 
- *
-
 ##### Type Parameters
 
 ###### C
@@ -3475,7 +3434,7 @@ The traversal method.
 lesserOrGreaterTraverse(): (K | undefined)[];
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:2323](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L2323)
+Defined in: [data-structures/binary-tree/bst.ts:1614](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L1614)
 
 ##### Returns
 
@@ -3495,7 +3454,7 @@ lesserOrGreaterTraverse<C>(
    iterationType?): ReturnType<C>[];
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:2325](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L2325)
+Defined in: [data-structures/binary-tree/bst.ts:1616](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L1616)
 
 ##### Type Parameters
 
@@ -3564,12 +3523,10 @@ The traversal method.
 listLevels(): (K | undefined)[][];
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:744](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L744)
+Defined in: [data-structures/binary-tree/bst.ts:529](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L529)
 
 Level-order grouping
 
- *
-
 ##### Returns
 
 (`K` \| `undefined`)[][]
@@ -3605,12 +3562,10 @@ listLevels<C>(
    iterationType?): ReturnType<C>[][];
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:746](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L746)
+Defined in: [data-structures/binary-tree/bst.ts:531](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L531)
 
 Level-order grouping
 
- *
-
 ##### Type Parameters
 
 ###### C
@@ -3670,15 +3625,13 @@ IBinaryTree.listLevels
 lower(keyNodeEntryOrPredicate): K | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:2220](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L2220)
+Defined in: [data-structures/binary-tree/bst.ts:1509](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L1509)
 
 Returns the first key with a value < target.
 Equivalent to Java TreeMap.lower.
 Time Complexity: O(log n) average, O(h) worst case.
 Space Complexity: O(h) for recursion, O(1) for iteration.
 
- *
-
 ##### Parameters
 
 ###### keyNodeEntryOrPredicate
@@ -3716,7 +3669,7 @@ lower<C>(
 iterationType?): ReturnType<C>;
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:2235](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L2235)
+Defined in: [data-structures/binary-tree/bst.ts:1524](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L1524)
 
 Returns the first node with a key < target and applies callback.
 Time Complexity: O(log n) average, O(h) worst case.
@@ -3766,12 +3719,10 @@ map<MK, MV, MR>(
 thisArg?): RedBlackTree<MK, MV, MR>;
 ```
 
-Defined in: [data-structures/binary-tree/red-black-tree.ts:1652](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L1652)
+Defined in: [data-structures/binary-tree/red-black-tree.ts:658](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L658)
 
 Transform to new tree
 
- *
-
 #### Type Parameters
 
 ##### MK
@@ -3808,7 +3759,10 @@ Transform to new tree
 
 ```ts
 // Transform to new tree
- const rbt = new RedBlackTree<number, number>([[1, 10], [2, 20]]);
+ const rbt = new RedBlackTree<number, number>([
+      [1, 10],
+      [2, 20]
+    ]);
     const doubled = rbt.map((v, k) => [k, (v ?? 0) * 2] as [number, number]);
     console.log([...doubled.values()]); // [20, 40];
 ```
@@ -3831,7 +3785,7 @@ IBinaryTree.map
 merge(anotherTree): void;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:922](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L922)
+Defined in: [data-structures/binary-tree/binary-tree.ts:777](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L777)
 
 Merges another tree into this one by seting all its nodes.
 
@@ -3843,8 +3797,6 @@ Merges another tree into this one by seting all its nodes.
 
 The tree to merge.
 
- *
-
 #### Returns
 
 `void`
@@ -3905,12 +3857,10 @@ The node to start from.
 morris(): (K | undefined)[];
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:2604](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2604)
+Defined in: [data-structures/binary-tree/binary-tree.ts:1809](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1809)
 
 Morris traversal (O(1) space)
 
- *
-
 ##### Returns
 
 (`K` \| `undefined`)[]
@@ -3943,12 +3893,10 @@ morris<C>(
    startNode?): ReturnType<C>[];
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:2606](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2606)
+Defined in: [data-structures/binary-tree/binary-tree.ts:1811](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1811)
 
 Morris traversal (O(1) space)
 
- *
-
 ##### Type Parameters
 
 ###### C
@@ -4003,7 +3951,7 @@ IBinaryTree.morris
 perfectlyBalance(_iterationType?): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/red-black-tree.ts:1483](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L1483)
+Defined in: [data-structures/binary-tree/red-black-tree.ts:633](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L633)
 
 Red-Black trees are self-balancing — `perfectlyBalance` rebuilds via
 sorted bulk insert, which naturally produces a balanced RBT.
@@ -4022,8 +3970,6 @@ sorted bulk insert, which naturally produces a balanced RBT.
 
 Time O(N), Space O(N)
 
- *
-
 #### Example
 
 ```ts
@@ -4045,7 +3991,7 @@ Time O(N), Space O(N)
 print(options?, startNode?): void;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:2981](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2981)
+Defined in: [data-structures/binary-tree/binary-tree.ts:2041](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2041)
 
 Prints a visual representation of the tree to the console.
 
@@ -4066,8 +4012,6 @@ Options to control the output.
 
 The node to start printing from.
 
- *
-
 #### Returns
 
 `void`
@@ -4098,7 +4042,7 @@ Time O(N) (via `toVisual`). Space O(N*H) or O(N^2) (via `toVisual`).
 rangeByRank(start, end): (K | undefined)[];
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:1375](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L1375)
+Defined in: [data-structures/binary-tree/bst.ts:989](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L989)
 
 Returns elements by position range in tree order (0-indexed, inclusive on both ends).
 
@@ -4140,7 +4084,7 @@ rangeByRank<C>(
    iterationType?): ReturnType<C>[];
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:1387](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L1387)
+Defined in: [data-structures/binary-tree/bst.ts:1001](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L1001)
 
 Returns elements by position range in tree order with callback and optional iteration type.
 
@@ -4226,12 +4170,10 @@ The traversal method.
 rangeSearch(range): (K | undefined)[];
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:1194](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L1194)
+Defined in: [data-structures/binary-tree/bst.ts:807](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L807)
 
 Find all keys in a range
 
- *
-
 ##### Parameters
 
 ###### range
@@ -4264,12 +4206,10 @@ rangeSearch<C>(
    iterationType?): ReturnType<C>[];
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:1196](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L1196)
+Defined in: [data-structures/binary-tree/bst.ts:809](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L809)
 
 Find all keys in a range
 
- *
-
 ##### Type Parameters
 
 ###### C
@@ -4407,12 +4347,10 @@ Whether to use 'RECURSIVE' or 'ITERATIVE' search.
 search(keyNodeEntryOrPredicate, onlyOne?): (K | undefined)[];
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:996](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L996)
+Defined in: [data-structures/binary-tree/bst.ts:646](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L646)
 
 Search nodes by predicate
 
- *
-
 ##### Parameters
 
 ###### keyNodeEntryOrPredicate
@@ -4437,7 +4375,12 @@ Search nodes by predicate
 
 ```ts
 // Search nodes by predicate
- const bst = new BST<number, string>([[1, 'a'], [2, 'b'], [3, 'c'], [4, 'd']]);
+ const bst = new BST<number, string>([
+      [1, 'a'],
+      [2, 'b'],
+      [3, 'c'],
+      [4, 'd']
+    ]);
     const found = bst.search(node => node.key > 2, true);
     console.log(found.length); // >= 1;
 ```
@@ -4463,12 +4406,10 @@ search<C>(
    iterationType?): ReturnType<C>[];
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:1008](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L1008)
+Defined in: [data-structures/binary-tree/bst.ts:658](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L658)
 
 Search nodes by predicate
 
- *
-
 ##### Type Parameters
 
 ###### C
@@ -4514,7 +4455,12 @@ Search nodes by predicate
 
 ```ts
 // Search nodes by predicate
- const bst = new BST<number, string>([[1, 'a'], [2, 'b'], [3, 'c'], [4, 'd']]);
+ const bst = new BST<number, string>([
+      [1, 'a'],
+      [2, 'b'],
+      [3, 'c'],
+      [4, 'd']
+    ]);
     const found = bst.search(node => node.key > 2, true);
     console.log(found.length); // >= 1;
 ```
@@ -4537,7 +4483,7 @@ IBinaryTree.search
 set(keyNodeOrEntry, value?): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/red-black-tree.ts:1050](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L1050)
+Defined in: [data-structures/binary-tree/red-black-tree.ts:472](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L472)
 
 Insert or update a key/value (map mode) or key-only (set mode).
 
@@ -4567,8 +4513,6 @@ This method is optimized for:
 
 Time O(log n) average, Space O(1)
 
- *
-
 #### Example
 
 ```ts
@@ -4612,7 +4556,7 @@ setMany(
    iterationType?): boolean[];
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:1706](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L1706)
+Defined in: [data-structures/binary-tree/bst.ts:1149](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L1149)
 
 Adds multiple items to the tree.
 
@@ -4648,8 +4592,6 @@ The traversal method for balanced set (recursive or iterative).
 
 An array of booleans indicating the success of each individual `set` operation.
 
- *
-
 #### Remarks
 
 If `isBalanceAdd` is true, sorts the input and builds a balanced tree. Time O(N log N) (due to sort and balanced set).
@@ -4661,7 +4603,11 @@ Space O(N) for sorting and recursion/iteration stack.
 ```ts
 // Set multiple key-value pairs
  const bst = new BST<number, string>();
-    bst.setMany([[1, 'a'], [2, 'b'], [3, 'c']]);
+    bst.setMany([
+      [1, 'a'],
+      [2, 'b'],
+      [3, 'c']
+    ]);
     console.log(bst.size); // 3;
     console.log(bst.get(2)); // 'b';
 ```
@@ -4681,7 +4627,7 @@ setWithHint(
    hint?): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/red-black-tree.ts:872](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L872)
+Defined in: [data-structures/binary-tree/red-black-tree.ts:442](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L442)
 
 Boolean wrapper for setWithHintNode.
 
@@ -4718,7 +4664,7 @@ setWithHintNode(
    hint?): RedBlackTreeNode<K, V> | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/red-black-tree.ts:772](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L772)
+Defined in: [data-structures/binary-tree/red-black-tree.ts:351](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L351)
 
 Insert/update using a hint node to speed up nearby insertions.
 
@@ -4831,7 +4777,7 @@ Time O(n), Space O(n)
 toVisual(startNode?, options?): string;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:2907](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2907)
+Defined in: [data-structures/binary-tree/binary-tree.ts:2004](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2004)
 
 Generates a string representation of the tree for visualization.
 
@@ -4909,7 +4855,7 @@ IBinaryTree.values
 protected readonly _comparator: Comparator<K>;
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:376](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L376)
+Defined in: [data-structures/binary-tree/bst.ts:340](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L340)
 
 The comparator function used to determine the order of keys in the tree.
 
@@ -4929,7 +4875,7 @@ Time O(1) Space O(1)
 protected readonly _DEFAULT_NODE_CALLBACK: NodeCallback<BinaryTreeNode<K, V> | null | undefined, K | undefined>;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:3177](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L3177)
+Defined in: [data-structures/binary-tree/binary-tree.ts:2298](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2298)
 
 (Protected) Default callback function, returns the node's key.
 
@@ -4957,7 +4903,7 @@ The node's key or undefined.
 protected _header: RedBlackTreeNode<K, V>;
 ```
 
-Defined in: [data-structures/binary-tree/red-black-tree.ts:291](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L291)
+Defined in: [data-structures/binary-tree/red-black-tree.ts:260](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L260)
 
 (Internal) Header sentinel:
 - header.parent -> root
@@ -4977,7 +4923,7 @@ IMPORTANT:
 protected _minNode: RedBlackTreeNode<K, V> | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/red-black-tree.ts:297](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L297)
+Defined in: [data-structures/binary-tree/red-black-tree.ts:266](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L266)
 
 (Internal) Cache of the current minimum and maximum nodes.
 Used for fast-path insert/update when keys are monotonic or near-boundary.
@@ -4993,7 +4939,7 @@ protected _attachNewNode(
    node): void;
 ```
 
-Defined in: [data-structures/binary-tree/red-black-tree.ts:571](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L571)
+Defined in: [data-structures/binary-tree/red-black-tree.ts:742](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L742)
 
 (Internal) Attach a new node directly under a known parent/side (no search).
 
@@ -5038,7 +4984,7 @@ protected _bound(
    iterationType): BSTNode<K, V> | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:2993](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L2993)
+Defined in: [data-structures/binary-tree/bst.ts:2139](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L2139)
 
 (Protected) Core bound search implementation supporting all parameter types.
 Unified logic for both lowerBound and upperBound.
@@ -5090,7 +5036,7 @@ protected _boundByKey(
    iterationType): BSTNode<K, V> | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:3050](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L3050)
+Defined in: [data-structures/binary-tree/bst.ts:2196](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L2196)
 
 (Protected) Binary search for bound by key with pruning optimization.
 Performs standard BST binary search, choosing left or right subtree based on comparator result.
@@ -5135,7 +5081,7 @@ The first node matching the bound condition, or undefined if none exists.
 protected _boundByPredicate(predicate, iterationType): BSTNode<K, V> | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:3105](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L3105)
+Defined in: [data-structures/binary-tree/bst.ts:2251](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L2251)
 
 (Protected) In-order traversal search by predicate.
 Falls back to linear in-order traversal when predicate-based search is required.
@@ -5175,7 +5121,7 @@ The first node satisfying predicate, or undefined if none found.
 protected _clearNodes(): void;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:3611](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L3611)
+Defined in: [data-structures/binary-tree/binary-tree.ts:2701](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2701)
 
 (Protected) Clears all nodes from the tree.
 
@@ -5199,7 +5145,7 @@ Time O(1)
 protected _clearValues(): void;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:3620](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L3620)
+Defined in: [data-structures/binary-tree/binary-tree.ts:2710](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2710)
 
 (Protected) Clears all values from the external store.
 
@@ -5223,7 +5169,7 @@ Time O(N)
 protected _clone(cloned): void;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:3270](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L3270)
+Defined in: [data-structures/binary-tree/binary-tree.ts:2392](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2392)
 
 (Protected) Helper for cloning. Performs a BFS and sets all nodes to the new tree.
 
@@ -5255,7 +5201,7 @@ Time O(N * M) (O(N) BFS + O(M) `set` for each node).
 protected _compare(a, b): number;
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:3369](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L3369)
+Defined in: [data-structures/binary-tree/bst.ts:2517](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L2517)
 
 (Protected) Compares two keys using the tree's comparator and reverse setting.
 
@@ -5295,7 +5241,7 @@ Time O(1) Space O(1)
 protected _createDefaultComparator(): Comparator<K>;
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:2720](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L2720)
+Defined in: [data-structures/binary-tree/bst.ts:1866](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L1866)
 
 (Protected) Creates the default comparator function for keys that don't have a custom comparator.
 
@@ -5321,7 +5267,7 @@ Time O(1) Space O(1)
 protected _createInstance<TK, TV, TR>(options?): this;
 ```
 
-Defined in: [data-structures/binary-tree/red-black-tree.ts:1670](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L1670)
+Defined in: [data-structures/binary-tree/red-black-tree.ts:925](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L925)
 
 (Internal) Create an empty instance of the same concrete tree type.
 
@@ -5365,7 +5311,7 @@ Time O(1) average, Space O(1)
 protected _createLike<TK, TV, TR>(iter?, options?): RedBlackTree<TK, TV, TR>;
 ```
 
-Defined in: [data-structures/binary-tree/red-black-tree.ts:1682](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L1682)
+Defined in: [data-structures/binary-tree/red-black-tree.ts:937](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L937)
 
 (Internal) Create a like-kind tree (same concrete class) populated from an iterable.
 
@@ -5419,7 +5365,7 @@ Time O(m log m) average (m = iterable length), Space O(m)
 protected _deleteByKey(key): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:3380](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L3380)
+Defined in: [data-structures/binary-tree/bst.ts:2528](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L2528)
 
 (Private) Deletes a node by its key.
 
@@ -5453,7 +5399,7 @@ Standard BST deletion algorithm. Time O(log N), O(N) worst-case. Space O(1).
 protected _deleteFixup(node): void;
 ```
 
-Defined in: [data-structures/binary-tree/red-black-tree.ts:1867](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L1867)
+Defined in: [data-structures/binary-tree/red-black-tree.ts:1104](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L1104)
 
 (Protected) Restore red-black properties after deletion (recolor/rotate).
 
@@ -5483,7 +5429,7 @@ Time O(log n) average, Space O(1)
 protected _deleteInternal(keyNodeEntryRawOrPredicate): BinaryTreeDeleteResult<BinaryTreeNode<K, V>>[];
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:934](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L934)
+Defined in: [data-structures/binary-tree/binary-tree.ts:2056](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2056)
 
 **`Internal`**
 
@@ -5531,7 +5477,7 @@ protected _dfs<C>(
    shouldProcessRoot?): ReturnType<C>[];
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:2988](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2988)
+Defined in: [data-structures/binary-tree/binary-tree.ts:2109](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2109)
 
 #### Type Parameters
 
@@ -5624,7 +5570,7 @@ Array of callback results.
 protected _displayAux(node, options): NodeDisplayLayout;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:3294](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L3294)
+Defined in: [data-structures/binary-tree/binary-tree.ts:2416](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2416)
 
 (Protected) Recursive helper for `toVisual`.
 
@@ -5664,7 +5610,7 @@ Time O(N), Space O(N*H) or O(N^2)
 protected _ensurePredicate(keyNodeEntryOrPredicate): NodePredicate<BinaryTreeNode<K, V>>;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:3517](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L3517)
+Defined in: [data-structures/binary-tree/binary-tree.ts:2607](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2607)
 
 (Protected) Converts a key, node, entry, or predicate into a standardized predicate function.
 
@@ -5703,7 +5649,7 @@ Time O(1)
 protected _extractKey(keyNodeOrEntry): K | null | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:3577](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L3577)
+Defined in: [data-structures/binary-tree/binary-tree.ts:2667](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2667)
 
 (Protected) Extracts the key from a key, node, or entry.
 
@@ -5741,7 +5687,7 @@ Time O(1)
 protected _findNodeByKey(key): RedBlackTreeNode<K, V> | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/red-black-tree.ts:505](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L505)
+Defined in: [data-structures/binary-tree/red-black-tree.ts:677](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L677)
 
 (Internal) Find a node by key using a tight BST walk (no allocations).
 
@@ -5769,7 +5715,7 @@ Time O(log n) average, Space O(1)
 protected _floorByKey(key, iterationType): BSTNode<K, V> | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:2758](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L2758)
+Defined in: [data-structures/binary-tree/bst.ts:1904](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L1904)
 
 (Protected) Binary search for floor by key with pruning optimization.
 Performs standard BST binary search, choosing left or right subtree based on comparator result.
@@ -5811,7 +5757,7 @@ Time O(h) where h is tree height.
 protected _floorByPredicate(predicate, iterationType): BSTNode<K, V> | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:2811](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L2811)
+Defined in: [data-structures/binary-tree/bst.ts:1957](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L1957)
 
 (Protected) In-order traversal search for floor by predicate.
 Falls back to linear in-order traversal when predicate-based search is required.
@@ -5854,7 +5800,7 @@ Space Complexity: O(h) for recursion, O(h) for iterative stack.
 protected _getByRankIterative(node, k): BSTNode<K, V> | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:3261](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L3261)
+Defined in: [data-structures/binary-tree/bst.ts:2406](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L2406)
 
 (Protected) Finds the node at position k in tree order (iterative).
 
@@ -5888,7 +5834,7 @@ Time O(log n), Space O(1)
 protected _getByRankRecursive(node, k): BSTNode<K, V> | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:3282](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L3282)
+Defined in: [data-structures/binary-tree/bst.ts:2427](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L2427)
 
 (Protected) Finds the node at position k in tree order (recursive).
 
@@ -5922,7 +5868,7 @@ Time O(log n), Space O(log n) call stack
 protected _getIterator(node?): IterableIterator<[K, V | undefined]>;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:3133](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L3133)
+Defined in: [data-structures/binary-tree/binary-tree.ts:2254](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2254)
 
 (Protected) Gets the iterator for the tree (default in-order).
 
@@ -5956,7 +5902,7 @@ Time O(N) for full iteration. O(H) to get the first element. Space O(H) for the
 protected _getRankIterative(node, key): number;
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:3294](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L3294)
+Defined in: [data-structures/binary-tree/bst.ts:2439](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L2439)
 
 (Protected) Computes the rank of a key iteratively.
 
@@ -5990,7 +5936,7 @@ Time O(log n), Space O(1)
 protected _getRankRecursive(node, key): number;
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:3320](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L3320)
+Defined in: [data-structures/binary-tree/bst.ts:2465](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L2465)
 
 (Protected) Computes the rank of a key recursively.
 
@@ -6024,7 +5970,7 @@ Time O(log n), Space O(log n) call stack
 protected _insert(node): CRUD;
 ```
 
-Defined in: [data-structures/binary-tree/red-black-tree.ts:1729](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L1729)
+Defined in: [data-structures/binary-tree/red-black-tree.ts:983](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L983)
 
 (Protected) Standard BST insert followed by red-black fix-up.
 
@@ -6054,7 +6000,7 @@ Time O(log n) average, Space O(1)
 protected _insertFixup(z): void;
 ```
 
-Defined in: [data-structures/binary-tree/red-black-tree.ts:1798](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L1798)
+Defined in: [data-structures/binary-tree/red-black-tree.ts:1044](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L1044)
 
 (Protected) Restore red-black properties after insertion (recolor/rotate).
 
@@ -6084,7 +6030,7 @@ Time O(log n) average, Space O(1)
 protected _isDisplayLeaf(node, options): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:3389](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L3389)
+Defined in: [data-structures/binary-tree/binary-tree.ts:2482](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2482)
 
 Check if a node is a display leaf (empty, null, undefined, NIL, or real leaf).
 
@@ -6114,7 +6060,7 @@ Check if a node is a display leaf (empty, null, undefined, NIL, or real leaf).
 protected _isPredicate(p): p is NodePredicate<BinaryTreeNode<K, V>>;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:3566](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L3566)
+Defined in: [data-structures/binary-tree/binary-tree.ts:2656](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2656)
 
 (Protected) Checks if an item is a predicate function.
 
@@ -6148,7 +6094,7 @@ Time O(1)
 protected _keyValueNodeOrEntryToNodeAndValue(keyNodeOrEntry, value?): [OptNode<BSTNode<K, V>>, V | undefined];
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:3218](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L3218)
+Defined in: [data-structures/binary-tree/bst.ts:2364](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L2364)
 
 (Protected) Converts a key, node, or entry into a standardized [node, value] tuple.
 
@@ -6192,7 +6138,7 @@ Time O(1)
 protected _leftRotate(x): void;
 ```
 
-Defined in: [data-structures/binary-tree/red-black-tree.ts:1946](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L1946)
+Defined in: [data-structures/binary-tree/red-black-tree.ts:1176](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L1176)
 
 (Protected) Perform a left rotation around x.
 
@@ -6222,7 +6168,7 @@ Time O(1), Space O(1)
 protected _lowerByKey(key, iterationType): BSTNode<K, V> | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:2876](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L2876)
+Defined in: [data-structures/binary-tree/bst.ts:2022](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L2022)
 
 (Protected) Binary search for lower by key with pruning optimization.
 Performs standard BST binary search, choosing left or right subtree based on comparator result.
@@ -6264,7 +6210,7 @@ Time O(h) where h is tree height.
 protected _lowerByPredicate(predicate, iterationType): BSTNode<K, V> | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:2929](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L2929)
+Defined in: [data-structures/binary-tree/bst.ts:2075](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L2075)
 
 (Protected) In-order traversal search for lower by predicate.
 Falls back to linear in-order traversal when predicate-based search is required.
@@ -6307,7 +6253,7 @@ Space Complexity: O(h) for recursion, O(h) for iterative stack.
 protected _next(node): BSTNode<K, V> | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:3337](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L3337)
+Defined in: [data-structures/binary-tree/bst.ts:2485](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L2485)
 
 (Protected) Finds the in-order successor of a node.
 
@@ -6337,7 +6283,7 @@ Time O(log n), Space O(1)
 protected _predecessorOf(node): RedBlackTreeNode<K, V> | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/red-black-tree.ts:523](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L523)
+Defined in: [data-structures/binary-tree/red-black-tree.ts:694](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L694)
 
 (Internal) In-order predecessor of a node in a BST.
 
@@ -6363,7 +6309,7 @@ Time O(log n) average, Space O(1)
 protected _replaceNode(oldNode, newNode): RedBlackTreeNode<K, V>;
 ```
 
-Defined in: [data-structures/binary-tree/red-black-tree.ts:1714](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L1714)
+Defined in: [data-structures/binary-tree/red-black-tree.ts:969](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L969)
 
 (Internal) Replace a node in place while preserving its color.
 
@@ -6400,7 +6346,7 @@ protected _resolveDisplayLeaf(
    emptyDisplayLayout): NodeDisplayLayout;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:3419](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L3419)
+Defined in: [data-structures/binary-tree/binary-tree.ts:2509](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2509)
 
 Resolve a display leaf node to its layout.
 
@@ -6434,7 +6380,7 @@ Resolve a display leaf node to its layout.
 protected _rightRotate(y): void;
 ```
 
-Defined in: [data-structures/binary-tree/red-black-tree.ts:1982](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L1982)
+Defined in: [data-structures/binary-tree/red-black-tree.ts:1206](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L1206)
 
 (Protected) Perform a right rotation around y.
 
@@ -6464,7 +6410,7 @@ Time O(1), Space O(1)
 protected _setKV(key, nextValue?): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/red-black-tree.ts:748](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L748)
+Defined in: [data-structures/binary-tree/red-black-tree.ts:909](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L909)
 
 (Internal) Boolean wrapper around `_setKVNode`.
 
@@ -6505,7 +6451,7 @@ protected _setKVNode(key, nextValue?):
   | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/red-black-tree.ts:621](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L621)
+Defined in: [data-structures/binary-tree/red-black-tree.ts:792](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L792)
 
 (Internal) Core set implementation returning the affected node.
 
@@ -6549,7 +6495,7 @@ Time O(log n) average, Space O(1)
 protected _setMaxCache(node): void;
 ```
 
-Defined in: [data-structures/binary-tree/red-black-tree.ts:602](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L602)
+Defined in: [data-structures/binary-tree/red-black-tree.ts:773](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L773)
 
 (Internal) Update max cache pointers (header._right is the canonical max pointer).
 
@@ -6575,7 +6521,7 @@ Time O(1), Space O(1)
 protected _setMinCache(node): void;
 ```
 
-Defined in: [data-structures/binary-tree/red-black-tree.ts:593](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L593)
+Defined in: [data-structures/binary-tree/red-black-tree.ts:764](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L764)
 
 (Internal) Update min cache pointers (header._left is the canonical min pointer).
 
@@ -6601,7 +6547,7 @@ Time O(1), Space O(1)
 protected _setRoot(v): void;
 ```
 
-Defined in: [data-structures/binary-tree/red-black-tree.ts:1699](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L1699)
+Defined in: [data-structures/binary-tree/red-black-tree.ts:954](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L954)
 
 (Internal) Set the root pointer and keep header.parent in sync.
 
@@ -6631,7 +6577,7 @@ Time O(1), Space O(1)
 protected _setValue(key, value): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:3598](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L3598)
+Defined in: [data-structures/binary-tree/binary-tree.ts:2688](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2688)
 
 (Protected) Sets a value in the external store (Map mode).
 
@@ -6671,7 +6617,7 @@ Time O(1) (average for Map.set).
 protected _snapshotOptions<TK, TV, TR>(): BSTOptions<TK, TV, TR>;
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:3202](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L3202)
+Defined in: [data-structures/binary-tree/bst.ts:2348](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L2348)
 
 (Protected) Snapshots the current BST's configuration options.
 
@@ -6711,7 +6657,7 @@ Time O(1)
 protected _successorOf(node): RedBlackTreeNode<K, V> | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/red-black-tree.ts:543](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L543)
+Defined in: [data-structures/binary-tree/red-black-tree.ts:714](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L714)
 
 (Internal) In-order successor of a node in a BST.
 
@@ -6737,7 +6683,7 @@ Time O(log n) average, Space O(1)
 protected _swapProperties(srcNode, destNode): BinaryTreeNode<K, V> | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:3445](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L3445)
+Defined in: [data-structures/binary-tree/binary-tree.ts:2535](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2535)
 
 (Protected) Swaps the key/value properties of two nodes.
 
@@ -6785,7 +6731,7 @@ Time O(1)
 protected _transplant(u, v): void;
 ```
 
-Defined in: [data-structures/binary-tree/red-black-tree.ts:1778](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L1778)
+Defined in: [data-structures/binary-tree/red-black-tree.ts:1025](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L1025)
 
 (Protected) Transplant a subtree in place of another during deletion.
 
@@ -6821,7 +6767,7 @@ Time O(1), Space O(1)
 protected _updateCount(node): void;
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:3237](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L3237)
+Defined in: [data-structures/binary-tree/bst.ts:2383](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L2383)
 
 (Protected) Recalculates the subtree count for a single node.
 
@@ -6851,7 +6797,7 @@ Time O(1). Only active when enableOrderStatistic is true.
 protected _updateCountAlongPath(node): void;
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:3248](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L3248)
+Defined in: [data-structures/binary-tree/bst.ts:2393](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L2393)
 
 (Protected) Updates subtree counts from a node up to the root.