#include #include #include #define SIZE 256 typedef struct Tree { char text[SIZE]; int isAnswer; struct Tree *yes; struct Tree *no; } Tree; Tree* readTree() { char line[SIZE]; if (fgets(line, SIZE, stdin) == NULL) return NULL; line[strcspn(line, "\r\n")] = 0; if (line[0] == '\0') return NULL; Tree *node = (Tree*)malloc(sizeof(Tree)); node->yes = NULL; node->no = NULL; if (line[0] == '*') { node->isAnswer = 1; int i = 1; while (line[i] == ' ') i++; strcpy(node->text, line + i); } else { node->isAnswer = 0; strcpy(node->text, line); node->yes = readTree(); node->no = readTree(); } return node; } int EmptyLine() { char line[SIZE]; if (fgets(line, SIZE, stdin) == NULL) return 0; return line[0] == '\n'; } int Leaves(Tree *node) { if (node == NULL) return 0; if (node->isAnswer) return 1; return Leaves(node->yes) + Leaves(node->no); } void freeTree(Tree *node) { if (node == NULL) return; freeTree(node->yes); freeTree(node->no); free(node); } void start(Tree *node) { char input[SIZE]; while (node != NULL && node->isAnswer == 0) { printf("%s\n", node->text); if (fgets(input, SIZE, stdin) == NULL) { printf("Nespravny vstup\n"); return; } int i = 0; while (input[i] == ' ' || input[i] == '\t') i++; if (input[i] == 'a') { node = node->yes; } else if (input[i] == 'n') { node = node->no; } else { printf("Nespravny vstup\n"); return; } } if (node && node->isAnswer) { printf("*%s\n", node->text); printf("Koniec\n"); } } int main() { printf("Expert z bufetu to vie.\n"); Tree *root = readTree(); if (root == NULL) { printf("Chyba nacitania\n"); return 0; } int count = Leaves(root); printf("Pozna %d druhov ovocia a zeleniny.\n", count); printf("Odpovedajte 'a' pre prvu moznost alebo 'n' pre druhu moznost.\n"); start(root); freeTree(root); return 0; }