int main(int argc, char **argv) { int i; struct bstree *tree = bstree_new(©fn, &freefn, &int_cmp, 0); int test[] = {20, 15, 32, 40, 25}; for (i = 0; i < sizeof(test)/sizeof(test[0]); i++) { bstree_insert(tree, &test[i], NULL); } test_start(argv); test_case1(tree); assert(bstree_rotate_left(NULL, NULL) == 0); assert(bstree_rotate_left(NULL, tree->root) == 0); assert(bstree_rotate_left(tree, NULL) == 0); assert(bstree_rotate_left(tree, tree->root) == 1); test_case2(tree); assert(bstree_rotate_right(NULL, NULL) == 0); assert(bstree_rotate_right(NULL, tree->root) == 0); assert(bstree_rotate_right(tree, NULL) == 0); assert(bstree_rotate_right(tree, tree->root) == 1); test_case1(tree); test_end(); bstree_delete(tree); return 0; }
int main(int argc, char **argv) { int n; if (argc == 1) { test_case1(); test_case2(); } for (n = 1; n < argc; ++n) { printf("argv[%d]: ", n); test_parse(argv[n]); printf("\n"); } return 0; }