SImple Java Solution
\nclass Solution {\n    public TreeNode searchBST(TreeNode root, int val) {\n        if(root == null || root.val == val) return root;\n        if(root.val > val
```\nclass Solution {\n    public TreeNode searchBST(TreeNode root, int val) {\n        if(root == null || root.val == val) return root;\n        if(root.val > val) return searchBST(root.left, val);\n        return searchBST(root.right, val);\n    }\n}\n```
['Recursion', 'Java']