二叉搜索树的第k大节点

class TreeNode:
    def __init__(self, val=0, left=None, right=None):
        self.val = val
        self.left = left
        self.right = right

def solve():
    def kthLargest(root, k):
        result = []
        def reverseInorder(node):
            if not node or len(result) >= k:
                return
            reverseInorder(node.right)
            result.append(node.val)
            reverseInorder(node.left)
        reverseInorder(root)
        return result[k-1]
    root = TreeNode(3, TreeNode(1, None, TreeNode(2)), TreeNode(4))
    print(kthLargest(root, 1))