Python3 - iterative and recursive solutions
```\n# iterative\n\nclass Solution:\n    def searchBST(self, root: TreeNode, val: int) -> TreeNode:\n        while root and root.val != val:\n            if roo
```\n# iterative\n\nclass Solution:\n    def searchBST(self, root: TreeNode, val: int) -> TreeNode:\n        while root and root.val != val:\n            if root.val > val:\n                root = root.left\n            elif root.val < val:\n                root = root.right\n        return root\n\n# recursive\n\nclass Solution:\n    def searchBST(self, root: TreeNode, val: int) -> TreeNode:\n        if not root or root.val == val:\n            return root\n        if root.val > val:\n            return self.searchBST(root.left, val)\n        return self.searchBST(root.right, val)
[]