int tree_length(struct node* root) { if (root == NULL) return 0; else return(tree_length(root->left) + tree_length(root->right) + 1); }
void merge_two_bst(struct node *root1, struct node *root2){ if (root1 == NULL || root2 == NULL) return; int t1_len = tree_length(root1); int t2_len = tree_length(root2); }
int main(void) { struct Node *restrict root; struct Node *restrict node; const int exit_status = tree_create(&root, 20u); if (exit_status == 0u) { tree_print(root); PRINT_IS_SORTED(); tree_invert(root); tree_print(root); PRINT_IS_SORTED(); printf("tree_length: %u\n", tree_length(root)); PRINT_NTH(0); PRINT_NTH(-1); PRINT_NTH(10); PRINT_NTH(19); PRINT_NTH(20); tree_free(root); } else { puts("tree_create failed"); } return exit_status; }