Find Largest Value in Each Tree Row LeetCode solution in Python

1
class Solution(object):
2
    def largestValues(self, root):
3
        """
4
        :type root: TreeNode
5
        :rtype: List[int]
6
        """
7
        if not root:
8
            return []
9
        ans = []
10
        q = []
11
        q.append(root)
12
        while q:
13
            s = len(q)
14
            t = []
15
            for i in range(s):
16
                n = q.pop(0)
17
                t.append(n.val)
18
                if n.left:
19
                    q.append(n.left)
20
                if n.right:
21
                    q.append(n.right)
22
            ans.append(max(t))
23
        return ans