mr314ot/usaa25
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

du6 - 14

Browse Source
This commit is contained in:
mr314ot 2025-11-17 10:43:35 +01:00
parent d3e8dc3723
commit 8d48338993
1 changed files with 31 additions and 41 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

72
du6/program.c
View File

@ -10,23 +10,15 @@ typedef struct tree {
struct tree *right; struct tree *right;
} Tree; } Tree;
int valid_db = 1; int valid_db = 1; // flag pre validitu databazy
//odstranit koncovy znak // odstranit koncovy znak \n
void strip_newline(char *s) { void strip_newline(char *s) {
int len = strlen(s); int len = strlen(s);
if (len > 0 && s[len-1] == '\n') if (len > 0 && s[len-1] == '\n')
s[len-1] = '\0'; s[len-1] = '\0';
} }
// uvolnenie pamate
void destroy_tree(Tree *t) {
if (!t) return;
destroy_tree(t->left);
destroy_tree(t->right);
free(t);
}
// rekurzivne nacitanie stromu v preorder // rekurzivne nacitanie stromu v preorder
Tree* read_tree() { Tree* read_tree() {
char buffer[SIZE]; char buffer[SIZE];
@ -34,7 +26,6 @@ Tree* read_tree() {
if (!fgets(buffer, SIZE, stdin)) if (!fgets(buffer, SIZE, stdin))
return NULL; return NULL;
// prazdny riadok -> koniec
if (strcmp(buffer, "\n") == 0) if (strcmp(buffer, "\n") == 0)
return NULL; return NULL;
@ -45,35 +36,38 @@ Tree* read_tree() {
strcpy(node->value, buffer); strcpy(node->value, buffer);
// odpoved -> list // list
if (buffer[0] == '*') { if (buffer[0] == '*') {
return node; return node;
} }
// inak nacitat oboch potomkov // očakávame presne 2 potomkov
node->left = read_tree(); node->left = read_tree();
node->right = read_tree(); if (!node->left) {
valid_db = 0;
if (!node->left || !node->right) { free(node);
valid_db = 0; return NULL;
destroy_tree(node->left);
destroy_tree(node->right);
free(node);
return NULL;
} }
long cur = ftell(stdin); node->right = read_tree();
if (fgets(buffer, SIZE, stdin)) { if (!node->right) {
if (strcmp(buffer, "\n") != 0 && buffer[0] != '*') { valid_db = 0;
valid_db = 0; destroy_tree(node->left);
} else { free(node);
fseek(stdin, cur, SEEK_SET); return NULL;
}
} }
return node; return node;
} }
// uvolnenie pamate
void destroy_tree(Tree *t) {
if (!t) return;
destroy_tree(t->left);
destroy_tree(t->right);
free(t);
}
// pocet listov = pocet tovarov // pocet listov = pocet tovarov
int count_leaves(Tree *t) { int count_leaves(Tree *t) {
if (!t) return 0; if (!t) return 0;
@ -90,19 +84,15 @@ void run_system(Tree *node) {
// list -> koniec // list -> koniec
if (!node->left && !node->right) { if (!node->left && !node->right) {
printf("Koniec\n"); printf("Koniec\n");
return; return;
} }
int c; char c;
if (scanf(" %c", &c) != 1) {
do { printf("Nerozumiem\n");
c = getchar(); return;
if (c == EOF) { }
printf("Koniec vstupu\n");
return;
}
} while (c=='\n' || c=='\r' || c==' ' || c=='\t');
if (c == 'a') { if (c == 'a') {
run_system(node->left); run_system(node->left);
@ -116,14 +106,14 @@ void run_system(Tree *node) {
int main() { int main() {
Tree *root = read_tree(); Tree *root = read_tree();
// nepodarilo sa nacitat koren -> chyba // kontrola prázdneho alebo chybného stromu
if (!root || !valid_db) { if (!root || !valid_db) {
printf("Expert z bufetu to vie.\n"); printf("Expert z bufetu to vie.\n");
printf("Chybna databaza\n"); printf("Chybna databaza\n");
return 0; return 0;
} }
// skontrolovat prazdny riadok // skontrolovat prazdny riadok po databaze
char buffer[SIZE]; char buffer[SIZE];
if (!fgets(buffer, SIZE, stdin) || strcmp(buffer, "\n") != 0) { if (!fgets(buffer, SIZE, stdin) || strcmp(buffer, "\n") != 0) {
printf("Koniec vstupu\n"); printf("Koniec vstupu\n");