data-structure-typed 2.6.0 → 2.6.1

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

@@ -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:615](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L615)
 
 Adds a new node to the tree.
 
@@ -492,7 +492,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:802](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L802)
 
 Adds multiple items to the tree.
 
@@ -573,7 +573,7 @@ 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:647](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L647)
 
 BinaryTree level-order traversal
 
@@ -611,7 +611,7 @@ 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:648](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L648)
 
 BinaryTree level-order traversal
 
@@ -673,7 +673,7 @@ 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:1900](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L1900)
 
 Returns the first key with a value >= target.
 Equivalent to Java TreeMap.ceiling.
@@ -720,7 +720,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:1915](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L1915)
 
 Returns the first node with a key >= target and applies callback.
 Time Complexity: O(log n) average, O(h) worst case.
@@ -767,7 +767,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:502](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L502)
 
 Remove all nodes, clear the key→value store (if in map mode) and internal caches.
 
@@ -808,7 +808,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:2837](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2837)
 
 Clones the tree.
 
@@ -947,7 +947,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:1303](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L1303)
 
 Delete a node by key/node/entry and rebalance as needed.
 
@@ -1004,7 +1004,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:2764](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L2764)
 
 Deletes nodes that match a key, node, entry, predicate, or range.
 
@@ -1115,7 +1115,7 @@ 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:531](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L531)
 
 Depth-first search traversal
 
@@ -1155,7 +1155,7 @@ 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:533](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L533)
 
 Depth-first search traversal
 
@@ -1345,7 +1345,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:2896](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2896)
 
 Creates a new tree containing only the entries that satisfy the predicate.
 
@@ -1450,7 +1450,7 @@ 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:2125](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L2125)
 
 Returns the first key with a value <= target.
 Equivalent to Java TreeMap.floor.
@@ -1497,7 +1497,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:2140](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L2140)
 
 Returns the first node with a key <= target and applies callback.
 Time Complexity: O(log n) average, O(h) worst case.
@@ -1591,7 +1591,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:1405](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1405)
 
 Gets the value associated with a key.
 
@@ -1663,7 +1663,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:1273](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L1273)
 
 Returns the element at the k-th position in tree order (0-indexed).
 
@@ -1710,7 +1710,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:1284](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L1284)
 
 Returns the element at the k-th position in tree order and applies a callback.
 
@@ -1762,7 +1762,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:1801](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1801)
 
 Gets the depth of a node (distance from `startNode`).
 
@@ -1826,7 +1826,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:1872](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1872)
 
 Gets the maximum height of the tree (longest path from startNode to a leaf).
 
@@ -1909,7 +1909,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:1999](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1999)
 
 ##### Returns
 
@@ -1934,7 +1934,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:2001](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2001)
 
 ##### Type Parameters
 
@@ -1981,7 +1981,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:1914](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1914)
 
 Gets the minimum height of the tree (shortest path from startNode to a leaf).
 
@@ -2033,7 +2033,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:884](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L884)
 
 Gets the first node matching a predicate.
 
@@ -2106,7 +2106,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:1247](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1247)
 
 Gets all nodes matching a predicate.
 
@@ -2201,7 +2201,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:1961](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1961)
 
 ##### Parameters
 
@@ -2236,7 +2236,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:1965](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1965)
 
 ##### Type Parameters
 
@@ -2284,7 +2284,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:2099](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2099)
 
 Gets the Morris traversal predecessor (rightmost node in the left subtree, or node itself).
 
@@ -2320,7 +2320,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:1328](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L1328)
 
 Returns the 0-based rank of a key (number of elements that precede it in tree order).
 
@@ -2358,7 +2358,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:1346](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L1346)
 
 Returns the 0-based rank (number of preceding elements in tree order) with explicit iteration type.
 
@@ -2427,7 +2427,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:2046](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2046)
 
 ##### Returns
 
@@ -2452,7 +2452,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:2048](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2048)
 
 ##### Type Parameters
 
@@ -2499,7 +2499,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:2120](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2120)
 
 Gets the in-order successor of a node in a BST.
 
@@ -2536,7 +2536,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:1497](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1497)
 
 Checks if a node matching the predicate exists in the tree.
 
@@ -2671,7 +2671,7 @@ 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:2012](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L2012)
 
 Returns the first key with a value > target.
 Equivalent to Java TreeMap.higher.
@@ -2717,7 +2717,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:2027](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L2027)
 
 Returns the first node with a key > target and applies callback.
 Time Complexity: O(log n) average, O(h) worst case.
@@ -2764,7 +2764,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:2571](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L2571)
 
 Checks if the tree meets the AVL balance condition (height difference <= 1).
 
@@ -2808,7 +2808,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:1703](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1703)
 
 Checks if the tree is a valid Binary Search Tree (BST).
 
@@ -2868,7 +2868,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:1633](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1633)
 
 Checks if the tree is empty.
 
@@ -3061,7 +3061,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:1644](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1644)
 
 Checks if the tree is perfectly balanced.
 
@@ -3349,7 +3349,7 @@ 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:2435](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2435)
 
 Get leaf nodes
 
@@ -3387,7 +3387,7 @@ 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:2437](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2437)
 
 Get leaf nodes
 
@@ -3475,7 +3475,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:2383](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L2383)
 
 ##### Returns
 
@@ -3495,7 +3495,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:2385](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L2385)
 
 ##### Type Parameters
 
@@ -3564,7 +3564,7 @@ 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:762](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L762)
 
 Level-order grouping
 
@@ -3605,7 +3605,7 @@ 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:764](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L764)
 
 Level-order grouping
 
@@ -3670,7 +3670,7 @@ 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:2280](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L2280)
 
 Returns the first key with a value < target.
 Equivalent to Java TreeMap.lower.
@@ -3716,7 +3716,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:2295](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L2295)
 
 Returns the first node with a key < target and applies callback.
 Time Complexity: O(log n) average, O(h) worst case.
@@ -3766,7 +3766,7 @@ 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:1709](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L1709)
 
 Transform to new tree
 
@@ -3831,7 +3831,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:937](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L937)
 
 Merges another tree into this one by seting all its nodes.
 
@@ -3905,7 +3905,7 @@ 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:2667](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2667)
 
 Morris traversal (O(1) space)
 
@@ -3943,7 +3943,7 @@ 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:2669](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2669)
 
 Morris traversal (O(1) space)
 
@@ -4003,7 +4003,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:1528](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L1528)
 
 Red-Black trees are self-balancing — `perfectlyBalance` rebuilds via
 sorted bulk insert, which naturally produces a balanced RBT.
@@ -4045,7 +4045,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:3056](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L3056)
 
 Prints a visual representation of the tree to the console.
 
@@ -4098,7 +4098,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:1408](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L1408)
 
 Returns elements by position range in tree order (0-indexed, inclusive on both ends).
 
@@ -4140,7 +4140,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:1420](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L1420)
 
 Returns elements by position range in tree order with callback and optional iteration type.
 
@@ -4226,7 +4226,7 @@ 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:1227](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L1227)
 
 Find all keys in a range
 
@@ -4264,7 +4264,7 @@ 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:1229](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L1229)
 
 Find all keys in a range
 
@@ -4407,7 +4407,7 @@ 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:1026](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L1026)
 
 Search nodes by predicate
 
@@ -4463,7 +4463,7 @@ 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:1038](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L1038)
 
 Search nodes by predicate
 
@@ -4537,7 +4537,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:1074](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L1074)
 
 Insert or update a key/value (map mode) or key-only (set mode).
 
@@ -4612,7 +4612,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:1754](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L1754)
 
 Adds multiple items to the tree.
 
@@ -4681,7 +4681,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:884](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L884)
 
 Boolean wrapper for setWithHintNode.
 
@@ -4718,7 +4718,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:784](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L784)
 
 Insert/update using a hint node to speed up nearby insertions.
 
@@ -4831,7 +4831,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:2979](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2979)
 
 Generates a string representation of the tree for visualization.
 
@@ -4929,7 +4929,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:3252](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L3252)
 
 (Protected) Default callback function, returns the node's key.
 
@@ -4993,7 +4993,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:583](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L583)
 
 (Internal) Attach a new node directly under a known parent/side (no search).
 
@@ -5038,7 +5038,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:3065](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L3065)
 
 (Protected) Core bound search implementation supporting all parameter types.
 Unified logic for both lowerBound and upperBound.
@@ -5090,7 +5090,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:3122](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L3122)
 
 (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 +5135,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:3177](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L3177)
 
 (Protected) In-order traversal search by predicate.
 Falls back to linear in-order traversal when predicate-based search is required.
@@ -5175,7 +5175,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:3686](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L3686)
 
 (Protected) Clears all nodes from the tree.
 
@@ -5199,7 +5199,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:3695](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L3695)
 
 (Protected) Clears all values from the external store.
 
@@ -5223,7 +5223,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:3345](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L3345)
 
 (Protected) Helper for cloning. Performs a BFS and sets all nodes to the new tree.
 
@@ -5255,7 +5255,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:3441](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L3441)
 
 (Protected) Compares two keys using the tree's comparator and reverse setting.
 
@@ -5295,7 +5295,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:2792](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L2792)
 
 (Protected) Creates the default comparator function for keys that don't have a custom comparator.
 
@@ -5321,7 +5321,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:1727](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L1727)
 
 (Internal) Create an empty instance of the same concrete tree type.
 
@@ -5365,7 +5365,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:1739](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L1739)
 
 (Internal) Create a like-kind tree (same concrete class) populated from an iterable.
 
@@ -5419,7 +5419,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:3452](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L3452)
 
 (Private) Deletes a node by its key.
 
@@ -5453,7 +5453,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:1924](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L1924)
 
 (Protected) Restore red-black properties after deletion (recolor/rotate).
 
@@ -5483,7 +5483,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:949](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L949)
 
 **`Internal`**
 
@@ -5531,7 +5531,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:3063](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L3063)
 
 #### Type Parameters
 
@@ -5624,7 +5624,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:3369](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L3369)
 
 (Protected) Recursive helper for `toVisual`.
 
@@ -5664,7 +5664,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:3592](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L3592)
 
 (Protected) Converts a key, node, entry, or predicate into a standardized predicate function.
 
@@ -5703,7 +5703,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:3652](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L3652)
 
 (Protected) Extracts the key from a key, node, or entry.
 
@@ -5741,7 +5741,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:517](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L517)
 
 (Internal) Find a node by key using a tight BST walk (no allocations).
 
@@ -5769,7 +5769,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:2830](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L2830)
 
 (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 +5811,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:2883](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L2883)
 
 (Protected) In-order traversal search for floor by predicate.
 Falls back to linear in-order traversal when predicate-based search is required.
@@ -5854,7 +5854,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:3333](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L3333)
 
 (Protected) Finds the node at position k in tree order (iterative).
 
@@ -5888,7 +5888,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:3354](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L3354)
 
 (Protected) Finds the node at position k in tree order (recursive).
 
@@ -5922,7 +5922,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:3208](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L3208)
 
 (Protected) Gets the iterator for the tree (default in-order).
 
@@ -5956,7 +5956,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:3366](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L3366)
 
 (Protected) Computes the rank of a key iteratively.
 
@@ -5990,7 +5990,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:3392](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L3392)
 
 (Protected) Computes the rank of a key recursively.
 
@@ -6024,7 +6024,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:1786](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L1786)
 
 (Protected) Standard BST insert followed by red-black fix-up.
 
@@ -6054,7 +6054,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:1855](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L1855)
 
 (Protected) Restore red-black properties after insertion (recolor/rotate).
 
@@ -6084,7 +6084,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:3464](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L3464)
 
 Check if a node is a display leaf (empty, null, undefined, NIL, or real leaf).
 
@@ -6114,7 +6114,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:3641](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L3641)
 
 (Protected) Checks if an item is a predicate function.
 
@@ -6148,7 +6148,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:3290](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L3290)
 
 (Protected) Converts a key, node, or entry into a standardized [node, value] tuple.
 
@@ -6192,7 +6192,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:2003](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L2003)
 
 (Protected) Perform a left rotation around x.
 
@@ -6222,7 +6222,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:2948](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L2948)
 
 (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 +6264,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:3001](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L3001)
 
 (Protected) In-order traversal search for lower by predicate.
 Falls back to linear in-order traversal when predicate-based search is required.
@@ -6307,7 +6307,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:3409](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L3409)
 
 (Protected) Finds the in-order successor of a node.
 
@@ -6337,7 +6337,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:535](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L535)
 
 (Internal) In-order predecessor of a node in a BST.
 
@@ -6363,7 +6363,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:1771](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L1771)
 
 (Internal) Replace a node in place while preserving its color.
 
@@ -6400,7 +6400,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:3494](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L3494)
 
 Resolve a display leaf node to its layout.
 
@@ -6434,7 +6434,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:2039](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L2039)
 
 (Protected) Perform a right rotation around y.
 
@@ -6464,7 +6464,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:760](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L760)
 
 (Internal) Boolean wrapper around `_setKVNode`.
 
@@ -6505,7 +6505,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:633](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L633)
 
 (Internal) Core set implementation returning the affected node.
 
@@ -6549,7 +6549,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:614](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L614)
 
 (Internal) Update max cache pointers (header._right is the canonical max pointer).
 
@@ -6575,7 +6575,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:605](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L605)
 
 (Internal) Update min cache pointers (header._left is the canonical min pointer).
 
@@ -6601,7 +6601,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:1756](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L1756)
 
 (Internal) Set the root pointer and keep header.parent in sync.
 
@@ -6631,7 +6631,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:3673](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L3673)
 
 (Protected) Sets a value in the external store (Map mode).
 
@@ -6671,7 +6671,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:3274](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L3274)
 
 (Protected) Snapshots the current BST's configuration options.
 
@@ -6711,7 +6711,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:555](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L555)
 
 (Internal) In-order successor of a node in a BST.
 
@@ -6737,7 +6737,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:3520](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L3520)
 
 (Protected) Swaps the key/value properties of two nodes.
 
@@ -6785,7 +6785,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:1835](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/red-black-tree.ts#L1835)
 
 (Protected) Transplant a subtree in place of another during deletion.
 
@@ -6821,7 +6821,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:3309](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L3309)
 
 (Protected) Recalculates the subtree count for a single node.
 
@@ -6851,7 +6851,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:3320](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L3320)
 
 (Protected) Updates subtree counts from a node up to the root.