Easy 2 liner 0ms solution.
\n    public TreeNode searchBST(TreeNode root, int val) {\n        \n        if(root == null) return null;\n        \n        return root.val == val ? root : va
```\n    public TreeNode searchBST(TreeNode root, int val) {\n        \n        if(root == null) return null;\n        \n        return root.val == val ? root : val > root.val ? searchBST(root.right, val) : searchBST(root.left, val);        \n                \n    }\n```
[]