from linked_binary_tree import LinkedBinaryTree # Construct Tree: T = LinkedBinaryTree() T.add_root(1) p1 = T.add_left(T.root(), 2) p2 = T.add_right(T.root(), 3) T.add_left(p1, 4) T.add_right(p1, 5) p3 = T.add_left(p2, 6) p4 = T.add_right(p2, 7) T.add_left(p3, 8) T.add_right(p3, 9) T.add_right(p4, 10) # Check Traversals: print("\nPreorder: ") for p in T.preorder(): print(p.element()) print("\nPostorder: ") for p in T.postorder(): print(p.element()) print("\nInorder: ")