void get_preorder(struct node *root, int *arr, int *index)
{
if (root == NULL)
return;
arr[(*index)++] = root->data;
get_preorder(root->left, arr, index);
get_preorder(root->right, arr, index);
}
void preorder(struct node *root, int *arr)
{
if (root == NULL || arr == NULL)
return;
int index = 0;
get_preorder(root, arr, &index);
}
int main()
{
struct BSTree* t;
printf("testing tree create...");
if ((t = tree_create()) == NULL)
goto fail;
printf("[ok]\n");
int arr[10], count, ref[10] = { 4, 2, 1, 3, 6, 5 };
int i;
printf("testing add/search...");
add(t,4);
add(t,2);
add(t,6);
add(t,1);
add(t,3);
add(t,5);
if (!search(t,1) || !search(t,2) || !search(t,3) ||
!search(t,4) || !search(t,5) || !search(t,6) )
goto fail;
if (search(t,8) || search(t,9))
goto fail;
printf("[ok]\n");
printf("testing get_preorder...");
get_preorder(t, arr, &count);
if (count != 6)
goto fail;
for (i = 0; i < 6; i++) {
if (arr[i] != ref[i])
goto fail;
}
printf("[ok]\n");
printf("testing count_non_leaf_nodes...");
if (count_non_leaf_nodes(t) != 3)
goto fail;
printf("[ok]\n");
return 0;
fail:
printf("[failed]\n");
return -1;
}
