print("left_child ", test_tr.get_left_child()) test_tr.insert_left(' b') print("left_child ", test_tr.get_left_child()) print("left_child().get_root_val ", test_tr.get_left_child().get_root_val()) test_tr.insert_left(' bb') print("left_child ", test_tr.get_left_child()) print("left_child().get_root_val ", test_tr.get_left_child().get_root_val()) test_tr.insert_right(' c') print("right_child ", test_tr.get_right_child()) print("right_child().get_root_val ", test_tr.get_right_child().get_root_val()) test_tr.get_right_child().set_root_val(' hello') print("right_child().get_root_val", test_tr.get_right_child().get_root_val()) test_tr.inorder() a_node = LinkedBinaryTree('A') a_node.insert_left('B') a_node.insert_right('C') b_node = a_node.left_child b_node.insert_right('D') c_node = a_node.right_child c_node.insert_left('E') c_node.insert_right('F') d_node = b_node.right_child e_node = c_node.left_child f_node = c_node.right_child
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: ") for p in T.inorder(): print(p.element())