JS. Super simple & clear solution. iterative. 5 lines.
\tvar searchBST = function(root, val) {\n\t\twhile (root != null)\n\t\t{\n\t\t\tif ( val < root.val ) root = root.left;\n\t\t\telse if ( val > root.val ) root =
\tvar searchBST = function(root, val) {\n\t\twhile (root != null)\n\t\t{\n\t\t\tif ( val < root.val ) root = root.left;\n\t\t\telse if ( val > root.val ) root = root.right;\n\t\t\telse return root;\n\t\t}\n\t\treturn root;\n\t}
['JavaScript']