[PYTHON 3] BST | Easy to Read and Understand
\nclass Solution:\n    def searchBST(self, root: TreeNode, val: int) -> TreeNode:\n        if not root:\n            return None\n        if root.val == val:\n 
```\nclass Solution:\n    def searchBST(self, root: TreeNode, val: int) -> TreeNode:\n        if not root:\n            return None\n        if root.val == val:\n            return root\n        elif root.val > val:\n            return self.searchBST(root.left, val)           \n        else:\n            return self.searchBST(root.right, val)\n        \n```
['Binary Search Tree', 'Python3']