python--剑指offer--简单--54. 二叉搜索树的第k大节点

代码

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

class Solution:
    def kthLargest(self, root: TreeNode, k: int) -> int:
        if not root or k <= 0:
            return

        stack = []
        p = root
        while stack or p:
            if p:
                stack.append(p)
                p = p.right
            else:
                p = stack.pop()
                if k == 1:
                    break
                else:
                    k -= 1
                p = p.left

        return p.val if p else None

[题目源于leetcode]