Java. 0 ms, faster than 100.00%. Super simlpe & clear solution. iterative. 5 lines.
\tclass Solution {\n\t\tpublic TreeNode searchBST(TreeNode root, int val) {\n\t\t\twhile (root != null)\n\t\t\t{\n\t\t\t\tif ( val < root.val ) root = root.left
\tclass Solution {\n\t\tpublic TreeNode searchBST(TreeNode root, int val) {\n\t\t\twhile (root != null)\n\t\t\t{\n\t\t\t\tif ( val < root.val ) root = root.left;\n\t\t\t\telse if ( val > root.val ) root = root.right;\n\t\t\t\telse return root;\n\t\t\t}\n\t\t\treturn root;\n\t\t}\n\t}
['Java']