LC 0515 [M] Find Largest Value in Each Tree Row - ALawliet/algorithms GitHub Wiki

class Solution:
    def largestValues(self, root: TreeNode) -> List[int]:
        if not root: return []
        
        levels = []
        
        Q = deque([root])
        
        while Q:
            w = len(Q)
            
            level = []
            
            for _ in range(w):
                node = Q.popleft()
                
                level.append(node.val)
                
                if node.left:
                    Q.append(node.left)
                if node.right:
                    Q.append(node.right)
                    
            levels.append(max(level))
            
        return levels