Java | Simple Recursive Solution
By using the property of BST we can easily solve this problem.\n\n\n public TreeNode searchBST(TreeNode root, int val) {\n        \n        if (root == null) {\
By using the property of BST we can easily solve this problem.\n\n```\n public TreeNode searchBST(TreeNode root, int val) {\n        \n        if (root == null) {\n            return root;\n        }\n        \n        if(root.val == val) {\n            return root;\n        }\n        \n        if(val > root.val) {\n            return searchBST(root.right, val);\n        }\n        \n        return searchBST(root.left, val);\n    }\n```
[]