binary-tree-typed 2.2.5 → 2.2.7

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "binary-tree-typed",
-  "version": "2.2.5",
+  "version": "2.2.7",
   "description": "Binary Tree. Javascript & Typescript Data Structure.",
   "browser": "dist/umd/binary-tree-typed.min.js",
   "umd:main": "dist/umd/binary-tree-typed.min.js",
@@ -178,6 +178,6 @@
     "typescript": "^4.9.5"
   },
   "dependencies": {
-    "data-structure-typed": "^2.2.5"
+    "data-structure-typed": "^2.2.7"
   }
 }

package/src/common/index.ts

@@ -1,5 +1,3 @@
-import { isComparable } from '../utils';
-
 export enum DFSOperation {
   VISIT = 0,
   PROCESS = 1
@@ -12,8 +10,8 @@ export class Range<K> {
     public includeLow: boolean = true,
     public includeHigh: boolean = true
   ) {
-    if (!(isComparable(low) && isComparable(high))) throw new RangeError('low or high is not comparable');
-    if (low > high) throw new RangeError('low must be less than or equal to high');
+    // if (!(isComparable(low) && isComparable(high))) throw new RangeError('low or high is not comparable');
+    // if (low > high) throw new RangeError('low must be less than or equal to high');
   }
 
   // Determine whether a key is within the range

package/src/data-structures/base/iterable-entry-base.ts

@@ -178,6 +178,15 @@ export abstract class IterableEntryBase<K = any, V = any> {
     return accumulator;
   }
 
+  /**
+   * Converts data structure to `[key, value]` pairs.
+   * @returns Array of entries.
+   * @remarks Time O(n), Space O(n)
+   */
+  toArray() {
+    return [...this];
+  }
+
   /**
    * Visualize the iterable as an array of `[key, value]` pairs (or a custom string).
    * @returns Array of entries (default) or a string.

package/src/data-structures/binary-tree/binary-tree.ts

@@ -858,6 +858,31 @@ export class BinaryTree<K = any, V = any, R = any>
     return deletedResult;
   }
 
+  search(
+    keyNodeEntryOrPredicate:
+      | K
+      | BinaryTreeNode<K, V>
+      | [K | null | undefined, V | undefined]
+      | null
+      | undefined
+      | NodePredicate<BinaryTreeNode<K, V> | null>,
+    onlyOne?: boolean
+  ): (K | undefined)[];
+
+  search<C extends NodeCallback<BinaryTreeNode<K, V> | null>>(
+    keyNodeEntryOrPredicate:
+      | K
+      | BinaryTreeNode<K, V>
+      | [K | null | undefined, V | undefined]
+      | null
+      | undefined
+      | NodePredicate<BinaryTreeNode<K, V> | null>,
+    onlyOne: boolean,
+    callback: C,
+    startNode?: K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined,
+    iterationType?: IterationType
+  ): ReturnType<C>[];
+
   /**
    * 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).
@@ -1245,6 +1270,16 @@ export class BinaryTree<K = any, V = any, R = any>
     }
   }
 
+  getPathToRoot(
+    beginNode: K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined
+  ): (K | undefined)[];
+
+  getPathToRoot<C extends NodeCallback<BinaryTreeNode<K, V> | undefined>>(
+    beginNode: K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined,
+    callback: C,
+    isReverse?: boolean
+  ): ReturnType<C>[];
+
   /**
    * Gets the path from a given node up to the root.
    * @remarks Time O(H), where H is the depth of the `beginNode`. O(N) worst-case. Space O(H) for the result array.
@@ -1273,6 +1308,14 @@ export class BinaryTree<K = any, V = any, R = any>
     return isReverse ? result.reverse() : result;
   }
 
+  getLeftMost(): K | undefined;
+
+  getLeftMost<C extends NodeCallback<BinaryTreeNode<K, V> | undefined>>(
+    callback: C,
+    startNode?: K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined,
+    iterationType?: IterationType
+  ): ReturnType<C>;
+
   /**
    * Finds the leftmost node in a subtree (the node with the smallest key in a BST).
    * @remarks Time O(H), where H is the height of the left spine. O(N) worst-case. Space O(H) for recursive/trampoline stack.
@@ -1312,6 +1355,14 @@ export class BinaryTree<K = any, V = any, R = any>
     }
   }
 
+  getRightMost(): K | undefined;
+
+  getRightMost<C extends NodeCallback<BinaryTreeNode<K, V> | undefined>>(
+    callback: C,
+    startNode?: K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined,
+    iterationType?: IterationType
+  ): ReturnType<C>;
+
   /**
    * Finds the rightmost node in a subtree (the node with the largest key in a BST).
    * @remarks Time O(H), where H is the height of the right spine. O(N) worst-case. Space O(H) for recursive/trampoline stack.
@@ -1394,6 +1445,8 @@ export class BinaryTree<K = any, V = any, R = any>
     return y;
   }
 
+  dfs(): (K | undefined)[];
+
   dfs<C extends NodeCallback<BinaryTreeNode<K, V>>>(
     callback?: C,
     pattern?: DFSOrderPattern,
@@ -1437,6 +1490,8 @@ export class BinaryTree<K = any, V = any, R = any>
     return this._dfs(callback, pattern, onlyOne, startNode, iterationType, includeNull);
   }
 
+  bfs(): (K | undefined)[];
+
   bfs<C extends NodeCallback<BinaryTreeNode<K, V>>>(
     callback?: C,
     startNode?: K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined,
@@ -1519,6 +1574,14 @@ export class BinaryTree<K = any, V = any, R = any>
     return ans;
   }
 
+  leaves(): (K | undefined)[];
+
+  leaves<C extends NodeCallback<BinaryTreeNode<K, V>>>(
+    callback: C,
+    startNode?: K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined,
+    iterationType?: IterationType
+  ): ReturnType<C>[];
+
   /**
    * Finds all leaf nodes in the tree.
    * @remarks Time O(N), visits every node. Space O(H) for recursive stack or O(N) for iterative queue.
@@ -1570,6 +1633,8 @@ export class BinaryTree<K = any, V = any, R = any>
     return leaves;
   }
 
+  listLevels(): (K | undefined)[][];
+
   listLevels<C extends NodeCallback<BinaryTreeNode<K, V>>>(
     callback?: C,
     startNode?: K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined,
@@ -1645,6 +1710,8 @@ export class BinaryTree<K = any, V = any, R = any>
     return levelsNodes;
   }
 
+  morris(): (K | undefined)[];
+
   morris<C extends NodeCallback<BinaryTreeNode<K, V>>>(
     callback?: C,
     pattern?: DFSOrderPattern,