leetcode：515. Find the maximum value in each tree row [brainless BFS]

analysis

No brain bfs

ac code

# 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]:
        if not root:
            return []
        ans = []
        q = [root]
        while q:
            new_q = []
            maxn = -inf
            for node in q:
                maxn = max(maxn, node.val)
                if node.left: new_q.append(node.left)
                if node.right: new_q.append(node.right)
            ans.append(maxn)
            q = new_q
        
        return ans

summary

No brain bfs