data-structure-typed 2.5.2 → 2.5.3

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

@@ -6,7 +6,7 @@
 
 # Class: BinaryTree\<K, V, R\>
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:270](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L270)
+Defined in: [data-structures/binary-tree/binary-tree.ts:270](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L270)
 
 A general Binary Tree implementation.
 
@@ -29,7 +29,7 @@ The `set` operation inserts nodes level-by-level (BFS) into the first available
       node?: BinaryTreeNode<string> | null,
       conditions?: { [key: string]: boolean }
     ): string {
-      if (!node) raise(Error, 'Invalid node');
+      if (!node) throw new Error('Invalid node');
 
       // If it's a leaf node, return the decision result
       if (!node.left && !node.right) return node.key;
@@ -76,7 +76,7 @@ The `set` operation inserts nodes level-by-level (BFS) into the first available
         case '/':
           return rightValue !== 0 ? leftValue / rightValue : 0; // Handle division by zero
         default:
-          raise(Error, `Unsupported operator: ${node.key}`);
+          throw new Error(`Unsupported operator: ${node.key}`);
       }
     }
 
@@ -128,7 +128,7 @@ The type of the raw data object (if using `toEntryFn`).
 new BinaryTree<K, V, R>(keysNodesEntriesOrRaws?, options?): BinaryTree<K, V, R>;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:283](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L283)
+Defined in: [data-structures/binary-tree/binary-tree.ts:283](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L283)
 
 Creates an instance of BinaryTree.
 
@@ -176,7 +176,7 @@ IterableEntryBase<K, V | undefined>.constructor
 get isDuplicate(): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:322](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/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.
 
@@ -206,7 +206,7 @@ IBinaryTree.isDuplicate
 get isMapMode(): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:310](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/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.
 
@@ -236,7 +236,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/8292cb978daf85ebe846186c7c7572aece04fb7b/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).
 
@@ -266,7 +266,7 @@ IBinaryTree.NIL
 get root(): BinaryTreeNode<K, V> | null | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:349](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L349)
+Defined in: [data-structures/binary-tree/binary-tree.ts:349](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L349)
 
 Gets the root node of the tree.
 
@@ -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/8292cb978daf85ebe846186c7c7572aece04fb7b/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/8292cb978daf85ebe846186c7c7572aece04fb7b/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).
 
@@ -360,7 +360,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/8292cb978daf85ebe846186c7c7572aece04fb7b/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.
 
@@ -388,7 +388,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/8292cb978daf85ebe846186c7c7572aece04fb7b/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.
 
@@ -426,7 +426,7 @@ IBinaryTree.[iterator]
 add(keyNodeOrEntry): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:608](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L608)
+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.
 
@@ -452,7 +452,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
 
@@ -480,7 +480,7 @@ IBinaryTree.add
 addMany(keysNodesEntriesOrRaws): boolean[];
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:781](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L781)
+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.
 
@@ -561,7 +561,7 @@ If true, includes null nodes in the traversal.
 bfs(): (K | undefined)[];
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:2191](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L2191)
+Defined in: [data-structures/binary-tree/binary-tree.ts:2249](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2249)
 
 BinaryTree level-order traversal
 
@@ -618,7 +618,7 @@ bfs<C>(
    includeNull?): ReturnType<C>[];
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:2193](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L2193)
+Defined in: [data-structures/binary-tree/binary-tree.ts:2251](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2251)
 
 BinaryTree level-order traversal
 
@@ -702,7 +702,7 @@ bfs<C>(
    includeNull?): ReturnType<C>[];
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:2200](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L2200)
+Defined in: [data-structures/binary-tree/binary-tree.ts:2258](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2258)
 
 BinaryTree level-order traversal
 
@@ -784,7 +784,7 @@ IBinaryTree.bfs
 clear(): void;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:1509](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L1509)
+Defined in: [data-structures/binary-tree/binary-tree.ts:1543](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1543)
 
 Clears the tree of all nodes and values.
 
@@ -825,7 +825,7 @@ IBinaryTree.clear
 clone(): this;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:2697](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L2697)
+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.
 
@@ -869,7 +869,7 @@ IBinaryTree.clone
 createNode(key, value?): BinaryTreeNode<K, V>;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:397](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L397)
+Defined in: [data-structures/binary-tree/binary-tree.ts:397](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L397)
 
 (Protected) Creates a new node.
 
@@ -911,7 +911,7 @@ IBinaryTree.createNode
 createTree(options?): this;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:408](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/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<BinaryTreeNode<K, V>>[];
+delete(keyNodeEntryRawOrPredicate): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:971](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L971)
+Defined in: [data-structures/binary-tree/binary-tree.ts:1039](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1039)
 
 Deletes a node from the tree.
 
@@ -962,15 +962,15 @@ The node to delete.
 
 #### Returns
 
-`BinaryTreeDeleteResult`\<[`BinaryTreeNode`](BinaryTreeNode.md)\<`K`, `V`\>\>[]
+`boolean`
 
-An array containing deletion results (for compatibility with self-balancing trees).
+True if the node was found and deleted, 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 finds the node, and if it has two children, swaps it with the rightmost node of its left subtree (in-order predecessor) before deleting. Time O(N) in the worst case. O(N) to find the node (`getNode`) and O(H) (which is O(N) worst-case) to find the rightmost node. Space O(1) (if `getNode` is iterative, which it is).
+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).
 
 #### Example
 
@@ -1032,7 +1032,7 @@ If true, includes null nodes in the traversal.
 dfs(): (K | undefined)[];
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:2081](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L2081)
+Defined in: [data-structures/binary-tree/binary-tree.ts:2135](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2135)
 
 Depth-first search traversal
 
@@ -1068,7 +1068,7 @@ dfs<C>(
    iterationType?): ReturnType<C>[];
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:2083](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L2083)
+Defined in: [data-structures/binary-tree/binary-tree.ts:2137](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2137)
 
 Depth-first search traversal
 
@@ -1136,7 +1136,7 @@ dfs<C>(
    includeNull?): ReturnType<C>[];
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:2091](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L2091)
+Defined in: [data-structures/binary-tree/binary-tree.ts:2145](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2145)
 
 Depth-first search traversal
 
@@ -1204,7 +1204,7 @@ IBinaryTree.dfs
 ensureNode(keyNodeOrEntry, iterationType?): BinaryTreeNode<K, V> | null | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:420](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L420)
+Defined in: [data-structures/binary-tree/binary-tree.ts:420](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L420)
 
 Ensures the input is a node. If it's a key or entry, it searches for the node.
 
@@ -1244,7 +1244,7 @@ Time O(1) if a node is passed. O(N) if a key or entry is passed (due to `getNode
 entries(): IterableIterator<[K, V | undefined]>;
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:31](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/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).
 
@@ -1276,7 +1276,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/8292cb978daf85ebe846186c7c7572aece04fb7b/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.
 
@@ -1322,7 +1322,7 @@ IBinaryTree.every
 filter(predicate, thisArg?): this;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:2749](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L2749)
+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.
 
@@ -1379,7 +1379,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/8292cb978daf85ebe846186c7c7572aece04fb7b/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.
 
@@ -1425,7 +1425,7 @@ IBinaryTree.find
 forEach(callbackfn, thisArg?): void;
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:99](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/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.
 
@@ -1472,7 +1472,7 @@ get(
    iterationType?): V | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:1349](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L1349)
+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.
 
@@ -1513,7 +1513,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
 
@@ -1542,7 +1542,7 @@ IBinaryTree.get
 getDepth(dist, startNode?): number;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:1710](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L1710)
+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`).
 
@@ -1602,7 +1602,7 @@ IBinaryTree.getDepth
 getHeight(startNode?, iterationType?): number;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:1774](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L1774)
+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).
 
@@ -1681,7 +1681,7 @@ The traversal method.
 getLeftMost(): K | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:1901](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L1901)
+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
 
@@ -1702,7 +1702,7 @@ getLeftMost<C>(
 iterationType?): ReturnType<C>;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:1903](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L1903)
+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
 
@@ -1745,7 +1745,7 @@ IBinaryTree.getLeftMost
 getMinHeight(startNode?, iterationType?): number;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:1816](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L1816)
+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).
 
@@ -1793,7 +1793,7 @@ getNode(
    iterationType?): BinaryTreeNode<K, V> | null | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:1279](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L1279)
+Defined in: [data-structures/binary-tree/binary-tree.ts:1301](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1301)
 
 Gets the first node matching a predicate.
 
@@ -1835,7 +1835,7 @@ The first matching node, or undefined if not found.
 
 #### 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
 
@@ -1863,7 +1863,7 @@ getNodes(
    iterationType?): BinaryTreeNode<K, V>[];
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:1205](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L1205)
+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.
 
@@ -1954,7 +1954,7 @@ If true, returns the path from root-to-node.
 getPathToRoot(beginNode): (K | undefined)[];
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:1863](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L1863)
+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
 
@@ -1985,7 +1985,7 @@ getPathToRoot<C>(
    isReverse?): ReturnType<C>[];
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:1867](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L1867)
+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
 
@@ -2029,7 +2029,7 @@ IBinaryTree.getPathToRoot
 getPredecessor(node): BinaryTreeNode<K, V>;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:2001](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L2001)
+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).
 
@@ -2083,7 +2083,7 @@ The traversal method.
 getRightMost(): K | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:1948](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L1948)
+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
 
@@ -2104,7 +2104,7 @@ getRightMost<C>(
 iterationType?): ReturnType<C>;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:1950](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L1950)
+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
 
@@ -2147,7 +2147,7 @@ IBinaryTree.getRightMost
 getSuccessor(x?): BinaryTreeNode<K, V> | null | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:2022](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L2022)
+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.
 
@@ -2180,7 +2180,7 @@ has(
    iterationType?): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:1434](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L1434)
+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.
 
@@ -2221,7 +2221,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
 
@@ -2273,7 +2273,7 @@ IBinaryTree.has
 hasValue(value): boolean;
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:143](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/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.
 
@@ -2313,7 +2313,7 @@ IBinaryTree.hasValue
 isBST(startNode?, iterationType?): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:1619](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L1619)
+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).
 
@@ -2369,7 +2369,7 @@ IBinaryTree.isBST
 isEmpty(): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:1556](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L1556)
+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.
 
@@ -2410,7 +2410,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/8292cb978daf85ebe846186c7c7572aece04fb7b/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.
 
@@ -2444,7 +2444,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/8292cb978daf85ebe846186c7c7572aece04fb7b/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).
 
@@ -2478,7 +2478,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/8292cb978daf85ebe846186c7c7572aece04fb7b/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.
 
@@ -2512,7 +2512,7 @@ Time O(1), Space O(1)
 isNode(keyNodeOrEntry): keyNodeOrEntry is BinaryTreeNode<K, V>;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:447](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L447)
+Defined in: [data-structures/binary-tree/binary-tree.ts:447](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L447)
 
 Checks if the given item is a `BinaryTreeNode` instance.
 
@@ -2546,7 +2546,7 @@ Time O(1), Space O(1)
 isPerfectlyBalanced(startNode?): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:1567](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L1567)
+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.
 
@@ -2585,7 +2585,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/8292cb978daf85ebe846186c7c7572aece04fb7b/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.
 
@@ -2621,7 +2621,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/8292cb978daf85ebe846186c7c7572aece04fb7b/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`.
 
@@ -2656,7 +2656,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/8292cb978daf85ebe846186c7c7572aece04fb7b/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).
 
@@ -2690,7 +2690,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/8292cb978daf85ebe846186c7c7572aece04fb7b/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.
 
@@ -2724,7 +2724,7 @@ Time O(1), Space O(1)
 isValidKey(key): key is K;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:558](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L558)
+Defined in: [data-structures/binary-tree/binary-tree.ts:558](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L558)
 
 Checks if the given key is valid (comparable or null).
 
@@ -2754,7 +2754,7 @@ Time O(1), Space O(1)
 keys(): IterableIterator<K>;
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:42](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/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.
 
@@ -2810,7 +2810,7 @@ The traversal method.
 leaves(): (K | undefined)[];
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:2316](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L2316)
+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
 
@@ -2844,7 +2844,7 @@ leaves<C>(
    iterationType?): ReturnType<C>[];
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:2318](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L2318)
+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
 
@@ -2928,7 +2928,7 @@ If true, includes null nodes.
 listLevels(): (K | undefined)[][];
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:2417](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L2417)
+Defined in: [data-structures/binary-tree/binary-tree.ts:2483](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2483)
 
 Level-order grouping
 
@@ -2964,7 +2964,7 @@ listLevels<C>(
    includeNull?): ReturnType<C>[][];
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:2419](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L2419)
+Defined in: [data-structures/binary-tree/binary-tree.ts:2485](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2485)
 
 Level-order grouping
 
@@ -3027,7 +3027,7 @@ listLevels<C>(
    includeNull?): ReturnType<C>[][];
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:2426](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L2426)
+Defined in: [data-structures/binary-tree/binary-tree.ts:2492](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2492)
 
 Level-order grouping
 
@@ -3091,7 +3091,7 @@ map<MK, MV, MR>(
 thisArg?): BinaryTree<MK, MV, MR>;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:2806](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L2806)
+Defined in: [data-structures/binary-tree/binary-tree.ts:2888](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2888)
 
 Creates a new tree by mapping each [key, value] pair to a new entry.
 
@@ -3174,7 +3174,7 @@ IBinaryTree.map
 merge(anotherTree): void;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:902](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L902)
+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.
 
@@ -3244,7 +3244,7 @@ The node to start from.
 morris(): (K | undefined)[];
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:2534](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L2534)
+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)
 
@@ -3278,7 +3278,7 @@ morris<C>(
    startNode?): ReturnType<C>[];
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:2536](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L2536)
+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)
 
@@ -3334,7 +3334,7 @@ IBinaryTree.morris
 print(options?, startNode?): void;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:2895](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L2895)
+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.
 
@@ -3385,7 +3385,7 @@ Time O(N) (via `toVisual`). Space O(N*H) or O(N^2) (via `toVisual`).
 reduce<U>(callbackfn, initialValue): U;
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:171](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/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.
 
@@ -3431,59 +3431,13 @@ IBinaryTree.reduce
 
 ***
 
-### refill()
-
-```ts
-refill(keysNodesEntriesOrRaws, values?): void;
-```
-
-Defined in: [data-structures/binary-tree/binary-tree.ts:913](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L913)
-
-Clears the tree and refills it with new items.
-
-#### Parameters
-
-##### keysNodesEntriesOrRaws
-
-`Iterable`\<
-  \| `K`
-  \| `R`
-  \| [`BinaryTreeNode`](BinaryTreeNode.md)\<`K`, `V`\>
-  \| \[`K` \| `null` \| `undefined`, `V` \| `undefined`\]
-  \| `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
-```
-
-***
-
 ### search()
 
 Searches the tree for nodes matching a predicate.
 
 #### Remarks
 
-Time O(log N), For BST, Red-Black Tree, and AVL Tree subclasses, the worst-case time is O(log N). Performs a full DFS (pre-order) scan of the tree. Time O(N), as it may visit every node. Space O(H) for the call stack (recursive) or explicit stack (iterative), where H is the tree height (O(N) worst-case).
+Time O(N) — full DFS scan; may visit every node. Space O(H) for call/explicit stack (O(N) worst-case). BST subclasses with key search override to O(log N).
 
 #### Template
 
@@ -3515,7 +3469,7 @@ Whether to use 'RECURSIVE' or 'ITERATIVE' search.
 search(keyNodeEntryOrPredicate, onlyOne?): (K | undefined)[];
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:1069](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L1069)
+Defined in: [data-structures/binary-tree/binary-tree.ts:1083](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1083)
 
 Search by predicate
 
@@ -3566,7 +3520,7 @@ search<C>(
    iterationType?): ReturnType<C>[];
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:1080](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L1080)
+Defined in: [data-structures/binary-tree/binary-tree.ts:1094](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1094)
 
 Search by predicate
 
@@ -3635,7 +3589,7 @@ IBinaryTree.search
 set(keyNodeOrEntry, value?): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:680](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L680)
+Defined in: [data-structures/binary-tree/binary-tree.ts:688](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L688)
 
 Adds or updates a new node to the tree.
 
@@ -3667,7 +3621,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 sets 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
 
@@ -3710,7 +3664,7 @@ IBinaryTree.set
 setMany(keysNodesEntriesOrRaws, values?): boolean[];
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:828](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L828)
+Defined in: [data-structures/binary-tree/binary-tree.ts:844](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L844)
 
 Adds or updates multiple items to the tree.
 
@@ -3763,7 +3717,7 @@ Time O(N * M), where N is the number of items to set and M is the size of the tr
 some(predicate, thisArg?): boolean;
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:83](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/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.
 
@@ -3809,7 +3763,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/8292cb978daf85ebe846186c7c7572aece04fb7b/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.
 
@@ -3835,7 +3789,7 @@ Time O(n), Space O(n)
 toVisual(startNode?, options?): string;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:2825](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L2825)
+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.
 
@@ -3878,7 +3832,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/8292cb978daf85ebe846186c7c7572aece04fb7b/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.
 
@@ -3913,7 +3867,7 @@ IBinaryTree.values
 protected readonly _DEFAULT_NODE_CALLBACK: NodeCallback<BinaryTreeNode<K, V> | null | undefined, K | undefined>;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:3091](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L3091)
+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.
 
@@ -3937,7 +3891,7 @@ The node's key or undefined.
 protected _clearNodes(): void;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:3525](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L3525)
+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.
 
@@ -3957,7 +3911,7 @@ Time O(1)
 protected _clearValues(): void;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:3534](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L3534)
+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.
 
@@ -3977,7 +3931,7 @@ Time O(N)
 protected _clone(cloned): void;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:3184](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L3184)
+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.
 
@@ -4005,7 +3959,7 @@ Time O(N * M) (O(N) BFS + O(M) `set` for each node).
 protected _createInstance<TK, TV, TR>(options?): this;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:3118](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L3118)
+Defined in: [data-structures/binary-tree/binary-tree.ts:3204](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L3204)
 
 (Protected) Creates a new, empty instance of the same tree constructor.
 
@@ -4049,7 +4003,7 @@ Time O(1)
 protected _createLike<TK, TV, TR>(iter?, options?): BinaryTree<TK, TV, TR>;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:3135](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L3135)
+Defined in: [data-structures/binary-tree/binary-tree.ts:3221](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L3221)
 
 (Protected) Creates a new instance of the same tree constructor, potentially with different generic types.
 
@@ -4099,6 +4053,40 @@ Time O(N) (or as per constructor) due to processing the iterable.
 
 ***
 
+### \_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.
+
+***
+
 ### \_dfs()
 
 ```ts
@@ -4115,7 +4103,7 @@ protected _dfs<C>(
    shouldProcessRoot?): ReturnType<C>[];
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:2902](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L2902)
+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
 
@@ -4204,7 +4192,7 @@ Array of callback results.
 protected _displayAux(node, options): NodeDisplayLayout;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:3208](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L3208)
+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`.
 
@@ -4240,7 +4228,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:3431](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L3431)
+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.
 
@@ -4275,7 +4263,7 @@ Time O(1)
 protected _extractKey(keyNodeOrEntry): K | null | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:3491](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L3491)
+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.
 
@@ -4309,7 +4297,7 @@ Time O(1)
 protected _getIterator(node?): IterableIterator<[K, V | undefined]>;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:3047](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L3047)
+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).
 
@@ -4343,7 +4331,7 @@ Time O(N) for full iteration. O(H) to get the first element. Space O(H) for the
 protected _isDisplayLeaf(node, options): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:3303](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L3303)
+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).
 
@@ -4369,7 +4357,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:3480](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L3480)
+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.
 
@@ -4399,7 +4387,7 @@ Time O(1)
 protected _keyValueNodeOrEntryToNodeAndValue(keyNodeOrEntry, value?): [BinaryTreeNode<K, V> | null | undefined, V | undefined];
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:3158](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L3158)
+Defined in: [data-structures/binary-tree/binary-tree.ts:3244](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L3244)
 
 (Protected) Converts a key, node, or entry into a standardized [node, value] tuple.
 
@@ -4439,7 +4427,7 @@ Time O(1)
 protected _replaceNode(oldNode, newNode): BinaryTreeNode<K, V>;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:3393](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L3393)
+Defined in: [data-structures/binary-tree/binary-tree.ts:3479](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L3479)
 
 (Protected) Replaces a node in the tree with a new node, maintaining children and parent links.
 
@@ -4478,7 +4466,7 @@ protected _resolveDisplayLeaf(
    emptyDisplayLayout): NodeDisplayLayout;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:3333](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L3333)
+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.
 
@@ -4508,7 +4496,7 @@ Resolve a display leaf node to its layout.
 protected _setRoot(v): void;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:3417](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L3417)
+Defined in: [data-structures/binary-tree/binary-tree.ts:3503](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L3503)
 
 (Protected) Sets the root node and clears its parent reference.
 
@@ -4536,7 +4524,7 @@ Time O(1)
 protected _setValue(key, value): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:3512](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L3512)
+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).
 
@@ -4572,7 +4560,7 @@ Time O(1) (average for Map.set).
 protected _snapshotOptions<TK, TV, TR>(): BinaryTreeOptions<TK, TV, TR>;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:3101](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L3101)
+Defined in: [data-structures/binary-tree/binary-tree.ts:3187](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L3187)
 
 (Protected) Snapshots the current tree's configuration options.
 
@@ -4608,7 +4596,7 @@ Time O(1)
 protected _swapProperties(srcNode, destNode): BinaryTreeNode<K, V> | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:3359](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-tree.ts#L3359)
+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.