/* find deepest common ancestor */
btnode* bt_ancestor(bintree *tree, int v1, int v2) {
btnode *a;
bool c, d; /* comparisons */
a = tree -> root;
if (!(bt_contains(tree, v1) && bt_contains(tree, v2))) {
return NULL;
}
c = d = false;
while (a != NULL) {
int v = a -> value;
c = v1 < v;
d = v2 < v;
if (c ^ d) {
/* diverged; a is the common ancestor */
return a;
} else {
a = c ? a -> left : a -> right;
}
}
/* something weird happened */
return NULL;
}
void test_bt_1(CuTest* tc) {
int val;
int i;
bt* tree;
tree = bt_new(sizeof(int), 4);
printf("Empty:\n");
bt_print(tree, print_int);
printf("\n");
{
int vals[] = { 10, 5, 100, 10, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 200,200,200,200,200,250,150 };
for (i=0; i<sizeof(vals)/sizeof(int); i++) {
val = vals[i];
printf("Insert %i:\n", val);
bt_insert(tree, &val, 0, compare_ints);
//bt_print(tree, print_int);
printf("\n");
}
}
printf("Values: ");
for (i=0; i<tree->N; i++) {
int val = *(int*)bt_access(tree, i);
printf("%i ", val);
// these tests depend on the values in the "vals" array above.
if (i < 11) {
CuAssertIntEquals(tc, 1, val);
} else if (i < 12) {
CuAssertIntEquals(tc, 5, val);
} else if (i < 14) {
CuAssertIntEquals(tc, 10, val);
} else if (i < 16) {
CuAssertIntEquals(tc, 50, val);
} else if (i < 17) {
CuAssertIntEquals(tc, 100, val);
} else if (i < 18) {
CuAssertIntEquals(tc, 150, val);
} else if (i < 23) {
CuAssertIntEquals(tc, 200, val);
} else {
CuAssertIntEquals(tc, 250, val);
}
}
printf("\n");
{
int vals[] = { 0, 1, 2, 9, 10, 11, 49, 50, 51, 99, 100, 101, 149, 150, 151, 199, 200, 201, 249, 250, 251 };
int doesit[]={ 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0 };
for (i=0; i<sizeof(vals)/sizeof(int); i++) {
int youthink;
val = vals[i];
youthink = bt_contains(tree, &val, compare_ints);
printf("Contains %i: %s\n", val, (youthink ? "yes" : "no"));
CuAssertIntEquals(tc, doesit[i], youthink);
}
}
bt_free(tree);
}
