# bst.print(traversal_type=Traversal.POSTORDER)
# bst.print(traversal_type=Traversal.INORDER)
# print('\n')
# print('After deleting: ')
# bst.set_root(bst.delete_node(bst.get_root(), 2))
# bst.set_root(bst.delete_node(bst.get_root(), 73))
# bst.set_root(bst.delete_node(bst.get_root(), 3))
# bst.set_root(bst.delete_node(bst.get_root(), 1))
# bst.set_root(bst.delete_node(bst.get_root(), 4))
# bst.print()
# bst.set_root(bst.delete_node(bst.get_root(), 7))
# bst.set_root(bst.delete_node(bst.get_root(), 5))
# bst.set_root(bst.delete_node(bst.get_root(), 10))
# bst.print()
bt.set_root(bt.clear_all_roots(bt.get_root()))
bt.print()
# bst.set_root(bst.delete_node(bst.get_root(), 1))
# bst.set_root(bst.delete_node(bst.get_root(), 2))
# bst.print()
# bst1 = BinarySearchTree()
# bst1.insert(3)
# bst1.insert(5)
# bst1.print()
# bst1.root = bst1.delete_node(bst1.get_root(), 3)
# bst1.root = bst1.delete_node(bst1.get_root(), 5)
# bst1.print()
tree = BinaryTree()
tree.add_to_tree(tree.get_root(), 3)
print(a)
inp = int(input('Enter valid choice: '))
if inp == 1:
b = input('Enter the element you want to insert at root: ')
bt.set_root(b)
elif inp == 2:
ele = input('Enter the element you want to insert the data at left: ')
dat = input("Enter the data you want to insert: ")
bt.insert_left(ele, dat)
elif inp == 3:
ele = input('Enter the element you want to insert the data at right: ')
dat = input("Enter the data you want to insert: ")
bt.insert_right(ele, dat)
elif inp == 4:
ele = input('Enter the node to calculate the height ')
node = bt.find(bt.get_root(), ele)
print('Height of tree from the node {} is {}'.format(
ele, bt.height(node)))
elif inp == 5:
print('Size of the tree is {}'.format(bt.size(bt.get_root())))
elif inp == 6:
print('Pre-order traversal:')
bt.preOrderTraversal(bt.get_root())
elif inp == 7:
print('In-order Traversal')
bt.inOrderTraversal(bt.get_root())
elif inp == 8:
print('Post-order traversal: ')
bt.postOrderTraversal(bt.get_root())
elif inp == 9:
print('Level-order traversal:')
