https://leetcode-cn.com/problems/cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof/
从上到下按层打印二叉树,同一层的节点按从左到右的顺序打印,每一层打印到一行。
思路:这个和剑指 Offer 32 - I
从上到下打印二叉树 的区别是,这个需要分层输出。所以每开始入下一层节点前,需要先将当前队列长度num记录好。
# 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):
"""
:type root: TreeNode
:rtype: List[List[int]]
"""
result = list()
if root is None:
return result
tree = list()
tree.append(root)
while len(tree) != 0:
tmp = list()
num = len(tree)
for i in range(0, num):
node = tree.pop(0)
tmp.append(node.val)
if node.left:
tree.append(node.left)
if node.right:
tree.append(node.right)
result.append(tmp)
return result