Search in a Binary Search Tree

main.py

class Solution:
    def searchBST(self, root: TreeNode, val: int) -> TreeNode:
        if not root:
            return None
        if root.val == val:
            return root
        if root.val > val:
            # Current val is too high so move left so we get lower vals.
            return self.searchBST(root.left, val)
        # Otherwise move right so we get higher vals.
        return self.searchBST(root.right, val)