题目描述
从上到下按层打印二叉树，同一层结点从左至右输出。每一层输出一行。
思路
层序打印即可。
class Solution:
# 返回二维列表[[1,2],[4,5]]
def Print(self, pRoot):
# write code here
if not pRoot: return []
queue = [pRoot]
res = []
while queue:
n = len(queue)
temp = []
for _ in range(n):
node = queue.pop(0)
temp.append(node.val)
if node.left: queue.append(node.left)
if node.right: queue.append(node.right)
res.append(temp)
return res
Your article helped me a lot, is there any more related content? Thanks!