Easy recursive python 🐍 solution
Time O(n) Space O(n)\n\nclass Solution:\n    def searchBST(self, root: TreeNode, val: int) -> TreeNode:\n        if not root:\n            return None\n        
**Time O(n) Space O(n)**\n```\nclass Solution:\n    def searchBST(self, root: TreeNode, val: int) -> TreeNode:\n        if not root:\n            return None\n        \n        elif root.val==val:\n            return root\n        \n        elif root.val>val:\n            return self.searchBST(root.left,val)\n        \n        elif root.val<val:\n            return self.searchBST(root.right,val)\n            \n            \n       \n```
['Python', 'Python3']