思路:先序遍历,把节点值存储在lst中,直接输出第k大的节点值
# Definition for a binary tree node.
# 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:
lst = []
def dfs(root): # 思路:先序遍历,把节点值存储在lst中,直接输出第k大的节点值
if not root:
return
dfs(root.left)
lst.append(root.val)
dfs(root.right)
dfs(root)
return lst[len(lst) - k]