Python simple recursive solution | one line
Python :\n\n\ndef searchBST(self, root: Optional[TreeNode], val: int) -> Optional[TreeNode]:\n\tif not root:\n\t\treturn None\n\n\tif root.val < val:\n\t\tretur
**Python :**\n\n```\ndef searchBST(self, root: Optional[TreeNode], val: int) -> Optional[TreeNode]:\n\tif not root:\n\t\treturn None\n\n\tif root.val < val:\n\t\treturn self.searchBST(root.right, val)\n\n\telif root.val > val:\n\t\treturn self.searchBST(root.left, val)\n\n\telse:\n\t\treturn root\n```\n\n**and in one line :**\n\n```\ndef searchBST(self, root: Optional[TreeNode], val: int) -> Optional[TreeNode]:\n\treturn self.searchBST(root.right, val) if root and root.val < val else self.searchBST(root.left, val) if root and  root.val > val else root\n```\n\n**Like it ? please upvote !**
['Recursion', 'Python', 'Python3']