注意的点:
1、队列注意用popleft
2、注意用len(queue)控制层数
# 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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:
res = []
q = [root]
if not root: return []
while q:
layer = []
l = len(q)
for _ in range(l):
top = q.pop(0)
layer.append(top.val)
if top.left: q.append(top.left)
if top.right: q.append(top.right)
res.append(layer)
return res