class Node:
def __init__(self,key,value=-1):
self.left = None
self.right = None
self.key = key
self.value = value
def insert(root,key,value=-1):
if root is None:
root = Node(key,value)
else:
if key < root.value:
root.left = insert(root.left,key,value)
elif key > root.value:
root.right = insert(root.right,key,value)
else:
pass
return root
def inorder(root):
if root is not None:
inorder(root.left)
print(root.value)
inorder(root.right)
if __name__ == '__main__':
root = None
data = [4,1,2,5,3,7,9,6,8]
for i,point in enumerate(data):
root = insert(root,point,i)
inorder(root)
结果
0 1 2 3 5 6 8
