def main():
print("Tree BFS traversal with manual queue")
l = [12, 5, 6, 3, 1, 15, 19, 21, 13, 14, 23]
print(l)
root = create_tree(l)
print_level_tree(root)
bfs_manual(root)
def main():
l = [23, 15, 6, 21, 20, 18, 19, 43, 32, 36, 39, 44, 45]
root = create_tree(l)
print_tree(root)
print_level_tree(root)
preorder_iter(root)
inorder_iter(root)
postorder_iter(root)
def main():
l = [12, 6, 19, 4, 8, 14, 13, 1, 8, 16, 22, 28]
#l = [2, 1, 3, 4]
print(l)
root = create_tree(l)
#print_tree(root)
print_level_tree(root)
prev_node = [None]
header = [None]
bst_dll(root, prev_node, header)
node = header[0]
while node:
print(node.data, ", ", end=' ')
node = node.right
def main():
print("finding kth smallest element in a tree")
l = [12, 6, 19, 4, 8, 14, 13, 1, 8, 16, 22, 28]
#l = [2, 1, 3, 4]
print(l)
root = create_tree(l)
#print_tree(root)
print_level_tree(root)
k = 5
list_k = [k, -1]
#list_k.append(k)
#find_kth_smallest(root, list_k)
#find_kth_smallest_iter(root, list_k)
#find_kth_largest_rec(root, list_k)
find_kth_largest_iter(root, list_k)
if list_k[0] == -1:
print(k, "th element not present!!")
else:
print(k, "th element is:" , list_k[1])
def main():
l = [23, 14, 26, 19, 9, 33, 31, 28, 29, 6, 2]
root = create_tree(l)
print_level_tree(root)
dfs(root)