mk757ye/usaa20
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

buffer

Browse Source
This commit is contained in:
Maryna Kravtsova 2020-11-22 15:31:34 +01:00
parent 83f87f5e94
commit d267e4d1c0
1 changed files with 6 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
cv8/program.c
View File

@ -74,10 +74,10 @@ struct tree* find_minimum(struct tree *root){
} }
struct tree* destroy_tree(struct tree* root){ void tree* destroy_tree(struct tree* root){
if(root == NULL) return; if(root == NULL) return;
if(root->left == NULL && root->right == NULL){ /*if(root->left == NULL && root->right == NULL){
free(root); free(root);
return NULL; return NULL;
} }
@ -95,9 +95,9 @@ struct tree* destroy_tree(struct tree* root){
struct tree* this = find_minimum(root->left); struct tree* this = find_minimum(root->left);
strcpy(root->value, this->value); strcpy(root->value, this->value);
root->right = destroy_tree(root->right); root->right = destroy_tree(root->right);
} }*/
root->left = destroy_tree(root->left); destroy_tree(root->left);
root->right = destroy_tree(root->right); destroy_tree(root->right);
free(root); free(root);
root = NULL; root = NULL;
} }
@ -142,7 +142,7 @@ int main(){
printf("Odpovedajte 'a' pre prvu moznost alebo 'n' pre druhu moznost.\n"); printf("Odpovedajte 'a' pre prvu moznost alebo 'n' pre druhu moznost.\n");
printf("%s\n", tree->value); printf("%s\n", tree->value);
tree = search(tree); tree = search(tree);
tree = destroy_tree(tree); destroy_tree(tree);
printf("Koniec\n"); printf("Koniec\n");
return 0; return 0;
} }