【发布时间】:2016-02-03 02:13:37
【问题描述】:
我刚开始用 Python 编程,所以请注意我可能遗漏了一些基本的东西。我尝试用 Python3 制作我的第一个二叉树,一切看起来都很好。下一步是尝试打印我的树(有序),但这样做只会导致两个空格。有什么想法我犯了错误吗?
class Node:
def __init__(self, newvalue):
self.left=None
self.right=None
self.newvalue=newvalue
class Tree:
def __init__(self):
self.root=None
def put(self, newvalue):
self.root=puter(self.root, newvalue)
def write(self):
writer(self.root)
print("\n")
def writer(root):
if root != None:
writer(root.left)
print(root.newvalue)
writer(root.right)
def puter(root, newvalue):
if root == None:
root = Node(newvalue)
else:
if newvalue < root:
if root.left != None:
puter(newvalue, root.left)
else:
root.left=Node(newvalue)
else:
if root.right !=None:
puter(newvalue, root.right)
else:
root.right = Node(newvalue)
tree = Tree()
tree.put("bird")
tree.put("snake")
tree.put("lion")
tree.put("elephant")
tree.put("snail")
tree.write()
最好的问候,
【问题讨论】:
标签: python tree binary-tree nodes