题目描述:
代码:
# Definition for a binary tree node.
# class TreeNode(object):
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution(object):
def levelOrder(self, root):
if not root: return []
#构造列表存储结果,双边队列存储节点
res,que=[],collections.deque()
que.append(root)
while que:
temp=[]
#循环取节点值
for _ in range(len(que)):
node=que.popleft()
temp.append(node.val)
if node.left: que.append(node.left)
if node.right: que.append(node.right)
res.append(temp)
return res