traversal_bst_range

Author: masx200

mod.ts

@@ -61,6 +61,7 @@ import { MyLinkedList } from "./lfu-cache/MyLinkedList.ts";
 import { level } from "./binary-tree-level-order-traversal-ii/level.ts";
 import { inorder } from "./binary-tree-inorder-traversal/inorder.ts";
 import { buildBST } from "./convert-sorted-list-to-binary-search-tree/buildBST.ts";
+import { traversal_bst_range } from "./tweet-counts-per-frequency/traversal_bst_range.ts";
 export {
     TrieNode,
     TrieNodeCountWordsEqualTo,
@@ -102,3 +103,4 @@ export { Node as MultilevelDoublyLinkedListNode } from "./flatten-a-multilevel-d
 export { MyLinkedList };
 export { level };
 export { buildBST, inorder };
+export { traversal_bst_range };

tweet-counts-per-frequency/index.ts

@@ -1,4 +1,5 @@
-import { BinarySearchTree, BinarySearchTreeNode } from "../deps.ts";
+import { BinarySearchTree } from "../deps.ts";
+import { traversal_bst_range } from "./traversal_bst_range.ts";
 
 export default class TweetCounts {
     #name_to_bst = new Map<string, BinarySearchTree<number, number>>();
@@ -48,25 +49,3 @@ export default class TweetCounts {
         return result;
     }
 }
-export function traversal_bst_range<
-    K extends string | number = number,
-    V = number,
->(
-    node: BinarySearchTreeNode<K, V> | null | undefined,
-    low: number,
-    high: number,
-    callback: (key: K, value: V) => void,
-) {
-    if (!node) return;
-
-    const value = node.getKey();
-    if (value <= high && value >= low) {
-        callback(value, node.getValue());
-    }
-    if (value > low) {
-        traversal_bst_range(node.getLeft(), low, high, callback);
-    }
-    if (value < high) {
-        traversal_bst_range(node.getRight(), low, high, callback);
-    }
-}

tweet-counts-per-frequency/traversal_bst_range.ts

@@ -0,0 +1,24 @@
+import { BinarySearchTreeNode } from "../deps.ts";
+
+export function traversal_bst_range<
+    K extends string | number = number,
+    V = number,
+>(
+    node: BinarySearchTreeNode<K, V> | null | undefined,
+    low: number,
+    high: number,
+    callback: (key: K, value: V) => void,
+) {
+    if (!node) return;
+
+    const value = node.getKey();
+    if (value <= high && value >= low) {
+        callback(value, node.getValue());
+    }
+    if (value > low) {
+        traversal_bst_range(node.getLeft(), low, high, callback);
+    }
+    if (value < high) {
+        traversal_bst_range(node.getRight(), low, high, callback);
+    }
+}