📌 Python3 Binary search faster than 96%
\nclass Solution:\n    def searchBST(self, root: Optional[TreeNode], val: int) -> Optional[TreeNode]:\n        \n        def search(root):\n            if root 
```\nclass Solution:\n    def searchBST(self, root: Optional[TreeNode], val: int) -> Optional[TreeNode]:\n        \n        def search(root):\n            if root == None:\n                return None\n            if root.val == val:\n                return root\n            if val < root.val:\n                return search(root.left)\n            else:\n                return search(root.right)\n        \n        return search(root)\n```
['Recursion', 'Python3']