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

buffet

Browse Source
This commit is contained in:
Maryna Kravtsova 2020-11-22 16:10:13 +01:00
parent cfb3f31df3
commit 1fd6b53ecc
1 changed files with 2 additions and 21 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

21
cv8/program.c
View File

@ -92,25 +92,6 @@ struct tree* find_minimum(struct tree *root){
void destroy_tree(struct tree* root){ void destroy_tree(struct tree* root){
if(root == NULL) return; if(root == NULL) return;
/*if(root->left == NULL && root->right == NULL){
free(root);
return NULL;
}
else if(root->left == NULL || root->right == NULL){
struct tree* temp;
if(root->left == NULL){
temp = root->right;
}else{
temp = root->left;
}
free(root);
return temp;
}
else {
struct tree* this = find_minimum(root->left);
strcpy(root->value, this->value);
root->right = destroy_tree(root->right);
}*/
destroy_tree(root->left); destroy_tree(root->left);
destroy_tree(root->right); destroy_tree(root->right);
free(root); free(root);
@ -155,7 +136,7 @@ int main(){
printf("Expert z bufetu to vie.\n"); printf("Expert z bufetu to vie.\n");
printf("Pozna %d druhov ovocia a zeleniny.\n", count); printf("Pozna %d druhov ovocia a zeleniny.\n", count);
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);
search(tree); search(tree);
destroy_tree(tree); destroy_tree(tree);
printf("Koniec\n"); printf("Koniec\n");