Search in a Binary Search Tree Python Solution

lcpy gen -n 700   # by problem number
lcpy gen -s search_in_a_binary_search_tree   # by problem name

Input: root = [4,2,7,1,3], val = 2
Output: [2,1,3]

Input: root = [4,2,7,1,3], val = 5
Output: []

from leetcode_py import TreeNode


class Solution:
    # Time: O(h) where h is the tree height
    # Space: O(1)
    def search_bst(self, root: TreeNode[int] | None, val: int) -> TreeNode[int] | None:
        node = root
        while node is not None:
            if val == node.val:
                return node
            node = node.left if val < node.val else node.right
        return None