diff options
Diffstat (limited to 'binary_search_tool/full_bisect_test/main.c')
-rw-r--r-- | binary_search_tool/full_bisect_test/main.c | 30 |
1 files changed, 30 insertions, 0 deletions
diff --git a/binary_search_tool/full_bisect_test/main.c b/binary_search_tool/full_bisect_test/main.c new file mode 100644 index 00000000..55abc44b --- /dev/null +++ b/binary_search_tool/full_bisect_test/main.c @@ -0,0 +1,30 @@ +#include <stdlib.h> +#include <stdio.h> +#include "bin-trees.h" + +int integers[] = {35, 28, 20, 30, 25, 23, 26, 60, 70, 65, 64, 68 }; + +char pre_order[] = { '/', '-', '+', '*', 'a', '^', 'x', '2', '&', 'b', 'y', + 'c', '3' }; +char in_order[] = { 'a', '*', 'x', '^', '2', '+', 'b', '&', 'y', '-', 'c', + '/', '3' }; + +int +main (int argc, char ** argv) +{ + int intlist_size = 12; + int i; + tree_ptr root = NULL; + for (i = 0; i < intlist_size; ++i) + { + search_tree_insert (&root, integers[i]); + } + pre_order_traverse (root); + printf ("\n"); + pre_order_traverse_no_recurse (root); + printf ("\n"); + in_order_traverse (root); + printf ("\n"); + in_order_traverse_no_recurse (root); + return 0; +} |