data-structure-typed 2.5.1 → 2.5.3

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/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/red-black-tree.ts#L254)
+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)
 
 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:380](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/bst.ts#L380)
+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)
 
 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/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/binary-tree.ts#L322)
+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)
 
 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/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/binary-tree.ts#L310)
+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)
 
 Gets whether the tree is in Map mode.
 
@@ -228,7 +228,7 @@ IBinaryTree.isMapMode
 get NIL(): BinaryTreeNode<K, V>;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:373](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/binary-tree.ts#L373)
+Defined in: [data-structures/binary-tree/binary-tree.ts:373](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L373)
 
 Gets the sentinel NIL node (used in self-balancing trees like Red-Black Tree).
 
@@ -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/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/red-black-tree.ts#L305)
+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)
 
 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/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/binary-tree.ts#L361)
+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)
 
 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/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/binary-tree.ts#L337)
+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)
 
 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/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/binary-tree.ts#L385)
+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)
 
 Gets the function used to convert raw data objects (R) into [key, value] entries.
 
@@ -396,7 +396,7 @@ IBinaryTree.toEntryFn
 iterator: IterableIterator<[K, V | undefined]>;
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:22](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/iterable-entry-base.ts#L22)
+Defined in: [data-structures/base/iterable-entry-base.ts:22](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-entry-base.ts#L22)
 
 Default iterator yielding `[key, value]` entries.
 
@@ -404,7 +404,7 @@ Default iterator yielding `[key, value]` entries.
 
 ##### args
 
-...`any`[]
+...`unknown`[]
 
 #### Returns
 
@@ -434,7 +434,7 @@ IBinaryTree.[iterator]
 add(keyNodeOrEntry): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:601](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/binary-tree.ts#L601)
+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)
 
 Adds a new node to the tree.
 
@@ -460,7 +460,7 @@ True if the addition was successful, false otherwise.
 
 #### Remarks
 
-Time O(log N), For BST, Red-Black Tree, and AVL Tree subclasses, the worst-case time is O(log N). This implementation adds the node at the first available position in a level-order (BFS) traversal. This is NOT a Binary Search Tree insertion. Time O(N), where N is the number of nodes. It must traverse level-by-level to find an empty slot. Space O(N) in the worst case for the BFS queue (e.g., a full last level).
+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).
 
 #### Example
 
@@ -492,7 +492,7 @@ IBinaryTree.add
 addMany(keysNodesEntriesOrRaws): boolean[];
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:760](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/binary-tree.ts#L760)
+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)
 
 Adds multiple items to the tree.
 
@@ -573,7 +573,7 @@ The traversal method.
 bfs(): (K | undefined)[];
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:587](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/bst.ts#L587)
+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)
 
 BinaryTree level-order traversal
 
@@ -611,7 +611,7 @@ bfs<C>(
    iterationType?): ReturnType<C>[];
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:588](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/bst.ts#L588)
+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)
 
 BinaryTree level-order traversal
 
@@ -673,7 +673,7 @@ IBinaryTree.bfs
 ceiling(keyNodeEntryOrPredicate): K | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:1429](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/bst.ts#L1429)
+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)
 
 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:1444](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/bst.ts#L1444)
+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)
 
 Returns the first node with a key >= target and applies callback.
 Time Complexity: O(log n) average, O(h) worst case.
@@ -767,9 +767,9 @@ Space Complexity: O(h) for recursion, O(1) for iteration.
 clear(): void;
 ```
 
-Defined in: [data-structures/binary-tree/red-black-tree.ts:452](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/red-black-tree.ts#L452)
+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)
 
-Remove all nodes and clear internal caches.
+Remove all nodes, clear the key→value store (if in map mode) and internal caches.
 
 #### Returns
 
@@ -777,7 +777,7 @@ Remove all nodes and clear internal caches.
 
 #### Remarks
 
-Time O(n) average, Space O(1)
+Time O(n), Space O(1)
 
  *
 
@@ -808,7 +808,7 @@ IBinaryTree.clear
 clone(): this;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:2543](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/binary-tree.ts#L2543)
+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)
 
 Clones the tree.
 
@@ -855,7 +855,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/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/red-black-tree.ts#L317)
+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)
 
 Create a red-black node for the given key/value (value ignored in map mode).
 
@@ -907,7 +907,7 @@ IBinaryTree.createNode
 createTree(options?): this;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:408](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/binary-tree.ts#L408)
+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)
 
 Creates a new, empty tree of the same type and configuration.
 
@@ -944,10 +944,10 @@ IBinaryTree.createTree
 ### delete()
 
 ```ts
-delete(keyNodeEntryRawOrPredicate): BinaryTreeDeleteResult<RedBlackTreeNode<K, V>>[];
+delete(keyNodeEntryRawOrPredicate): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/red-black-tree.ts:1139](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/red-black-tree.ts#L1139)
+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)
 
 Delete a node by key/node/entry and rebalance as needed.
 
@@ -962,7 +962,7 @@ Key, node, or [key, value] entry identifying the node to delete.
 
 #### Returns
 
-`BinaryTreeDeleteResult`\<`RedBlackTreeNode`\<`K`, `V`\>\>[]
+`boolean`
 
 Array with deletion metadata (removed node, rebalancing hint if any).
 
@@ -1001,10 +1001,10 @@ deleteWhere(
    keyNodeEntryOrPredicate, 
    onlyOne?, 
    startNode?, 
-   iterationType?): BinaryTreeDeleteResult<BSTNode<K, V>>[];
+   iterationType?): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:2195](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/bst.ts#L2195)
+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)
 
 Deletes nodes that match a key, node, entry, predicate, or range.
 
@@ -1059,7 +1059,7 @@ Controls the internal traversal implementation:
 
 #### Returns
 
-`BinaryTreeDeleteResult`\<[`BSTNode`](BSTNode.md)\<`K`, `V`\>\>[]
+`boolean`
 
 A Map<K, boolean> containing the deletion results:
   - Key: the matched node's key.
@@ -1115,7 +1115,7 @@ The traversal method.
 dfs(): (K | undefined)[];
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:499](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/bst.ts#L499)
+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)
 
 Depth-first search traversal
 
@@ -1155,7 +1155,7 @@ dfs<C>(
    iterationType?): ReturnType<C>[];
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:501](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/bst.ts#L501)
+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)
 
 Depth-first search traversal
 
@@ -1223,7 +1223,7 @@ IBinaryTree.dfs
 ensureNode(keyNodeOrEntry, iterationType?): OptNode<BSTNode<K, V>>;
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:404](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/bst.ts#L404)
+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)
 
 Ensures the input is a node. If it's a key or entry, it searches for the node.
 
@@ -1267,7 +1267,7 @@ Time O(log N) (height of the tree), O(N) worst-case.
 entries(): IterableIterator<[K, V | undefined]>;
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:31](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/iterable-entry-base.ts#L31)
+Defined in: [data-structures/base/iterable-entry-base.ts:31](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-entry-base.ts#L31)
 
 Iterate over `[key, value]` pairs (may yield `undefined` values).
 
@@ -1299,7 +1299,7 @@ IBinaryTree.entries
 every(predicate, thisArg?): boolean;
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:66](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/iterable-entry-base.ts#L66)
+Defined in: [data-structures/base/iterable-entry-base.ts:66](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-entry-base.ts#L66)
 
 Test whether all entries satisfy the predicate.
 
@@ -1313,7 +1313,7 @@ Test whether all entries satisfy the predicate.
 
 ##### thisArg?
 
-`any`
+`unknown`
 
 Optional `this` for callback.
 
@@ -1345,7 +1345,7 @@ IBinaryTree.every
 filter(predicate, thisArg?): this;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:2588](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/binary-tree.ts#L2588)
+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)
 
 Creates a new tree containing only the entries that satisfy the predicate.
 
@@ -1402,7 +1402,7 @@ IBinaryTree.filter
 find(callbackfn, thisArg?): [K, V | undefined] | undefined;
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:114](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/iterable-entry-base.ts#L114)
+Defined in: [data-structures/base/iterable-entry-base.ts:114](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-entry-base.ts#L114)
 
 Find the first entry that matches a predicate.
 
@@ -1416,7 +1416,7 @@ Find the first entry that matches a predicate.
 
 ##### thisArg?
 
-`any`
+`unknown`
 
 Optional `this` for callback.
 
@@ -1450,7 +1450,7 @@ IBinaryTree.find
 floor(keyNodeEntryOrPredicate): K | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:1626](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/bst.ts#L1626)
+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)
 
 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:1641](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/bst.ts#L1641)
+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)
 
 Returns the first node with a key <= target and applies callback.
 Time Complexity: O(log n) average, O(h) worst case.
@@ -1544,7 +1544,7 @@ Space Complexity: O(h) for recursion, O(1) for iteration.
 forEach(callbackfn, thisArg?): void;
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:99](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/iterable-entry-base.ts#L99)
+Defined in: [data-structures/base/iterable-entry-base.ts:99](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-entry-base.ts#L99)
 
 Visit each entry, left-to-right.
 
@@ -1558,7 +1558,7 @@ Visit each entry, left-to-right.
 
 ##### thisArg?
 
-`any`
+`unknown`
 
 Optional `this` for callback.
 
@@ -1591,7 +1591,7 @@ get(
    iterationType?): V | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:1279](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/binary-tree.ts#L1279)
+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)
 
 Gets the value associated with a key.
 
@@ -1632,7 +1632,7 @@ The associated value, or undefined.
 
 #### Remarks
 
-Time O(log N), For BST, Red-Black Tree, and AVL Tree subclasses, the worst-case time is O(log N). Time O(1) if in Map mode. O(N) if not in Map mode (uses `getNode`). Space O(1) if in Map mode. O(H) or O(N) otherwise.
+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).
 
 #### Example
 
@@ -1655,13 +1655,114 @@ IBinaryTree.get
 
 ***
 
+### getByRank()
+
+#### Call Signature
+
+```ts
+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)
+
+Returns the element at the k-th position in tree order (0-indexed).
+
+##### Parameters
+
+###### k
+
+`number`
+
+The 0-based position in tree order (0 = first element).
+
+##### Returns
+
+`K` \| `undefined`
+
+The key at position k, or `undefined` if out of bounds.
+ *
+
+##### Remarks
+
+Time O(log n), Space O(1) iterative / O(log n) recursive. Requires `enableOrderStatistic: true`.
+Tree order is defined by the comparator — ascending by default, but respects custom comparators (e.g. descending).
+
+##### Example
+
+```ts
+// Order-statistic on BST
+ const tree = new BST<number>([30, 10, 50, 20, 40], { enableOrderStatistic: true });
+      console.log(tree.getByRank(0)); // 10;
+      console.log(tree.getByRank(4)); // 50;
+      console.log(tree.getRank(30)); // 2;
+```
+
+##### Inherited from
+
+[`BST`](BST.md).[`getByRank`](BST.md#getbyrank)
+
+#### Call Signature
+
+```ts
+getByRank<C>(
+   k, 
+   callback, 
+   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)
+
+Returns the element at the k-th position in tree order and applies a callback.
+
+##### Type Parameters
+
+###### C
+
+`C` *extends* `NodeCallback`\<[`BSTNode`](BSTNode.md)\<`K`, `V`\>\>
+
+##### Parameters
+
+###### k
+
+`number`
+
+The 0-based position in tree order (0 = first element).
+
+###### callback
+
+`C`
+
+Callback to apply to the found node.
+
+###### iterationType?
+
+`IterationType`
+
+Iteration strategy ('ITERATIVE' or 'RECURSIVE').
+
+##### Returns
+
+`ReturnType`\<`C`\> \| `undefined`
+
+The callback result, or `undefined` if out of bounds.
+
+##### Remarks
+
+Time O(log n), Space O(1) iterative / O(log n) recursive. Requires `enableOrderStatistic: true`.
+
+##### Inherited from
+
+[`BST`](BST.md).[`getByRank`](BST.md#getbyrank)
+
+***
+
 ### getDepth()
 
 ```ts
 getDepth(dist, startNode?): number;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:1605](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/binary-tree.ts#L1605)
+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)
 
 Gets the depth of a node (distance from `startNode`).
 
@@ -1725,7 +1826,7 @@ IBinaryTree.getDepth
 getHeight(startNode?, iterationType?): number;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:1662](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/binary-tree.ts#L1662)
+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)
 
 Gets the maximum height of the tree (longest path from startNode to a leaf).
 
@@ -1808,7 +1909,7 @@ The traversal method.
 getLeftMost(): K | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:1789](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/binary-tree.ts#L1789)
+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)
 
 ##### Returns
 
@@ -1833,7 +1934,7 @@ getLeftMost<C>(
 iterationType?): ReturnType<C>;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:1791](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/binary-tree.ts#L1791)
+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)
 
 ##### Type Parameters
 
@@ -1880,7 +1981,7 @@ IBinaryTree.getLeftMost
 getMinHeight(startNode?, iterationType?): number;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:1704](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/binary-tree.ts#L1704)
+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)
 
 Gets the minimum height of the tree (shortest path from startNode to a leaf).
 
@@ -1932,7 +2033,7 @@ getNode(
 iterationType?): OptNode<BSTNode<K, V>>;
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:768](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/bst.ts#L768)
+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)
 
 Gets the first node matching a predicate.
 
@@ -2005,7 +2106,7 @@ getNodes(
    iterationType?): BinaryTreeNode<K, V>[];
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:1149](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/binary-tree.ts#L1149)
+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)
 
 Gets all nodes matching a predicate.
 
@@ -2100,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:1751](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/binary-tree.ts#L1751)
+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)
 
 ##### Parameters
 
@@ -2135,7 +2236,7 @@ getPathToRoot<C>(
    isReverse?): ReturnType<C>[];
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:1755](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/binary-tree.ts#L1755)
+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)
 
 ##### Type Parameters
 
@@ -2183,7 +2284,7 @@ IBinaryTree.getPathToRoot
 getPredecessor(node): BinaryTreeNode<K, V>;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:1889](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/binary-tree.ts#L1889)
+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)
 
 Gets the Morris traversal predecessor (rightmost node in the left subtree, or node itself).
 
@@ -2211,6 +2312,91 @@ This is primarily a helper for Morris traversal. Time O(H), where H is the heigh
 
 ***
 
+### getRank()
+
+#### Call Signature
+
+```ts
+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)
+
+Returns the 0-based rank of a key (number of elements that precede it in tree order).
+
+##### Parameters
+
+###### keyNodeEntryOrPredicate
+
+  \| `K`
+  \| [`BSTNode`](BSTNode.md)\<`K`, `V`\>
+  \| \[`K` \| `null` \| `undefined`, `V` \| `undefined`\]
+  \| `NodePredicate`\<[`BSTNode`](BSTNode.md)\<`K`, `V`\>\>
+  \| `null`
+  \| `undefined`
+
+The key, node, entry `[K, V]`, or predicate to find.
+
+##### Returns
+
+`number`
+
+The rank (0-indexed), or -1 if the tree is empty or input is invalid.
+
+##### Remarks
+
+Time O(log n), Space O(1) iterative / O(log n) recursive. Requires `enableOrderStatistic: true`.
+Tree order is defined by the comparator. When the key is not found, returns the insertion position.
+
+##### Inherited from
+
+[`BST`](BST.md).[`getRank`](BST.md#getrank)
+
+#### Call Signature
+
+```ts
+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)
+
+Returns the 0-based rank (number of preceding elements in tree order) with explicit iteration type.
+
+##### Parameters
+
+###### keyNodeEntryOrPredicate
+
+  \| `K`
+  \| [`BSTNode`](BSTNode.md)\<`K`, `V`\>
+  \| \[`K` \| `null` \| `undefined`, `V` \| `undefined`\]
+  \| `NodePredicate`\<[`BSTNode`](BSTNode.md)\<`K`, `V`\>\>
+  \| `null`
+  \| `undefined`
+
+The key, node, entry, or predicate to find.
+
+###### iterationType
+
+`IterationType`
+
+Iteration strategy ('ITERATIVE' or 'RECURSIVE').
+
+##### Returns
+
+`number`
+
+The rank (0-indexed), or -1 if the tree is empty or input is invalid.
+
+##### Remarks
+
+Time O(log n), Space O(1) iterative / O(log n) recursive. Requires `enableOrderStatistic: true`.
+
+##### Inherited from
+
+[`BST`](BST.md).[`getRank`](BST.md#getrank)
+
+***
+
 ### getRightMost()
 
 Finds the rightmost node in a subtree (the node with the largest key in a BST).
@@ -2241,7 +2427,7 @@ The traversal method.
 getRightMost(): K | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:1836](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/binary-tree.ts#L1836)
+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)
 
 ##### Returns
 
@@ -2266,7 +2452,7 @@ getRightMost<C>(
 iterationType?): ReturnType<C>;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:1838](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/binary-tree.ts#L1838)
+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)
 
 ##### Type Parameters
 
@@ -2313,7 +2499,7 @@ IBinaryTree.getRightMost
 getSuccessor(x?): BinaryTreeNode<K, V> | null | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:1910](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/binary-tree.ts#L1910)
+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)
 
 Gets the in-order successor of a node in a BST.
 
@@ -2350,7 +2536,7 @@ has(
    iterationType?): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:1357](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/binary-tree.ts#L1357)
+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)
 
 Checks if a node matching the predicate exists in the tree.
 
@@ -2391,7 +2577,7 @@ True if a matching node exists, false otherwise.
 
 #### Remarks
 
-Time O(log N), For BST, Red-Black Tree, and AVL Tree subclasses, the worst-case time is O(log N). Time O(N) in the worst case (via `search`). Space O(H) or O(N) (via `search`).
+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.
 
 #### Example
 
@@ -2443,7 +2629,7 @@ IBinaryTree.has
 hasValue(value): boolean;
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:143](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/iterable-entry-base.ts#L143)
+Defined in: [data-structures/base/iterable-entry-base.ts:143](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-entry-base.ts#L143)
 
 Whether there exists an entry with the given value.
 
@@ -2485,7 +2671,7 @@ IBinaryTree.hasValue
 higher(keyNodeEntryOrPredicate): K | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:1527](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/bst.ts#L1527)
+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)
 
 Returns the first key with a value > target.
 Equivalent to Java TreeMap.higher.
@@ -2531,7 +2717,7 @@ higher<C>(
 iterationType?): ReturnType<C>;
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:1542](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/bst.ts#L1542)
+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)
 
 Returns the first node with a key > target and applies callback.
 Time Complexity: O(log n) average, O(h) worst case.
@@ -2578,7 +2764,7 @@ Space Complexity: O(h) for recursion, O(1) for iteration.
 isAVLBalanced(iterationType?): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:2030](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/bst.ts#L2030)
+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)
 
 Checks if the tree meets the AVL balance condition (height difference <= 1).
 
@@ -2622,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:1521](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/binary-tree.ts#L1521)
+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)
 
 Checks if the tree is a valid Binary Search Tree (BST).
 
@@ -2682,7 +2868,7 @@ IBinaryTree.isBST
 isEmpty(): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:1465](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/binary-tree.ts#L1465)
+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)
 
 Checks if the tree is empty.
 
@@ -2723,7 +2909,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/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/binary-tree.ts#L545)
+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)
 
 Checks if the given item is a [key, value] entry pair.
 
@@ -2761,7 +2947,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/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/binary-tree.ts#L531)
+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 a node is a leaf (has no real children).
 
@@ -2799,7 +2985,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/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/binary-tree.ts#L500)
+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)
 
 Checks if the given item is the sentinel NIL node.
 
@@ -2837,7 +3023,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/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/red-black-tree.ts#L328)
+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)
 
 Type guard: check whether the input is a RedBlackTreeNode.
 
@@ -2875,7 +3061,7 @@ Time O(1), Space O(1)
 isPerfectlyBalanced(startNode?): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:1476](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/binary-tree.ts#L1476)
+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)
 
 Checks if the tree is perfectly balanced.
 
@@ -2918,7 +3104,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/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/binary-tree.ts#L511)
+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)
 
 Checks if the given item is a `Range` object.
 
@@ -2958,7 +3144,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/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/binary-tree.ts#L460)
+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)
 
 Checks if the given item is a raw data object (R) that needs conversion via `toEntryFn`.
 
@@ -2997,7 +3183,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/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/binary-tree.ts#L473)
+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)
 
 Checks if the given item is a "real" node (i.e., not null, undefined, or NIL).
 
@@ -3035,7 +3221,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/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/binary-tree.ts#L487)
+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)
 
 Checks if the given item is either a "real" node or null.
 
@@ -3073,7 +3259,7 @@ Time O(1), Space O(1)
 isValidKey(key): key is K;
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:431](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/bst.ts#L431)
+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)
 
 Checks if the given key is valid (comparable).
 
@@ -3081,7 +3267,7 @@ Checks if the given key is valid (comparable).
 
 ##### key
 
-`any`
+`unknown`
 
 The key to validate.
 
@@ -3107,7 +3293,7 @@ Time O(1)
 keys(): IterableIterator<K>;
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:42](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/iterable-entry-base.ts#L42)
+Defined in: [data-structures/base/iterable-entry-base.ts:42](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-entry-base.ts#L42)
 
 Iterate over keys only.
 
@@ -3163,7 +3349,7 @@ The traversal method.
 leaves(): (K | undefined)[];
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:2183](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/binary-tree.ts#L2183)
+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)
 
 Get leaf nodes
 
@@ -3201,7 +3387,7 @@ leaves<C>(
    iterationType?): ReturnType<C>[];
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:2185](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/binary-tree.ts#L2185)
+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)
 
 Get leaf nodes
 
@@ -3289,7 +3475,7 @@ The traversal method.
 lesserOrGreaterTraverse(): (K | undefined)[];
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:1870](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/bst.ts#L1870)
+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)
 
 ##### Returns
 
@@ -3309,7 +3495,7 @@ lesserOrGreaterTraverse<C>(
    iterationType?): ReturnType<C>[];
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:1872](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/bst.ts#L1872)
+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)
 
 ##### Type Parameters
 
@@ -3378,7 +3564,7 @@ The traversal method.
 listLevels(): (K | undefined)[][];
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:674](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/bst.ts#L674)
+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)
 
 Level-order grouping
 
@@ -3394,7 +3580,7 @@ Level-order grouping
 // Level-order grouping
  const bst = new BST<number>([5, 3, 7, 1, 4]);
     const levels = bst.listLevels(node => node.key);
-    console.log(levels.length); // > 0;
+    console.log(levels); // toBeInstanceOf;
     console.log(levels[0].length); // 1; // root level has 1 node
     const allKeys = levels.flat().sort((a, b) => a - b);
     console.log(allKeys); // [1, 3, 4, 5, 7];
@@ -3419,7 +3605,7 @@ listLevels<C>(
    iterationType?): ReturnType<C>[][];
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:676](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/bst.ts#L676)
+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)
 
 Level-order grouping
 
@@ -3458,7 +3644,7 @@ Level-order grouping
 // Level-order grouping
  const bst = new BST<number>([5, 3, 7, 1, 4]);
     const levels = bst.listLevels(node => node.key);
-    console.log(levels.length); // > 0;
+    console.log(levels); // toBeInstanceOf;
     console.log(levels[0].length); // 1; // root level has 1 node
     const allKeys = levels.flat().sort((a, b) => a - b);
     console.log(allKeys); // [1, 3, 4, 5, 7];
@@ -3484,7 +3670,7 @@ IBinaryTree.listLevels
 lower(keyNodeEntryOrPredicate): K | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:1767](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/bst.ts#L1767)
+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)
 
 Returns the first key with a value < target.
 Equivalent to Java TreeMap.lower.
@@ -3530,7 +3716,7 @@ lower<C>(
 iterationType?): ReturnType<C>;
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:1782](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/bst.ts#L1782)
+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)
 
 Returns the first node with a key < target and applies callback.
 Time Complexity: O(log n) average, O(h) worst case.
@@ -3580,7 +3766,7 @@ map<MK, MV, MR>(
 thisArg?): RedBlackTree<MK, MV, MR>;
 ```
 
-Defined in: [data-structures/binary-tree/red-black-tree.ts:1447](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/red-black-tree.ts#L1447)
+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)
 
 Transform to new tree
 
@@ -3645,7 +3831,7 @@ IBinaryTree.map
 merge(anotherTree): void;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:867](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/binary-tree.ts#L867)
+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)
 
 Merges another tree into this one by seting all its nodes.
 
@@ -3719,7 +3905,7 @@ The node to start from.
 morris(): (K | undefined)[];
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:2387](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/binary-tree.ts#L2387)
+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)
 
 Morris traversal (O(1) space)
 
@@ -3757,7 +3943,7 @@ morris<C>(
    startNode?): ReturnType<C>[];
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:2389](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/binary-tree.ts#L2389)
+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)
 
 Morris traversal (O(1) space)
 
@@ -3817,7 +4003,7 @@ IBinaryTree.morris
 perfectlyBalance(_iterationType?): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/red-black-tree.ts:1322](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/red-black-tree.ts#L1322)
+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)
 
 Red-Black trees are self-balancing — `perfectlyBalance` rebuilds via
 sorted bulk insert, which naturally produces a balanced RBT.
@@ -3859,7 +4045,7 @@ Time O(N), Space O(N)
 print(options?, startNode?): void;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:2720](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/binary-tree.ts#L2720)
+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)
 
 Prints a visual representation of the tree to the console.
 
@@ -3904,6 +4090,108 @@ Time O(N) (via `toVisual`). Space O(N*H) or O(N^2) (via `toVisual`).
 
 ***
 
+### rangeByRank()
+
+#### Call Signature
+
+```ts
+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)
+
+Returns elements by position range in tree order (0-indexed, inclusive on both ends).
+
+##### Parameters
+
+###### start
+
+`number`
+
+Start position (inclusive, 0-indexed). Clamped to 0 if negative.
+
+###### end
+
+`number`
+
+End position (inclusive, 0-indexed). Clamped to size-1 if too large.
+
+##### Returns
+
+(`K` \| `undefined`)[]
+
+Array of keys in tree order within the specified range.
+
+##### Remarks
+
+Time O(log n + k), Space O(k), where k = end - start + 1. Requires `enableOrderStatistic: true`.
+
+##### Inherited from
+
+[`BST`](BST.md).[`rangeByRank`](BST.md#rangebyrank)
+
+#### Call Signature
+
+```ts
+rangeByRank<C>(
+   start, 
+   end, 
+   callback, 
+   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)
+
+Returns elements by position range in tree order with callback and optional iteration type.
+
+##### Type Parameters
+
+###### C
+
+`C` *extends* `NodeCallback`\<[`BSTNode`](BSTNode.md)\<`K`, `V`\>\>
+
+##### Parameters
+
+###### start
+
+`number`
+
+Start rank (inclusive, 0-indexed).
+
+###### end
+
+`number`
+
+End rank (inclusive, 0-indexed).
+
+###### callback
+
+`C`
+
+Callback to apply to each node in the range.
+
+###### iterationType?
+
+`IterationType`
+
+Iteration strategy ('ITERATIVE' or 'RECURSIVE').
+
+##### Returns
+
+`ReturnType`\<`C`\>[]
+
+Array of callback results for nodes in the rank range.
+
+##### Remarks
+
+Time O(log n + k), Space O(k), where k = end - start + 1. Requires `enableOrderStatistic: true`.
+
+##### Inherited from
+
+[`BST`](BST.md).[`rangeByRank`](BST.md#rangebyrank)
+
+***
+
 ### rangeSearch()
 
 Performs an optimized search for nodes within a given key range.
@@ -3938,7 +4226,7 @@ The traversal method.
 rangeSearch(range): (K | undefined)[];
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:1069](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/bst.ts#L1069)
+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)
 
 Find all keys in a range
 
@@ -3976,7 +4264,7 @@ rangeSearch<C>(
    iterationType?): ReturnType<C>[];
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:1071](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/bst.ts#L1071)
+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)
 
 Find all keys in a range
 
@@ -4033,7 +4321,7 @@ Find all keys in a range
 reduce<U>(callbackfn, initialValue): U;
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:171](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/iterable-entry-base.ts#L171)
+Defined in: [data-structures/base/iterable-entry-base.ts:171](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-entry-base.ts#L171)
 
 Reduce entries into a single accumulator.
 
@@ -4079,56 +4367,6 @@ IBinaryTree.reduce
 
 ***
 
-### refill()
-
-```ts
-refill(keysNodesEntriesOrRaws, values?): void;
-```
-
-Defined in: [data-structures/binary-tree/binary-tree.ts:878](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/binary-tree.ts#L878)
-
-Clears the tree and refills it with new items.
-
-#### Parameters
-
-##### keysNodesEntriesOrRaws
-
-`Iterable`\<
-  \| `K`
-  \| `R`
-  \| \[`K` \| `null` \| `undefined`, `V` \| `undefined`\]
-  \| [`BinaryTreeNode`](BinaryTreeNode.md)\<`K`, `V`\>
-  \| `null`
-  \| `undefined`\>
-
-An iterable of items to set.
-
-##### values?
-
-`Iterable`\<`V` \| `undefined`, `any`, `any`\>
-
-An optional parallel iterable of values.
-
-#### Returns
-
-`void`
-
-#### Remarks
-
-Time O(N) (for `clear`) + O(N * M) (for `setMany`) = O(N * M). Space O(M) (from `setMany`).
-
-#### Implementation of
-
-```ts
-IBinaryTree.refill
-```
-
-#### Inherited from
-
-[`BST`](BST.md).[`refill`](BST.md#refill)
-
-***
-
 ### search()
 
 Searches the tree for nodes matching a predicate, key, or range.
@@ -4169,7 +4407,7 @@ Whether to use 'RECURSIVE' or 'ITERATIVE' search.
 search(keyNodeEntryOrPredicate, onlyOne?): (K | undefined)[];
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:882](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/bst.ts#L882)
+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)
 
 Search nodes by predicate
 
@@ -4225,7 +4463,7 @@ search<C>(
    iterationType?): ReturnType<C>[];
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:894](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/bst.ts#L894)
+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)
 
 Search nodes by predicate
 
@@ -4299,7 +4537,7 @@ IBinaryTree.search
 set(keyNodeOrEntry, value?): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/red-black-tree.ts:966](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/red-black-tree.ts#L966)
+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)
 
 Insert or update a key/value (map mode) or key-only (set mode).
 
@@ -4374,7 +4612,7 @@ setMany(
    iterationType?): boolean[];
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:1297](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/bst.ts#L1297)
+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)
 
 Adds multiple items to the tree.
 
@@ -4443,7 +4681,7 @@ setWithHint(
    hint?): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/red-black-tree.ts:832](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/red-black-tree.ts#L832)
+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)
 
 Boolean wrapper for setWithHintNode.
 
@@ -4480,7 +4718,7 @@ setWithHintNode(
    hint?): RedBlackTreeNode<K, V> | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/red-black-tree.ts:732](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/red-black-tree.ts#L732)
+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)
 
 Insert/update using a hint node to speed up nearby insertions.
 
@@ -4521,7 +4759,7 @@ Time O(log n) average, Space O(1)
 some(predicate, thisArg?): boolean;
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:83](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/iterable-entry-base.ts#L83)
+Defined in: [data-structures/base/iterable-entry-base.ts:83](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-entry-base.ts#L83)
 
 Test whether any entry satisfies the predicate.
 
@@ -4535,7 +4773,7 @@ Test whether any entry satisfies the predicate.
 
 ##### thisArg?
 
-`any`
+`unknown`
 
 Optional `this` for callback.
 
@@ -4567,7 +4805,7 @@ IBinaryTree.some
 toArray(): [K, V | undefined][];
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:186](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/iterable-entry-base.ts#L186)
+Defined in: [data-structures/base/iterable-entry-base.ts:186](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-entry-base.ts#L186)
 
 Converts data structure to `[key, value]` pairs.
 
@@ -4593,7 +4831,7 @@ Time O(n), Space O(n)
 toVisual(startNode?, options?): string;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:2657](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/binary-tree.ts#L2657)
+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)
 
 Generates a string representation of the tree for visualization.
 
@@ -4636,7 +4874,7 @@ Time O(N), visits every node. Space O(N*H) or O(N^2) in the worst case, as the s
 values(): IterableIterator<V | undefined>;
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:53](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/iterable-entry-base.ts#L53)
+Defined in: [data-structures/base/iterable-entry-base.ts:53](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-entry-base.ts#L53)
 
 Iterate over values only.
 
@@ -4671,7 +4909,7 @@ IBinaryTree.values
 protected readonly _comparator: Comparator<K>;
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:372](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/bst.ts#L372)
+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)
 
 The comparator function used to determine the order of keys in the tree.
 
@@ -4691,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:2916](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/binary-tree.ts#L2916)
+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)
 
 (Protected) Default callback function, returns the node's key.
 
@@ -4719,7 +4957,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/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/red-black-tree.ts#L291)
+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)
 
 (Internal) Header sentinel:
 - header.parent -> root
@@ -4739,7 +4977,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/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/red-black-tree.ts#L297)
+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)
 
 (Internal) Cache of the current minimum and maximum nodes.
 Used for fast-path insert/update when keys are monotonic or near-boundary.
@@ -4755,7 +4993,7 @@ protected _attachNewNode(
    node): void;
 ```
 
-Defined in: [data-structures/binary-tree/red-black-tree.ts:533](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/red-black-tree.ts#L533)
+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)
 
 (Internal) Attach a new node directly under a known parent/side (no search).
 
@@ -4800,7 +5038,7 @@ protected _bound(
    iterationType): BSTNode<K, V> | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:2499](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/bst.ts#L2499)
+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)
 
 (Protected) Core bound search implementation supporting all parameter types.
 Unified logic for both lowerBound and upperBound.
@@ -4852,7 +5090,7 @@ protected _boundByKey(
    iterationType): BSTNode<K, V> | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:2556](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/bst.ts#L2556)
+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)
 
 (Protected) Binary search for bound by key with pruning optimization.
 Performs standard BST binary search, choosing left or right subtree based on comparator result.
@@ -4897,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:2611](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/bst.ts#L2611)
+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)
 
 (Protected) In-order traversal search by predicate.
 Falls back to linear in-order traversal when predicate-based search is required.
@@ -4937,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:3350](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/binary-tree.ts#L3350)
+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)
 
 (Protected) Clears all nodes from the tree.
 
@@ -4961,7 +5199,7 @@ Time O(1)
 protected _clearValues(): void;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:3359](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/binary-tree.ts#L3359)
+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)
 
 (Protected) Clears all values from the external store.
 
@@ -4985,7 +5223,7 @@ Time O(N)
 protected _clone(cloned): void;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:3009](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/binary-tree.ts#L3009)
+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)
 
 (Protected) Helper for cloning. Performs a BFS and sets all nodes to the new tree.
 
@@ -5017,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:2751](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/bst.ts#L2751)
+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)
 
 (Protected) Compares two keys using the tree's comparator and reverse setting.
 
@@ -5057,7 +5295,7 @@ Time O(1) Space O(1)
 protected _createDefaultComparator(): Comparator<K>;
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:2224](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/bst.ts#L2224)
+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)
 
 (Protected) Creates the default comparator function for keys that don't have a custom comparator.
 
@@ -5083,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:1465](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/red-black-tree.ts#L1465)
+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)
 
 (Internal) Create an empty instance of the same concrete tree type.
 
@@ -5127,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:1477](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/red-black-tree.ts#L1477)
+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)
 
 (Internal) Create a like-kind tree (same concrete class) populated from an iterable.
 
@@ -5181,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:2762](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/bst.ts#L2762)
+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)
 
 (Private) Deletes a node by its key.
 
@@ -5215,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:1659](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/red-black-tree.ts#L1659)
+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)
 
 (Protected) Restore red-black properties after deletion (recolor/rotate).
 
@@ -5239,6 +5477,44 @@ Time O(log n) average, Space O(1)
 
 ***
 
+### \_deleteInternal()
+
+```ts
+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)
+
+**`Internal`**
+
+Deletes a node from the tree (internal, returns balancing metadata).
+
+#### Parameters
+
+##### keyNodeEntryRawOrPredicate
+
+  \| `BTNRep`\<`K`, `V`, [`BinaryTreeNode`](BinaryTreeNode.md)\<`K`, `V`\>\>
+  \| `NodePredicate`\<[`BinaryTreeNode`](BinaryTreeNode.md)\<`K`, `V`\> \| `null`\>
+
+The node to delete.
+
+#### Returns
+
+`BinaryTreeDeleteResult`\<[`BinaryTreeNode`](BinaryTreeNode.md)\<`K`, `V`\>\>[]
+
+An array containing deletion results with balancing metadata.
+
+#### Remarks
+
+Time O(N) — O(N) to find the node + O(H) for predecessor swap. Space O(1). BST/Red-Black Tree/AVL Tree subclasses override to O(log N).
+ Used by AVL/BST subclasses that need balancing metadata after deletion.
+
+#### Inherited from
+
+[`BST`](BST.md).[`_deleteInternal`](BST.md#_deleteinternal)
+
+***
+
 ### \_dfs()
 
 ```ts
@@ -5255,7 +5531,7 @@ protected _dfs<C>(
    shouldProcessRoot?): ReturnType<C>[];
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:2727](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/binary-tree.ts#L2727)
+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)
 
 #### Type Parameters
 
@@ -5348,7 +5624,7 @@ Array of callback results.
 protected _displayAux(node, options): NodeDisplayLayout;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:3033](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/binary-tree.ts#L3033)
+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)
 
 (Protected) Recursive helper for `toVisual`.
 
@@ -5388,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:3256](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/binary-tree.ts#L3256)
+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)
 
 (Protected) Converts a key, node, entry, or predicate into a standardized predicate function.
 
@@ -5427,7 +5703,7 @@ Time O(1)
 protected _extractKey(keyNodeOrEntry): K | null | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:3316](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/binary-tree.ts#L3316)
+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)
 
 (Protected) Extracts the key from a key, node, or entry.
 
@@ -5465,7 +5741,7 @@ Time O(1)
 protected _findNodeByKey(key): RedBlackTreeNode<K, V> | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/red-black-tree.ts:467](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/red-black-tree.ts#L467)
+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)
 
 (Internal) Find a node by key using a tight BST walk (no allocations).
 
@@ -5493,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:2264](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/bst.ts#L2264)
+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)
 
 (Protected) Binary search for floor by key with pruning optimization.
 Performs standard BST binary search, choosing left or right subtree based on comparator result.
@@ -5535,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:2317](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/bst.ts#L2317)
+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)
 
 (Protected) In-order traversal search for floor by predicate.
 Falls back to linear in-order traversal when predicate-based search is required.
@@ -5572,13 +5848,81 @@ Space Complexity: O(h) for recursion, O(h) for iterative stack.
 
 ***
 
+### \_getByRankIterative()
+
+```ts
+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)
+
+(Protected) Finds the node at position k in tree order (iterative).
+
+#### Parameters
+
+##### node
+
+`OptNode`\<[`BSTNode`](BSTNode.md)\<`K`, `V`\>\>
+
+##### k
+
+`number`
+
+#### Returns
+
+[`BSTNode`](BSTNode.md)\<`K`, `V`\> \| `undefined`
+
+#### Remarks
+
+Time O(log n), Space O(1)
+
+#### Inherited from
+
+[`BST`](BST.md).[`_getByRankIterative`](BST.md#_getbyrankiterative)
+
+***
+
+### \_getByRankRecursive()
+
+```ts
+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)
+
+(Protected) Finds the node at position k in tree order (recursive).
+
+#### Parameters
+
+##### node
+
+`OptNode`\<[`BSTNode`](BSTNode.md)\<`K`, `V`\>\>
+
+##### k
+
+`number`
+
+#### Returns
+
+[`BSTNode`](BSTNode.md)\<`K`, `V`\> \| `undefined`
+
+#### Remarks
+
+Time O(log n), Space O(log n) call stack
+
+#### Inherited from
+
+[`BST`](BST.md).[`_getByRankRecursive`](BST.md#_getbyrankrecursive)
+
+***
+
 ### \_getIterator()
 
 ```ts
 protected _getIterator(node?): IterableIterator<[K, V | undefined]>;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:2872](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/binary-tree.ts#L2872)
+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)
 
 (Protected) Gets the iterator for the tree (default in-order).
 
@@ -5606,13 +5950,81 @@ Time O(N) for full iteration. O(H) to get the first element. Space O(H) for the
 
 ***
 
+### \_getRankIterative()
+
+```ts
+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)
+
+(Protected) Computes the rank of a key iteratively.
+
+#### Parameters
+
+##### node
+
+`OptNode`\<[`BSTNode`](BSTNode.md)\<`K`, `V`\>\>
+
+##### key
+
+`K`
+
+#### Returns
+
+`number`
+
+#### Remarks
+
+Time O(log n), Space O(1)
+
+#### Inherited from
+
+[`BST`](BST.md).[`_getRankIterative`](BST.md#_getrankiterative)
+
+***
+
+### \_getRankRecursive()
+
+```ts
+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)
+
+(Protected) Computes the rank of a key recursively.
+
+#### Parameters
+
+##### node
+
+`OptNode`\<[`BSTNode`](BSTNode.md)\<`K`, `V`\>\>
+
+##### key
+
+`K`
+
+#### Returns
+
+`number`
+
+#### Remarks
+
+Time O(log n), Space O(log n) call stack
+
+#### Inherited from
+
+[`BST`](BST.md).[`_getRankRecursive`](BST.md#_getrankrecursive)
+
+***
+
 ### \_insert()
 
 ```ts
 protected _insert(node): CRUD;
 ```
 
-Defined in: [data-structures/binary-tree/red-black-tree.ts:1524](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/red-black-tree.ts#L1524)
+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)
 
 (Protected) Standard BST insert followed by red-black fix-up.
 
@@ -5642,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:1590](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/red-black-tree.ts#L1590)
+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)
 
 (Protected) Restore red-black properties after insertion (recolor/rotate).
 
@@ -5672,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:3128](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/binary-tree.ts#L3128)
+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)
 
 Check if a node is a display leaf (empty, null, undefined, NIL, or real leaf).
 
@@ -5702,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:3305](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/binary-tree.ts#L3305)
+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)
 
 (Protected) Checks if an item is a predicate function.
 
@@ -5710,7 +6122,7 @@ Defined in: [data-structures/binary-tree/binary-tree.ts:3305](https://github.com
 
 ##### p
 
-`any`
+`unknown`
 
 The item to check.
 
@@ -5736,7 +6148,7 @@ Time O(1)
 protected _keyValueNodeOrEntryToNodeAndValue(keyNodeOrEntry, value?): [OptNode<BSTNode<K, V>>, V | undefined];
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:2723](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/bst.ts#L2723)
+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)
 
 (Protected) Converts a key, node, or entry into a standardized [node, value] tuple.
 
@@ -5780,7 +6192,7 @@ Time O(1)
 protected _leftRotate(x): void;
 ```
 
-Defined in: [data-structures/binary-tree/red-black-tree.ts:1738](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/red-black-tree.ts#L1738)
+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)
 
 (Protected) Perform a left rotation around x.
 
@@ -5810,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:2382](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/bst.ts#L2382)
+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)
 
 (Protected) Binary search for lower by key with pruning optimization.
 Performs standard BST binary search, choosing left or right subtree based on comparator result.
@@ -5852,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:2435](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/bst.ts#L2435)
+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)
 
 (Protected) In-order traversal search for lower by predicate.
 Falls back to linear in-order traversal when predicate-based search is required.
@@ -5889,13 +6301,43 @@ Space Complexity: O(h) for recursion, O(h) for iterative stack.
 
 ***
 
+### \_next()
+
+```ts
+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)
+
+(Protected) Finds the in-order successor of a node.
+
+#### Parameters
+
+##### node
+
+[`BSTNode`](BSTNode.md)\<`K`, `V`\>
+
+#### Returns
+
+[`BSTNode`](BSTNode.md)\<`K`, `V`\> \| `undefined`
+
+#### Remarks
+
+Time O(log n), Space O(1)
+
+#### Inherited from
+
+[`BST`](BST.md).[`_next`](BST.md#_next)
+
+***
+
 ### \_predecessorOf()
 
 ```ts
 protected _predecessorOf(node): RedBlackTreeNode<K, V> | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/red-black-tree.ts:485](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/red-black-tree.ts#L485)
+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)
 
 (Internal) In-order predecessor of a node in a BST.
 
@@ -5921,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:1509](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/red-black-tree.ts#L1509)
+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)
 
 (Internal) Replace a node in place while preserving its color.
 
@@ -5958,7 +6400,7 @@ protected _resolveDisplayLeaf(
    emptyDisplayLayout): NodeDisplayLayout;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:3158](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/binary-tree.ts#L3158)
+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)
 
 Resolve a display leaf node to its layout.
 
@@ -5992,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:1770](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/red-black-tree.ts#L1770)
+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)
 
 (Protected) Perform a right rotation around y.
 
@@ -6022,7 +6464,7 @@ Time O(1), Space O(1)
 protected _setKV(key, nextValue?): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/red-black-tree.ts:708](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/red-black-tree.ts#L708)
+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)
 
 (Internal) Boolean wrapper around `_setKVNode`.
 
@@ -6063,7 +6505,7 @@ protected _setKVNode(key, nextValue?):
   | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/red-black-tree.ts:582](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/red-black-tree.ts#L582)
+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)
 
 (Internal) Core set implementation returning the affected node.
 
@@ -6107,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:563](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/red-black-tree.ts#L563)
+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)
 
 (Internal) Update max cache pointers (header._right is the canonical max pointer).
 
@@ -6133,7 +6575,7 @@ Time O(1), Space O(1)
 protected _setMinCache(node): void;
 ```
 
-Defined in: [data-structures/binary-tree/red-black-tree.ts:554](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/red-black-tree.ts#L554)
+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)
 
 (Internal) Update min cache pointers (header._left is the canonical min pointer).
 
@@ -6159,7 +6601,7 @@ Time O(1), Space O(1)
 protected _setRoot(v): void;
 ```
 
-Defined in: [data-structures/binary-tree/red-black-tree.ts:1494](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/red-black-tree.ts#L1494)
+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)
 
 (Internal) Set the root pointer and keep header.parent in sync.
 
@@ -6189,7 +6631,7 @@ Time O(1), Space O(1)
 protected _setValue(key, value): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:3337](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/binary-tree.ts#L3337)
+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)
 
 (Protected) Sets a value in the external store (Map mode).
 
@@ -6229,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:2708](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/bst.ts#L2708)
+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)
 
 (Protected) Snapshots the current BST's configuration options.
 
@@ -6269,7 +6711,7 @@ Time O(1)
 protected _successorOf(node): RedBlackTreeNode<K, V> | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/red-black-tree.ts:505](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/red-black-tree.ts#L505)
+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)
 
 (Internal) In-order successor of a node in a BST.
 
@@ -6295,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:3184](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/binary-tree.ts#L3184)
+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)
 
 (Protected) Swaps the key/value properties of two nodes.
 
@@ -6343,7 +6785,7 @@ Time O(1)
 protected _transplant(u, v): void;
 ```
 
-Defined in: [data-structures/binary-tree/red-black-tree.ts:1570](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/red-black-tree.ts#L1570)
+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)
 
 (Protected) Transplant a subtree in place of another during deletion.
 
@@ -6372,3 +6814,63 @@ void
 Time O(1), Space O(1)
 
 ***
+
+### \_updateCount()
+
+```ts
+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)
+
+(Protected) Recalculates the subtree count for a single node.
+
+#### Parameters
+
+##### node
+
+[`BSTNode`](BSTNode.md)\<`K`, `V`\>
+
+#### Returns
+
+`void`
+
+#### Remarks
+
+Time O(1). Only active when enableOrderStatistic is true.
+
+#### Inherited from
+
+[`BST`](BST.md).[`_updateCount`](BST.md#_updatecount)
+
+***
+
+### \_updateCountAlongPath()
+
+```ts
+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)
+
+(Protected) Updates subtree counts from a node up to the root.
+
+#### Parameters
+
+##### node
+
+`OptNode`\<[`BSTNode`](BSTNode.md)\<`K`, `V`\>\>
+
+#### Returns
+
+`void`
+
+#### Remarks
+
+Time O(log n). Only active when enableOrderStatistic is true.
+
+#### Inherited from
+
+[`BST`](BST.md).[`_updateCountAlongPath`](BST.md#_updatecountalongpath)
+
+***