200th Commit

README.md

@@ -193,10 +193,12 @@ Ace Coding Interview with 75 Qs
 [199]: ./src/page-2/199.%20Binary%20Tree%20Right%20Side%20View/rightSideView.ts
 [1161]: ./src/page-11/1161.%20Maximum%20Level%20Sum%20of%20a%20Binary%20Tree/maxLevelSum.ts
 
-| Binary Search Tree                  |          |        |
-| ----------------------------------- | -------- | ------ |
-| 700. Search in a Binary Search Tree | Solution | Easy   |
-| 450. Delete Node in a BST           | Solution | Medium |
+| Binary Search Tree                  |                 |        |
+| ----------------------------------- | --------------- | ------ |
+| 700. Search in a Binary Search Tree | [Solution][700] | Easy   |
+| 450. Delete Node in a BST           | Solution        | Medium |
+
+[700]: ./src/page-7/700.%20Search%20in%20a%20Binary%20Search%20Tree/searchBST.ts
 
 | Graphs - DFS                                                 |          |        |
 | ------------------------------------------------------------ | -------- | ------ |

src/page-7/700. Search in a Binary Search Tree/searchBST.test.ts

@@ -0,0 +1,21 @@
+import { stringify } from 'flatted';
+
+import { generateBinaryTree } from '~/utils/binary-tree';
+
+import { searchBST } from './searchBST';
+
+describe('700. Search in a Binary Search Tree', () => {
+  test('searchBST', () => {
+    {
+      const root = generateBinaryTree([4, 2, 7, 1, 3]);
+      const expected = generateBinaryTree([2, 1, 3]);
+      expect(stringify(searchBST(root, 2))).toBe(stringify(expected));
+    }
+
+    {
+      const root = generateBinaryTree([4, 2, 7, 1, 3]);
+      const expected = generateBinaryTree([]);
+      expect(stringify(searchBST(root, 5))).toBe(stringify(expected));
+    }
+  });
+});

src/page-7/700. Search in a Binary Search Tree/searchBST.ts

@@ -0,0 +1,12 @@
+import type { TreeNode } from '~/utils/binary-tree';
+
+type SearchBST = (root: TreeNode | null, val: number) => TreeNode | null;
+
+/**
+ * Accepted
+ */
+export const searchBST: SearchBST = (root, val) => {
+  if (!root || root.val === val) return root;
+  if (val < root.val) return searchBST(root.left, val);
+  return searchBST(root.right, val);
+};