# -*- 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
result=[]
if not root:
return []
stack=[root]
while stack:
current=stack.pop(0)
result.append(current.val)
if current.left:
stack.append(current.left)
if current.right:
stack.append(current.right)
return result
11-17