题目![在这里插入图片描述](https://img-blog.csdnimg.cn/20210710235529582.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3NpbmF0XzQwNDY5ODgz,size_16,color_FFF
# 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: TreeNode) -> List[List[int]]:
if not root: return []
queue = collections.deque([root])
res = []
while queue:
n = len(queue)
tmp = []
for _ in range(n):
cur = queue.popleft()
tmp.append(cur.val)
if cur.left: queue.append(cur.left)
if cur.right: queue.append(cur.right)
res.append(tmp)
return res