# -*- 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):
res = [];
qu = [];
if root == [] or root == None:
return res;
qu.append(root);
while len(qu)>0:
rootTemp = qu.pop(0);
res.append(rootTemp.val);
if(rootTemp.left != None):
qu.append(rootTemp.left);
if(rootTemp.right != None):
qu.append(rootTemp.right);
return res;
# write code here
从上往下打印出二叉树的每个节点,同层节点从左至右打印。
最新推荐文章于 2019-08-26 11:19:00 发布