data-structure-typed 2.5.0 → 2.5.1

package/dist/types/data-structures/binary-tree/bst.d.ts

@@ -307,7 +307,7 @@ export declare class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R>
      * @param key - The key to validate.
      * @returns True if the key is valid, false otherwise.
      */
-    isValidKey(key: any): key is K;
+    isValidKey(key: unknown): key is K;
     /**
    * Depth-first search traversal
   
@@ -330,6 +330,46 @@ export declare class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R>
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
     * @example
@@ -356,6 +396,46 @@ export declare class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R>
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // Breadth-first traversal
  *  const bst = new BST<number>([5, 3, 7]);
@@ -383,6 +463,46 @@ export declare class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R>
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // Level-order grouping
  *  const bst = new BST<number>([5, 3, 7, 1, 4]);
@@ -421,6 +541,46 @@ export declare class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R>
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Get node object by key
    *  const bst = new BST<number, string>([[5, 'root'], [3, 'left'], [7, 'right']]);
@@ -443,6 +603,46 @@ export declare class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R>
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // Search nodes by predicate
  *  const bst = new BST<number, string>([[1, 'a'], [2, 'b'], [3, 'c'], [4, 'd']]);
@@ -463,6 +663,26 @@ export declare class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R>
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
     * @example
  * // Find all keys in a range
@@ -498,6 +718,66 @@ export declare class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R>
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -533,6 +813,46 @@ export declare class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R>
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Set multiple key-value pairs
    *  const bst = new BST<number, string>();
@@ -556,6 +876,26 @@ export declare class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R>
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Find the least key ≥ target
@@ -586,6 +926,26 @@ export declare class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R>
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Find the least key strictly > target
@@ -615,6 +975,26 @@ export declare class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R>
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Find the greatest key ≤ target
@@ -645,6 +1025,26 @@ export declare class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R>
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Find the greatest key strictly < target
@@ -675,6 +1075,26 @@ export declare class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R>
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Rebalance the tree
@@ -700,6 +1120,26 @@ export declare class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R>
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Check if tree is height-balanced
@@ -738,6 +1178,46 @@ export declare class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R>
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Transform to new tree
    *  const bst = new BST<number, number>([[1, 10], [2, 20], [3, 30]]);