1
2
3
4
5
6
7
8
9
10
11
12
13
14
import { TreeNode } from "../binary-tree-inorder-traversal/TreeNode.ts";
export default function searchBST(    root: TreeNode | null,    val: number,): TreeNode | null | undefined {    if (!root) return null;    if (root.val > val) {        return searchBST(root.left, val);    } else if (root.val < val) return searchBST(root.right, val);    if (root.val === val) return root;    return;}