data-structure-typed 2.6.1 → 2.6.2

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/main/src/data-structures/binary-tree/binary-tree.ts#L270)
+Defined in: [data-structures/binary-tree/binary-tree.ts:271](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L271)
 
 A general Binary Tree implementation.
 
@@ -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/main/src/data-structures/binary-tree/binary-tree.ts#L283)
+Defined in: [data-structures/binary-tree/binary-tree.ts:288](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L288)
 
 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/main/src/data-structures/binary-tree/binary-tree.ts#L322)
+Defined in: [data-structures/binary-tree/binary-tree.ts:326](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L326)
 
 Gets whether the tree allows duplicate keys.
 
@@ -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/main/src/data-structures/binary-tree/binary-tree.ts#L310)
+Defined in: [data-structures/binary-tree/binary-tree.ts:316](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L316)
 
 Gets whether the tree is in Map mode.
 
@@ -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/main/src/data-structures/binary-tree/binary-tree.ts#L349)
+Defined in: [data-structures/binary-tree/binary-tree.ts:351](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L351)
 
 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/main/src/data-structures/binary-tree/binary-tree.ts#L361)
+Defined in: [data-structures/binary-tree/binary-tree.ts:363](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L363)
 
 Gets the number of nodes in the tree.
 
@@ -330,7 +330,7 @@ IBinaryTree.size
 get store(): Map<K, BinaryTreeNode<K, V>>;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:337](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L337)
+Defined in: [data-structures/binary-tree/binary-tree.ts:339](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L339)
 
 Gets the external value store (used in Map mode).
 
@@ -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/main/src/data-structures/binary-tree/binary-tree.ts#L385)
+Defined in: [data-structures/binary-tree/binary-tree.ts:383](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L383)
 
 Gets the function used to convert raw data objects (R) into [key, value] entries.
 
@@ -426,7 +426,7 @@ IBinaryTree.[iterator]
 add(keyNodeOrEntry): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:615](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L615)
+Defined in: [data-structures/binary-tree/binary-tree.ts:609](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L609)
 
 Adds a new node to the tree.
 
@@ -448,8 +448,6 @@ The key, node, or entry to add.
 
 True if the addition was successful, false otherwise.
 
- *
-
 #### Remarks
 
 Time O(N) — level-order traversal to find an empty slot. Space O(N) for the BFS queue. BST/Red-Black Tree/AVL Tree subclasses override to O(log N).
@@ -480,7 +478,7 @@ IBinaryTree.add
 addMany(keysNodesEntriesOrRaws): boolean[];
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:802](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L802)
+Defined in: [data-structures/binary-tree/binary-tree.ts:711](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L711)
 
 Adds multiple items to the tree.
 
@@ -504,8 +502,6 @@ An iterable of items to set.
 
 An array of booleans indicating the success of each individual `set` operation.
 
- *
-
 #### Remarks
 
 Time O(N * M), where N is the number of items to set and M is the size of the tree at insertion (due to O(M) `set` operation). Space O(M) (from `set`) + O(N) (for the `inserted` array).
@@ -561,12 +557,10 @@ If true, includes null nodes in the traversal.
 bfs(): (K | undefined)[];
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:2303](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2303)
+Defined in: [data-structures/binary-tree/binary-tree.ts:1563](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1563)
 
 BinaryTree level-order traversal
 
- *
-
 ##### Returns
 
 (`K` \| `undefined`)[]
@@ -618,12 +612,10 @@ bfs<C>(
    includeNull?): ReturnType<C>[];
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:2305](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2305)
+Defined in: [data-structures/binary-tree/binary-tree.ts:1565](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1565)
 
 BinaryTree level-order traversal
 
- *
-
 ##### Type Parameters
 
 ###### C
@@ -702,12 +694,10 @@ bfs<C>(
    includeNull?): ReturnType<C>[];
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:2312](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2312)
+Defined in: [data-structures/binary-tree/binary-tree.ts:1572](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1572)
 
 BinaryTree level-order traversal
 
- *
-
 ##### Type Parameters
 
 ###### C
@@ -784,7 +774,7 @@ IBinaryTree.bfs
 clear(): void;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:1579](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1579)
+Defined in: [data-structures/binary-tree/binary-tree.ts:1087](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1087)
 
 Clears the tree of all nodes and values.
 
@@ -796,8 +786,6 @@ Clears the tree of all nodes and values.
 
 Time O(N) if in Map mode (due to `_store.clear()`), O(1) otherwise. Space O(1)
 
- *
-
 #### Example
 
 ```ts
@@ -825,7 +813,7 @@ IBinaryTree.clear
 clone(): this;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:2837](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2837)
+Defined in: [data-structures/binary-tree/binary-tree.ts:1939](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1939)
 
 Clones the tree.
 
@@ -835,8 +823,6 @@ Clones the tree.
 
 A new, cloned instance of the tree.
 
- *
-
 #### Remarks
 
 Time O(N * M), where N is the number of nodes and M is the tree size during insertion (due to `bfs` + `set`, and `set` is O(M)). Space O(N) for the new tree and the BFS queue.
@@ -869,7 +855,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/main/src/data-structures/binary-tree/binary-tree.ts#L397)
+Defined in: [data-structures/binary-tree/binary-tree.ts:428](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L428)
 
 (Protected) Creates a new node.
 
@@ -911,7 +897,7 @@ IBinaryTree.createNode
 createTree(options?): this;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:408](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L408)
+Defined in: [data-structures/binary-tree/binary-tree.ts:439](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L439)
 
 Creates a new, empty tree of the same type and configuration.
 
@@ -947,7 +933,7 @@ IBinaryTree.createTree
 delete(keyNodeEntryRawOrPredicate): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:1057](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1057)
+Defined in: [data-structures/binary-tree/binary-tree.ts:794](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L794)
 
 Deletes a node from the tree.
 
@@ -966,8 +952,6 @@ The node to delete.
 
 True if the node was found and deleted, false otherwise.
 
- *
-
 #### 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).
@@ -1032,12 +1016,10 @@ If true, includes null nodes in the traversal.
 dfs(): (K | undefined)[];
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:2186](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2186)
+Defined in: [data-structures/binary-tree/binary-tree.ts:1488](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1488)
 
 Depth-first search traversal
 
- *
-
 ##### Returns
 
 (`K` \| `undefined`)[]
@@ -1068,12 +1050,10 @@ dfs<C>(
    iterationType?): ReturnType<C>[];
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:2188](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2188)
+Defined in: [data-structures/binary-tree/binary-tree.ts:1490](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1490)
 
 Depth-first search traversal
 
- *
-
 ##### Type Parameters
 
 ###### C
@@ -1136,12 +1116,10 @@ dfs<C>(
    includeNull?): ReturnType<C>[];
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:2196](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2196)
+Defined in: [data-structures/binary-tree/binary-tree.ts:1498](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1498)
 
 Depth-first search traversal
 
- *
-
 ##### Type Parameters
 
 ###### C
@@ -1204,7 +1182,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/main/src/data-structures/binary-tree/binary-tree.ts#L420)
+Defined in: [data-structures/binary-tree/binary-tree.ts:451](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L451)
 
 Ensures the input is a node. If it's a key or entry, it searches for the node.
 
@@ -1322,7 +1300,7 @@ IBinaryTree.every
 filter(predicate, thisArg?): this;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:2896](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2896)
+Defined in: [data-structures/binary-tree/binary-tree.ts:1958](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1958)
 
 Creates a new tree containing only the entries that satisfy the predicate.
 
@@ -1346,8 +1324,6 @@ A function to test each [key, value] pair.
 
 A new, filtered tree.
 
- *
-
 #### Remarks
 
 Time O(N * M), where N is nodes in this tree, and M is size of the new tree during insertion (O(N) iteration + O(M) `set` for each item). Space O(N) for the new tree.
@@ -1472,7 +1448,7 @@ get(
    iterationType?): V | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:1405](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1405)
+Defined in: [data-structures/binary-tree/binary-tree.ts:995](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L995)
 
 Gets the value associated with a key.
 
@@ -1509,8 +1485,6 @@ The traversal method (if not in Map mode).
 
 The associated value, or undefined.
 
- *
-
 #### Remarks
 
 Time O(1) in Map mode, O(N) otherwise (via `getNode`). Space O(1) in Map mode, O(H) or O(N) otherwise. BST subclasses override non-Map-mode to O(log N).
@@ -1519,7 +1493,11 @@ Time O(1) in Map mode, O(N) otherwise (via `getNode`). Space O(1) in Map mode, O
 
 ```ts
 // Retrieve value by key
- const tree = new BinaryTree<number, string>([[1, 'root'], [2, 'left'], [3, 'right']]);
+ const tree = new BinaryTree<number, string>([
+      [1, 'root'],
+      [2, 'left'],
+      [3, 'right']
+    ]);
     console.log(tree.get(2)); // 'left';
     console.log(tree.get(99)); // undefined;
 ```
@@ -1542,7 +1520,7 @@ IBinaryTree.get
 getDepth(dist, startNode?): number;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:1801](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1801)
+Defined in: [data-structures/binary-tree/binary-tree.ts:1187](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1187)
 
 Gets the depth of a node (distance from `startNode`).
 
@@ -1573,8 +1551,6 @@ The node to measure depth from (defaults to root).
 
 The depth (0 if `dist` is `startNode`).
 
- *
-
 #### Remarks
 
 Time O(H), where H is the depth of the `dist` node relative to `startNode`. O(N) worst-case. Space O(1).
@@ -1602,7 +1578,7 @@ IBinaryTree.getDepth
 getHeight(startNode?, iterationType?): number;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:1872](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1872)
+Defined in: [data-structures/binary-tree/binary-tree.ts:1216](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1216)
 
 Gets the maximum height of the tree (longest path from startNode to a leaf).
 
@@ -1629,8 +1605,6 @@ The traversal method.
 
 The height ( -1 for an empty tree, 0 for a single-node tree).
 
- *
-
 #### Remarks
 
 Time O(N), as it must visit every node. Space O(H) for recursive stack (O(N) worst-case) or O(N) for iterative stack (storing node + depth).
@@ -1681,7 +1655,7 @@ The traversal method.
 getLeftMost(): K | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:1999](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1999)
+Defined in: [data-structures/binary-tree/binary-tree.ts:1343](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1343)
 
 ##### Returns
 
@@ -1702,7 +1676,7 @@ getLeftMost<C>(
 iterationType?): ReturnType<C>;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:2001](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2001)
+Defined in: [data-structures/binary-tree/binary-tree.ts:1345](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1345)
 
 ##### Type Parameters
 
@@ -1745,7 +1719,7 @@ IBinaryTree.getLeftMost
 getMinHeight(startNode?, iterationType?): number;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:1914](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1914)
+Defined in: [data-structures/binary-tree/binary-tree.ts:1258](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1258)
 
 Gets the minimum height of the tree (shortest path from startNode to a leaf).
 
@@ -1793,7 +1767,7 @@ getNode(
    iterationType?): BinaryTreeNode<K, V> | null | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:1328](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1328)
+Defined in: [data-structures/binary-tree/binary-tree.ts:956](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L956)
 
 Gets the first node matching a predicate.
 
@@ -1831,8 +1805,6 @@ The traversal method.
 
 The first matching node, or undefined if not found.
 
- *
-
 #### Remarks
 
 Time O(N) via `search`. Space O(H) or O(N). BST/Red-Black Tree/AVL Tree subclasses override to O(log N) for key lookups.
@@ -1841,7 +1813,10 @@ Time O(N) via `search`. Space O(H) or O(N). BST/Red-Black Tree/AVL Tree subclass
 
 ```ts
 // Get node by key
- const tree = new BinaryTree<number, string>([[1, 'root'], [2, 'child']]);
+ const tree = new BinaryTree<number, string>([
+      [1, 'root'],
+      [2, 'child']
+    ]);
     console.log(tree.getNode(2)?.value); // 'child';
 ```
 
@@ -1863,7 +1838,7 @@ getNodes(
    iterationType?): BinaryTreeNode<K, V>[];
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:1247](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1247)
+Defined in: [data-structures/binary-tree/binary-tree.ts:912](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L912)
 
 Gets all nodes matching a predicate.
 
@@ -1907,8 +1882,6 @@ The traversal method.
 
 An array of matching nodes.
 
- *
-
 #### Remarks
 
 Time O(N) (via `search`). Space O(H) or O(N) (via `search`).
@@ -1954,7 +1927,7 @@ If true, returns the path from root-to-node.
 getPathToRoot(beginNode): (K | undefined)[];
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:1961](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1961)
+Defined in: [data-structures/binary-tree/binary-tree.ts:1305](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1305)
 
 ##### Parameters
 
@@ -1985,7 +1958,7 @@ getPathToRoot<C>(
    isReverse?): ReturnType<C>[];
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:1965](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1965)
+Defined in: [data-structures/binary-tree/binary-tree.ts:1309](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1309)
 
 ##### Type Parameters
 
@@ -2029,7 +2002,7 @@ IBinaryTree.getPathToRoot
 getPredecessor(node): BinaryTreeNode<K, V>;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:2099](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2099)
+Defined in: [data-structures/binary-tree/binary-tree.ts:1443](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1443)
 
 Gets the Morris traversal predecessor (rightmost node in the left subtree, or node itself).
 
@@ -2083,7 +2056,7 @@ The traversal method.
 getRightMost(): K | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:2046](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2046)
+Defined in: [data-structures/binary-tree/binary-tree.ts:1390](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1390)
 
 ##### Returns
 
@@ -2104,7 +2077,7 @@ getRightMost<C>(
 iterationType?): ReturnType<C>;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:2048](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2048)
+Defined in: [data-structures/binary-tree/binary-tree.ts:1392](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1392)
 
 ##### Type Parameters
 
@@ -2147,7 +2120,7 @@ IBinaryTree.getRightMost
 getSuccessor(x?): BinaryTreeNode<K, V> | null | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:2120](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2120)
+Defined in: [data-structures/binary-tree/binary-tree.ts:1464](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1464)
 
 Gets the in-order successor of a node in a BST.
 
@@ -2180,7 +2153,7 @@ has(
    iterationType?): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:1497](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1497)
+Defined in: [data-structures/binary-tree/binary-tree.ts:1045](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1045)
 
 Checks if a node matching the predicate exists in the tree.
 
@@ -2217,8 +2190,6 @@ The traversal method.
 
 True if a matching node exists, false otherwise.
 
- *
-
 #### Remarks
 
 Time O(N) via `search`. Space O(H) or O(N). BST/Red-Black Tree/AVL Tree subclasses override to O(log N) for key lookups.
@@ -2313,7 +2284,7 @@ IBinaryTree.hasValue
 isBST(startNode?, iterationType?): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:1703](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1703)
+Defined in: [data-structures/binary-tree/binary-tree.ts:1131](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1131)
 
 Checks if the tree is a valid Binary Search Tree (BST).
 
@@ -2340,8 +2311,6 @@ The traversal method.
 
 True if it's a valid BST, false otherwise.
 
- *
-
 #### Remarks
 
 Time O(N), as it must visit every node. Space O(H) for the call stack (recursive) or explicit stack (iterative), where H is the tree height (O(N) worst-case).
@@ -2369,7 +2338,7 @@ IBinaryTree.isBST
 isEmpty(): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:1633](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1633)
+Defined in: [data-structures/binary-tree/binary-tree.ts:1101](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1101)
 
 Checks if the tree is empty.
 
@@ -2379,8 +2348,6 @@ Checks if the tree is empty.
 
 True if the tree has no nodes, false otherwise.
 
- *
-
 #### Remarks
 
 Time O(1), Space O(1)
@@ -2410,7 +2377,7 @@ IBinaryTree.isEmpty
 isEntry(keyNodeOrEntry): keyNodeOrEntry is BTNEntry<K, V>;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:545](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L545)
+Defined in: [data-structures/binary-tree/binary-tree.ts:576](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L576)
 
 Checks if the given item is a [key, value] entry pair.
 
@@ -2444,7 +2411,7 @@ Time O(1), Space O(1)
 isLeaf(keyNodeOrEntry): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:531](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L531)
+Defined in: [data-structures/binary-tree/binary-tree.ts:562](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L562)
 
 Checks if a node is a leaf (has no real children).
 
@@ -2478,7 +2445,7 @@ Time O(N) if a key/entry is passed (due to `ensureNode`). O(1) if a node is pass
 isNIL(keyNodeOrEntry): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:500](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L500)
+Defined in: [data-structures/binary-tree/binary-tree.ts:531](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L531)
 
 Checks if the given item is the sentinel NIL node.
 
@@ -2512,7 +2479,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/main/src/data-structures/binary-tree/binary-tree.ts#L447)
+Defined in: [data-structures/binary-tree/binary-tree.ts:478](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L478)
 
 Checks if the given item is a `BinaryTreeNode` instance.
 
@@ -2546,7 +2513,7 @@ Time O(1), Space O(1)
 isPerfectlyBalanced(startNode?): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:1644](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1644)
+Defined in: [data-structures/binary-tree/binary-tree.ts:1112](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1112)
 
 Checks if the tree is perfectly balanced.
 
@@ -2585,7 +2552,7 @@ IBinaryTree.isPerfectlyBalanced
 isRange(keyNodeEntryOrPredicate): keyNodeEntryOrPredicate is Range<K>;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:511](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L511)
+Defined in: [data-structures/binary-tree/binary-tree.ts:542](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L542)
 
 Checks if the given item is a `Range` object.
 
@@ -2621,7 +2588,7 @@ Time O(1), Space O(1)
 isRaw(keyNodeEntryOrRaw): keyNodeEntryOrRaw is R;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:460](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L460)
+Defined in: [data-structures/binary-tree/binary-tree.ts:491](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L491)
 
 Checks if the given item is a raw data object (R) that needs conversion via `toEntryFn`.
 
@@ -2656,7 +2623,7 @@ Time O(1), Space O(1)
 isRealNode(keyNodeOrEntry): keyNodeOrEntry is BinaryTreeNode<K, V>;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:473](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L473)
+Defined in: [data-structures/binary-tree/binary-tree.ts:504](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L504)
 
 Checks if the given item is a "real" node (i.e., not null, undefined, or NIL).
 
@@ -2690,7 +2657,7 @@ Time O(1), Space O(1)
 isRealNodeOrNull(keyNodeOrEntry): keyNodeOrEntry is BinaryTreeNode<K, V> | null;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:487](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L487)
+Defined in: [data-structures/binary-tree/binary-tree.ts:518](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L518)
 
 Checks if the given item is either a "real" node or null.
 
@@ -2724,7 +2691,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/main/src/data-structures/binary-tree/binary-tree.ts#L558)
+Defined in: [data-structures/binary-tree/binary-tree.ts:589](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L589)
 
 Checks if the given key is valid (comparable or null).
 
@@ -2810,12 +2777,10 @@ The traversal method.
 leaves(): (K | undefined)[];
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:2435](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2435)
+Defined in: [data-structures/binary-tree/binary-tree.ts:1655](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1655)
 
 Get leaf nodes
 
- *
-
 ##### Returns
 
 (`K` \| `undefined`)[]
@@ -2844,12 +2809,10 @@ leaves<C>(
    iterationType?): ReturnType<C>[];
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:2437](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2437)
+Defined in: [data-structures/binary-tree/binary-tree.ts:1657](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1657)
 
 Get leaf nodes
 
- *
-
 ##### Type Parameters
 
 ###### C
@@ -2928,12 +2891,10 @@ If true, includes null nodes.
 listLevels(): (K | undefined)[][];
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:2543](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2543)
+Defined in: [data-structures/binary-tree/binary-tree.ts:1724](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1724)
 
 Level-order grouping
 
- *
-
 ##### Returns
 
 (`K` \| `undefined`)[][]
@@ -2964,12 +2925,10 @@ listLevels<C>(
    includeNull?): ReturnType<C>[][];
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:2545](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2545)
+Defined in: [data-structures/binary-tree/binary-tree.ts:1726](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1726)
 
 Level-order grouping
 
- *
-
 ##### Type Parameters
 
 ###### C
@@ -3027,12 +2986,10 @@ listLevels<C>(
    includeNull?): ReturnType<C>[][];
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:2552](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2552)
+Defined in: [data-structures/binary-tree/binary-tree.ts:1733](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1733)
 
 Level-order grouping
 
- *
-
 ##### Type Parameters
 
 ###### C
@@ -3091,7 +3048,7 @@ map<MK, MV, MR>(
 thisArg?): BinaryTree<MK, MV, MR>;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:2960](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2960)
+Defined in: [data-structures/binary-tree/binary-tree.ts:1985](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1985)
 
 Creates a new tree by mapping each [key, value] pair to a new entry.
 
@@ -3141,8 +3098,6 @@ Options for the new tree.
 
 A new, mapped tree.
 
- *
-
 #### Remarks
 
 Time O(N * M), where N is nodes in this tree, and M is size of the new tree during insertion. Space O(N) for the new tree.
@@ -3151,7 +3106,10 @@ Time O(N * M), where N is nodes in this tree, and M is size of the new tree duri
 
 ```ts
 // Transform to new tree
- const tree = new BinaryTree<number, number>([[1, 10], [2, 20]]);
+ const tree = new BinaryTree<number, number>([
+      [1, 10],
+      [2, 20]
+    ]);
     const mapped = tree.map((v, key) => [key, (v ?? 0) + 1] as [number, number]);
     console.log([...mapped.values()]); // contains 11;
 ```
@@ -3174,7 +3132,7 @@ IBinaryTree.map
 merge(anotherTree): void;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:937](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L937)
+Defined in: [data-structures/binary-tree/binary-tree.ts:777](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L777)
 
 Merges another tree into this one by seting all its nodes.
 
@@ -3186,8 +3144,6 @@ Merges another tree into this one by seting all its nodes.
 
 The tree to merge.
 
- *
-
 #### Returns
 
 `void`
@@ -3244,12 +3200,10 @@ The node to start from.
 morris(): (K | undefined)[];
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:2667](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2667)
+Defined in: [data-structures/binary-tree/binary-tree.ts:1809](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1809)
 
 Morris traversal (O(1) space)
 
- *
-
 ##### Returns
 
 (`K` \| `undefined`)[]
@@ -3278,12 +3232,10 @@ morris<C>(
    startNode?): ReturnType<C>[];
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:2669](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2669)
+Defined in: [data-structures/binary-tree/binary-tree.ts:1811](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1811)
 
 Morris traversal (O(1) space)
 
- *
-
 ##### Type Parameters
 
 ###### C
@@ -3334,7 +3286,7 @@ IBinaryTree.morris
 print(options?, startNode?): void;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:3056](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L3056)
+Defined in: [data-structures/binary-tree/binary-tree.ts:2041](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2041)
 
 Prints a visual representation of the tree to the console.
 
@@ -3355,8 +3307,6 @@ Options to control the output.
 
 The node to start printing from.
 
- *
-
 #### Returns
 
 `void`
@@ -3469,12 +3419,10 @@ Whether to use 'RECURSIVE' or 'ITERATIVE' search.
 search(keyNodeEntryOrPredicate, onlyOne?): (K | undefined)[];
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:1104](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1104)
+Defined in: [data-structures/binary-tree/binary-tree.ts:808](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L808)
 
 Search by predicate
 
- *
-
 ##### Parameters
 
 ###### keyNodeEntryOrPredicate
@@ -3520,12 +3468,10 @@ search<C>(
    iterationType?): ReturnType<C>[];
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:1115](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L1115)
+Defined in: [data-structures/binary-tree/binary-tree.ts:819](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L819)
 
 Search by predicate
 
- *
-
 ##### Type Parameters
 
 ###### C
@@ -3589,7 +3535,7 @@ IBinaryTree.search
 set(keyNodeOrEntry, value?): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:694](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L694)
+Defined in: [data-structures/binary-tree/binary-tree.ts:644](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L644)
 
 Adds or updates a new node to the tree.
 
@@ -3617,8 +3563,6 @@ The value, if providing just a key.
 
 True if the addition was successful, false otherwise.
 
- *
-
 #### Remarks
 
 Time O(N) — level-order traversal to find an empty slot. Space O(N) for the BFS queue. BST/Red-Black Tree/AVL Tree subclasses override to O(log N).
@@ -3664,7 +3608,7 @@ IBinaryTree.set
 setMany(keysNodesEntriesOrRaws, values?): boolean[];
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:856](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L856)
+Defined in: [data-structures/binary-tree/binary-tree.ts:736](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L736)
 
 Adds or updates multiple items to the tree.
 
@@ -3694,8 +3638,6 @@ An optional parallel iterable of values.
 
 An array of booleans indicating the success of each individual `set` operation.
 
- *
-
 #### Remarks
 
 Time O(N * M), where N is the number of items to set and M is the size of the tree at insertion (due to O(M) `set` operation). Space O(M) (from `set`) + O(N) (for the `inserted` array).
@@ -3705,7 +3647,11 @@ Time O(N * M), where N is the number of items to set and M is the size of the tr
 ```ts
 // Set multiple entries
  const tree = new BinaryTree<number, string>();
-    tree.setMany([[1, 'a'], [2, 'b'], [3, 'c']]);
+    tree.setMany([
+      [1, 'a'],
+      [2, 'b'],
+      [3, 'c']
+    ]);
     console.log(tree.size); // 3;
 ```
 
@@ -3789,7 +3735,7 @@ Time O(n), Space O(n)
 toVisual(startNode?, options?): string;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:2979](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2979)
+Defined in: [data-structures/binary-tree/binary-tree.ts:2004](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2004)
 
 Generates a string representation of the tree for visualization.
 
@@ -3867,7 +3813,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:3252](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L3252)
+Defined in: [data-structures/binary-tree/binary-tree.ts:2298](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2298)
 
 (Protected) Default callback function, returns the node's key.
 
@@ -3891,7 +3837,7 @@ The node's key or undefined.
 protected _clearNodes(): void;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:3686](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L3686)
+Defined in: [data-structures/binary-tree/binary-tree.ts:2701](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2701)
 
 (Protected) Clears all nodes from the tree.
 
@@ -3911,7 +3857,7 @@ Time O(1)
 protected _clearValues(): void;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:3695](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L3695)
+Defined in: [data-structures/binary-tree/binary-tree.ts:2710](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2710)
 
 (Protected) Clears all values from the external store.
 
@@ -3931,7 +3877,7 @@ Time O(N)
 protected _clone(cloned): void;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:3345](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L3345)
+Defined in: [data-structures/binary-tree/binary-tree.ts:2392](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2392)
 
 (Protected) Helper for cloning. Performs a BFS and sets all nodes to the new tree.
 
@@ -3959,7 +3905,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:3279](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L3279)
+Defined in: [data-structures/binary-tree/binary-tree.ts:2326](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2326)
 
 (Protected) Creates a new, empty instance of the same tree constructor.
 
@@ -4003,7 +3949,7 @@ Time O(1)
 protected _createLike<TK, TV, TR>(iter?, options?): BinaryTree<TK, TV, TR>;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:3296](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L3296)
+Defined in: [data-structures/binary-tree/binary-tree.ts:2343](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2343)
 
 (Protected) Creates a new instance of the same tree constructor, potentially with different generic types.
 
@@ -4059,7 +4005,7 @@ Time O(N) (or as per constructor) due to processing the iterable.
 protected _deleteInternal(keyNodeEntryRawOrPredicate): BinaryTreeDeleteResult<BinaryTreeNode<K, V>>[];
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:949](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L949)
+Defined in: [data-structures/binary-tree/binary-tree.ts:2056](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2056)
 
 **`Internal`**
 
@@ -4103,7 +4049,7 @@ protected _dfs<C>(
    shouldProcessRoot?): ReturnType<C>[];
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:3063](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L3063)
+Defined in: [data-structures/binary-tree/binary-tree.ts:2109](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2109)
 
 #### Type Parameters
 
@@ -4192,7 +4138,7 @@ Array of callback results.
 protected _displayAux(node, options): NodeDisplayLayout;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:3369](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L3369)
+Defined in: [data-structures/binary-tree/binary-tree.ts:2416](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2416)
 
 (Protected) Recursive helper for `toVisual`.
 
@@ -4228,7 +4174,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:3592](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L3592)
+Defined in: [data-structures/binary-tree/binary-tree.ts:2607](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2607)
 
 (Protected) Converts a key, node, entry, or predicate into a standardized predicate function.
 
@@ -4263,7 +4209,7 @@ Time O(1)
 protected _extractKey(keyNodeOrEntry): K | null | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:3652](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L3652)
+Defined in: [data-structures/binary-tree/binary-tree.ts:2667](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2667)
 
 (Protected) Extracts the key from a key, node, or entry.
 
@@ -4297,7 +4243,7 @@ Time O(1)
 protected _getIterator(node?): IterableIterator<[K, V | undefined]>;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:3208](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L3208)
+Defined in: [data-structures/binary-tree/binary-tree.ts:2254](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2254)
 
 (Protected) Gets the iterator for the tree (default in-order).
 
@@ -4331,7 +4277,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:3464](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L3464)
+Defined in: [data-structures/binary-tree/binary-tree.ts:2482](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2482)
 
 Check if a node is a display leaf (empty, null, undefined, NIL, or real leaf).
 
@@ -4357,7 +4303,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:3641](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L3641)
+Defined in: [data-structures/binary-tree/binary-tree.ts:2656](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2656)
 
 (Protected) Checks if an item is a predicate function.
 
@@ -4387,7 +4333,7 @@ Time O(1)
 protected _keyValueNodeOrEntryToNodeAndValue(keyNodeOrEntry, value?): [BinaryTreeNode<K, V> | null | undefined, V | undefined];
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:3319](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L3319)
+Defined in: [data-structures/binary-tree/binary-tree.ts:2366](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2366)
 
 (Protected) Converts a key, node, or entry into a standardized [node, value] tuple.
 
@@ -4427,7 +4373,7 @@ Time O(1)
 protected _replaceNode(oldNode, newNode): BinaryTreeNode<K, V>;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:3554](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L3554)
+Defined in: [data-structures/binary-tree/binary-tree.ts:2569](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2569)
 
 (Protected) Replaces a node in the tree with a new node, maintaining children and parent links.
 
@@ -4466,7 +4412,7 @@ protected _resolveDisplayLeaf(
    emptyDisplayLayout): NodeDisplayLayout;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:3494](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L3494)
+Defined in: [data-structures/binary-tree/binary-tree.ts:2509](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2509)
 
 Resolve a display leaf node to its layout.
 
@@ -4496,7 +4442,7 @@ Resolve a display leaf node to its layout.
 protected _setRoot(v): void;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:3578](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L3578)
+Defined in: [data-structures/binary-tree/binary-tree.ts:2593](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2593)
 
 (Protected) Sets the root node and clears its parent reference.
 
@@ -4524,7 +4470,7 @@ Time O(1)
 protected _setValue(key, value): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:3673](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L3673)
+Defined in: [data-structures/binary-tree/binary-tree.ts:2688](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2688)
 
 (Protected) Sets a value in the external store (Map mode).
 
@@ -4560,7 +4506,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:3262](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L3262)
+Defined in: [data-structures/binary-tree/binary-tree.ts:2309](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2309)
 
 (Protected) Snapshots the current tree's configuration options.
 
@@ -4596,7 +4542,7 @@ Time O(1)
 protected _swapProperties(srcNode, destNode): BinaryTreeNode<K, V> | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/binary-tree.ts:3520](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L3520)
+Defined in: [data-structures/binary-tree/binary-tree.ts:2535](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-tree.ts#L2535)
 
 (Protected) Swaps the key/value properties of two nodes.