二叉搜索树中第 k 小的元素

def solve(____):
    stack = []
    while True:
        while root:
            stack.append(____)
            root = root.left
        root = stack.pop()
        k -= ____
        if k == ____:
            return root.val
        root = root.right