Java beats 100% concise method using recursion and iteration
recursion:\n\npublic TreeNode searchBST(TreeNode root, int val) {\n        if(root == null) return root;\n        if(root.val == val){\n            return root;
recursion:\n```\npublic TreeNode searchBST(TreeNode root, int val) {\n        if(root == null) return root;\n        if(root.val == val){\n            return root;\n        }\n        else{\n            return val<root.val? searchBST(root.left,val):searchBST(root.right,val);\n        }\n    }\n```\niteration:\n```\npublic TreeNode searchBST(TreeNode root, int val) {\n        while(root != null && root.val != val){\n            root = val<root.val? root.left:root.right;\n        }\n        return root;\n    }\n```
[]