#--*--coding:utf8--*--
from collections import deque
class TreeNode(object):
def __init__(self, x):
self.val = x
self.left = None
self.right = None
class Tree(object):
def __int__(self):
self.root = None
def geTree(self, arrList):
if not arrList:
return None
arrLen = len(arrList)
self.root = TreeNode(arrList[0])
treeDeque = deque([self.root])
num = 1
while num < arrLen:
node = treeDeque.popleft()
if node is not None:
print node.val,node.left,node.right
node.left = TreeNode(arrList[num]) if arrList[num] is not None else None
treeDeque.append(node.left)
num += 1
if num < arrLen:
node.right = TreeNode(arrList[num]) if arrList[num] is not None else
python 输入list,输出一棵树
最新推荐文章于 2022-10-31 11:08:56 发布