#! /usr/bin/env python
from Tree import Node, BinaryTree
tarray = [1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16]
mid = int(len(tarray)/2)
print("Mid: {}".format(mid))
rootnode = Node(tarray[mid])
print("rootnode: {}".format(rootnode))
bintree = BinaryTree(rootnode)
for j,item in enumerate(tarray):
if item == tarray[mid]:
continue
in_node = Node(tarray[j])
bintree.insert(bintree.root, in_node)
print("bintree in_order_traversal from root:")
bintree.in_order_traversal(bintree.root)
Aten_node = Node(10)
Atwelve_node = Node(12)
Afourteen_node = Node(14)
Aeighteen_node = Node(18)
ten_tree = BinaryTree(Aten_node)
ten_tree.insert(ten_tree.root, Afive_node)
ten_tree.insert(ten_tree.root, Aseven_node)
ten_tree.insert(ten_tree.root, Atwo_node)
ten_tree.insert(ten_tree.root, Atwelve_node)
ten_tree.insert(ten_tree.root, Aeighteen_node)
ten_tree.insert(ten_tree.root, Afour_node)
ten_tree.insert(ten_tree.root, Afourteen_node)
print("in_order_traversal from root:")
ret_tree.in_order_traversal(ret_tree.root)
# print("in_order_traversal from six_node:")
# ret_tree.in_order_traversal(six_node)
# print("successor of one_node: {}".format(ret_tree.get_successor(one_node)))
# print("successor of root_node: {}".format(ret_tree.get_successor(ret_tree.root)))
# print("successor of three_node: {}".format(ret_tree.get_successor(three_node)))
print("\nTEN TREE")
print("ten_tree in_order_traversal from root:")
ret_tree.in_order_traversal(ten_tree.root)
# print("successor of Atwo_node: {}".format(ret_tree.get_successor(Atwo_node)))
# print("successor of root_node: {}".format(ret_tree.get_successor(ret_tree.root)))
# print("successor of Aseven_node: {}".format(ret_tree.get_successor(Aseven_node)))
