Python 3 lines DFS solution w/ a very simple approach
One way or another, DFS will continue till found target value val or will stop and return None from a leaf node\n\nclass Solution:\n    def searchBST(self, root
One way or another, DFS will continue till found target value val or will stop and return None from a leaf node\n```\nclass Solution:\n    def searchBST(self, root, val):\n        if root and val < root.val: return self.searchBST(root.left, val)\n        elif root and val > root.val: return self.searchBST(root.right, val)\n        return root\n```\n1-liner for fun\n```\nclass Solution:\n    def searchBST(self, root, val):\n        return self.searchBST(root.left,val) if root and val<root.val else self.searchBST(root.right,val) if root and val>root.val else root\n```
[]