二叉搜索树的第k大节点
5
/
3 6
/
2 4
/
1
root = [5,3,6,2,4,null,null,1], k = 3
输出:4
class Solution:
def kthLargest(self, root: TreeNode, k: int) -> int:
def dfs(root):
if not root or k==0 :
return
dfs(root.right)
if self.k>0:
self.k -=1
if self.k==0:
self.result=root.val
return
dfs(root.left)
self.result=0
self.k = k
a=dfs(root)
return self.result