定义一个队列,依次加入队列头的子节点,并将队列头出队列,知道队列为空
# -*- 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 []
q=[root]
ans=[]
while q:
node=q.pop(0)
ans.append(node.val)
#左结点加入队列
if node.left:
q.append(node.left)
#右结点加入队列
if node.right:
q.append(node.right)
return ans