buffet

cv8/program.c

@@ -63,11 +63,41 @@ void print_tree(struct tree* tree,int offset){
     }
 } 
 
-void destroy_tree(struct tree* root){
+struct tree* find_minimum(struct tree *root){
+    if(root == NULL){
+        return NULL;
+    }
+    else if(root->left != NULL){
+        return find_minimum(root->left); 
+    }
+    return root;
+}
+
+
+struct tree* destroy_tree(struct tree* root){
     if(root == NULL) return;
      
-    destroy_tree(root->left);
+    if(root->left == NULL && root->right == NULL){
-    destroy_tree(root->right);   
+        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);
+    }
+    root->left = destroy_tree(root->left);
+    root->right = destroy_tree(root->right);   
     free(root);
     root = NULL;
 }
@@ -111,8 +141,7 @@ int main(){
     printf("Pozna %d druhov ovocia a zeleniny.\n", count);
     printf("Odpovedajte 'a' pre prvu moznost alebo 'n' pre druhu moznost.\n");
     printf("%s\n", tree->value);   
-    //tree = search(tree);   
+    tree = search(tree);   
-    
     destroy_tree(tree);
     printf("Koniec\n");     
     return 0;