void aTest3() {
int arr[] = {3, 4, 5, 6, 7, 8, 10, 11, 12, 13, 14, 15, 17};
struct node * root = to_red_black_tree(arr, 13);
assert(is_red_black_tree(root));
printf("finished atest3\n\n");
}
void aTest2() {
int arr[] = {1, 6, 8, 11, 13, 15, 17, 22, 25, 27};
struct node * root = to_red_black_tree(arr, 10);
assert(root->key == 13);
assert(is_red_black_tree(root));
printf("finished atest2\n\n");
}
void aTest5() {
int arr[] = {3, 4};
struct node * root = to_red_black_tree(arr, 2);
assert(is_red_black_tree(root));
setNodeRed(root);
assert(!is_red_black_tree(root));
printf("finished atest5\n\n");
}
void aTest1() {
int arr[] = {2, 4, 6};
struct node * root = to_red_black_tree(arr, 3);
assert(root->key == 4);
assert(is_red_black_tree(root));
printf("finished atest1\n\n");
}
void test_red_black(int size) {
printf("Making a tree of size %i...\n", size);
struct node* rbroot = to_red_black_tree(elems, size);
printf("Checking if the tree was well-formed\n");
if (is_red_black_tree(rbroot)) {
printf("PASS\n");
}
else {
printf("\tFAIL\n");
}
}
void aTest4() {
int arr[] = {3};
struct node * root = to_red_black_tree(arr, 1);
assert(is_red_black_tree(root));
printf("finished atest4\n\n");
}
void aTest6() {
int arr[] = {3, 4, 5, 6};
struct node * root = to_red_black_tree(arr, 4);
assert(is_red_black_tree(root));
printf("finished atest6\n\n");
}
