Easy to understand Recursive traversal (JAVA)
Based on the BST idea, we traverse to the subtree of the original BST based on the property that root.left < root < root.right.\n\n\nclass Solution {\n    publi
Based on the BST idea, we traverse to the subtree of the original BST based on the property that root.left < root < root.right.\n\n```\nclass Solution {\n    public TreeNode searchBST(TreeNode root, int val) {\n        if (root == null)\n            return root;\n        if (root.val == val)\n            return root;\n        else if (root.val > val)\n            return searchBST(root.left, val);\n        else if (root.val < val)\n            return searchBST(root.right, val);\n        return null;\n    }\n}\n```
[]