Search in a Binary Search Tree

From LeetCode

problem description / no solution provided

Solution in Python3

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:
    def searchBST(self, root: TreeNode, val: int) -> TreeNode:
        if root:
            if val > root.val:
                return self.searchBST(root.right, val)
            elif val < root.val:
                return self.searchBST(root.left, val)
        return root           

I am lucky to get

Runtime: 80 ms, faster than 86.81% of Python3 online submissions for Search in a Binary Search Tree.

Time Complexity

\(O(h)\), where \(h\) is the height of the tree.