题目说明:
从上往下打印出二叉树的每个节点,同层节点从左至右打印。(打印一个二叉树)
借助队列实现二叉树的遍历(本质上),思路很简单。
queue:用来存储遍历得到的二叉树
result:存储要输出的二叉树
# -*- coding:utf-8 -*-
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
# 返回从上到下每个节点值列表,例:[1,2,3]
def PrintFromTopToBottom(self, root):
# write code here
if not root:
return []
queue = [root]
result = []
while len(queue):
temp = queue.pop(0)
result.append(temp.val)
if temp.left:
queue.append(temp.left)
if temp.right:
queue.append(temp.right)
return result