int main() { Tree T = NULL; for (int i = 0; i < 10; i++) { insertOrder(T, i); } std::cout << std::endl; mid_order(T); std::cout << std::endl; delete_tree(T, 5); mid_order(T); std::cout << std::endl; return 0; }
int main(void) { Tree tree; printf("Create Tree (non-integer to stop):\n"); create_tree(&tree); printf("\nPre Order:\n"); pre_order(tree); printf("\nMid Order:\n"); mid_order(tree); printf("\nPost Order:\n"); post_order(tree); printf("\nLever Order:\n"); level_order(tree); empty_tree(&tree); return 0; }