牛客网链接
# -*- 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 root==None:return []
ans,temp=[],[]
temp.append(root)
while temp:
currentRoot=temp.pop(0)
ans.append(currentRoot.val)
if currentRoot.left:
temp.append(currentRoot.left)
if currentRoot.right:
temp.append(currentRoot.right)
return ans