python實現二叉樹排序
阿新 • • 發佈:2019-01-23
一 程式碼
classBTree:
def __init__(self,value):
self.left =None
self.data = value
self.right =None
def insertLeft(self,value):
self.left =BTree(value)
return self.left
def insertRight(self,value):
self.right =BTree(value)
return self.right
def show(self):
print(self
#中序遍歷
def inorder(node):
if node.data:
if node.left:
inorder(node.left)
node.show()
if node.right:
inorder(node.right)
#中序遍歷,先遍歷右子樹
def rinorder(node):
if node.data:
if node.right:
rinorder(node.right)
node.show()
if node.left:
rinorder
def insert(node,value):
if value > node.data:
if node.right:
insert(node.right,value)
else:
node.insertRight(value)
else:
if node.left:
insert(node.left,value)
else:
node.insertLeft(value)
if __name__ =='__main__':
l =[3,5,7,20,43,
Root=BTree(l[0])
node =Root
for i in range(1,len(l)):
insert(Root,l[i])
print('***********************')
print('從小到大')
print('***********************')
inorder(Root)
print('***********************')
print('從大到小')
print('***********************')
rinorder(Root)
print('***********************')