515在每个树中找最大值-CSDN博客

本文链接：https://blog.csdn.net/qq_44658259/article/details/126513280

515在每个树中找最大值

给定一棵二叉树的根节点 root ，请找出该二叉树中每一层的最大值。

输入: root = [1,3,2,5,3,null,9]
输出: [1,3,9]

输入: root = [1,2,3]
输出: [1,3]

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def largestValues(self, root: Optional[TreeNode]) -> List[int]:
        # 非递归
        # results = []
        # if not root:
        #     return []
        # from collections import deque
        # que = deque([root])
        # while que:
        #     result = []
        #     for _ in range(len(que)):
        #         cur = que.popleft()
        #         result.append(cur.val)
        #         if cur.left:
        #             que.append(cur.left)
        #         if cur.right:
        #             que.append(cur.right)
        #     results.append(max(result))
        # return results
        # 递归 
        res = []
        if not root:
            return []
        def helper(root, depth):
            if len(res) == depth:res.append([])
            res[depth].append(root.val)
            if root.left:
                helper(root.left, depth+1)
            if root.right:
                helper(root.right, depth+1)
        helper(root, 0)
        result = []
        for i in res:
            result.append(max(i))
        return result