cv7
This commit is contained in:
parent
deaaf957f5
commit
973fe76c08
@ -10,7 +10,7 @@ struct tree {
|
|||||||
struct tree* right;
|
struct tree* right;
|
||||||
};
|
};
|
||||||
|
|
||||||
struct tree* read_tree(){
|
struct tree* read_tree(int counter){
|
||||||
char buffer[SIZE];
|
char buffer[SIZE];
|
||||||
memset(buffer, 0, SIZE);
|
memset(buffer, 0, SIZE);
|
||||||
char* r = fgets(buffer, SIZE, stdin);
|
char* r = fgets(buffer, SIZE, stdin);
|
||||||
@ -18,24 +18,57 @@ struct tree* read_tree(){
|
|||||||
return NULL;
|
return NULL;
|
||||||
}
|
}
|
||||||
assert(r);
|
assert(r);
|
||||||
struct tree* node = calloc(1, sizeof(struct tree));
|
struct tree* tree = calloc(1, sizeof(struct tree));
|
||||||
node->value = malloc(strlen(buffer) + 1);
|
tree->value = malloc(strlen(buffer) + 1);
|
||||||
assert(node->value);
|
strcpy(tree->value,r);
|
||||||
node->left = read_tree();
|
assert(tree->value);
|
||||||
node->right = read_tree();
|
if (buffer[0] == '*') {
|
||||||
return node;
|
counter++;
|
||||||
|
return tree;
|
||||||
|
}
|
||||||
|
tree->left = read_tree(counter);
|
||||||
|
tree->right = read_tree(counter);
|
||||||
|
return tree;
|
||||||
}
|
}
|
||||||
|
|
||||||
void destroy_tree(struct tree* node) {
|
void destroy_tree(struct tree* tree) {
|
||||||
if (node == NULL) return;
|
if (tree == NULL) return;
|
||||||
destroy_tree(node->left);
|
destroy_tree(tree->left);
|
||||||
destroy_tree(node->right);
|
destroy_tree(tree->right);
|
||||||
free(node);
|
free(tree->value);
|
||||||
|
free(tree);
|
||||||
|
}
|
||||||
|
|
||||||
|
void print_tree(struct tree* tree,int offset){
|
||||||
|
char buffer[SIZE];
|
||||||
|
memset(buffer, 0, SIZE);
|
||||||
|
for (int i = 0; i < offset && tree->value[0] != '*'; i++){
|
||||||
|
printf(" ");
|
||||||
|
}
|
||||||
|
printf("%s",tree->value);
|
||||||
|
if(tree->value[0] == '*'){
|
||||||
|
printf("Koniec\n");
|
||||||
|
exit(0);
|
||||||
|
}
|
||||||
|
char r = getchar();
|
||||||
|
if (r == 'a') {
|
||||||
|
print_tree(tree->left, offset + 3);
|
||||||
|
} else if (r == 'n') {
|
||||||
|
print_tree(tree->right, offset + 3);
|
||||||
|
} else {
|
||||||
|
printf("CHYBOVY VSTUP!\n");
|
||||||
|
exit(0);
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
int main(){
|
int main(){
|
||||||
struct tree* root = read_tree();
|
int counter = 0;
|
||||||
read_tree();
|
int offset = 0;
|
||||||
|
struct tree* root = read_tree(counter);
|
||||||
|
printf("Expert z bufetu to vie.\n");
|
||||||
|
printf("Pozna %d druhov ovocia a zeleniny.\n",counter);
|
||||||
|
printf("Odpovedajte 'a' pre prvu moznost alebo 'n' pre druhu moznost.\n");
|
||||||
|
print_tree(root,offset);
|
||||||
destroy_tree(root);
|
destroy_tree(root);
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
BIN
cv7/program.exe
BIN
cv7/program.exe
Binary file not shown.
Loading…
Reference in New Issue
Block a user