Python. Super simple & clear solution. iterative. 5 lines.
\tclass Solution:\n\t\tdef searchBST(self, root: TreeNode, val: int) -> TreeNode:\n\t\t\twhile root:\n\t\t\t\tif val < root.val: root = root.left\n\t\t\t\telif 
\tclass Solution:\n\t\tdef searchBST(self, root: TreeNode, val: int) -> TreeNode:\n\t\t\twhile root:\n\t\t\t\tif val < root.val: root = root.left\n\t\t\t\telif val > root.val: root = root.right\n\t\t\t\telse: return root\n\t\t\treturn root
['Python', 'Python3']