LeetCode 筆記 - 515. Find Largest Value in Each Tree Row

# 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 root
        
        upper_quque = [root]
        lower_quque = []
        
        result = []
        while upper_quque:
            
            current_max = -inf
            for node in upper_quque:
                if node.left:
                    lower_quque.append(node.left)
                if node.right:
                    lower_quque.append(node.right)
                current_max = max(current_max, node.val)
            
            if current_max != -inf:
                result.append(current_max)

            upper_quque = lower_quque
            lower_quque = []
        
        return result