Python - Very Concise Iterative Solution
\n    def searchBST(self, root: TreeNode, val: int) -> TreeNode:\n        while root and val != root.val:\n            root = root.left if val < root.val else r
```\n    def searchBST(self, root: TreeNode, val: int) -> TreeNode:\n        while root and val != root.val:\n            root = root.left if val < root.val else root.right\n        return root\n```
['Iterator', 'Python', 'Python3']