Initializacia
This commit is contained in:
parent
36f9d01893
commit
8d07713b65
@ -1,6 +1,5 @@
|
|||||||
#include <stdio.h>
|
#include <stdio.h>
|
||||||
#include <string.h>
|
#include <string.h>
|
||||||
#include <assert.h>
|
|
||||||
#include <stdlib.h>
|
#include <stdlib.h>
|
||||||
|
|
||||||
#define SIZE 100
|
#define SIZE 100
|
||||||
@ -18,7 +17,7 @@ struct tree* read_tree() {
|
|||||||
if (!r || buffer[0] == '\n') {
|
if (!r || buffer[0] == '\n') {
|
||||||
return NULL;
|
return NULL;
|
||||||
}
|
}
|
||||||
buffer[strcspn(buffer, "\n")] = 0;
|
buffer[strcspn(buffer, "\n")] = 0;
|
||||||
struct tree* node = calloc(1, sizeof(struct tree));
|
struct tree* node = calloc(1, sizeof(struct tree));
|
||||||
strncpy(node->value, buffer, SIZE - 1);
|
strncpy(node->value, buffer, SIZE - 1);
|
||||||
return node;
|
return node;
|
||||||
@ -30,15 +29,11 @@ struct tree* load_tree() {
|
|||||||
return NULL;
|
return NULL;
|
||||||
}
|
}
|
||||||
|
|
||||||
if (node->value[0] != '*') {
|
if (node->value[0] != '*') {
|
||||||
node->left = load_tree();
|
node->left = load_tree();
|
||||||
node->right = load_tree();
|
node->right = load_tree();
|
||||||
} else {
|
|
||||||
node->left = NULL;
|
|
||||||
node->right = NULL;
|
|
||||||
}
|
}
|
||||||
return node;
|
return node;
|
||||||
}
|
|
||||||
|
|
||||||
void run_tree(struct tree* tree) {
|
void run_tree(struct tree* tree) {
|
||||||
if (!tree) {
|
if (!tree) {
|
||||||
@ -46,11 +41,11 @@ void run_tree(struct tree* tree) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
if (tree->value[0] == '*') {
|
if (tree->value[0] == '*') {
|
||||||
printf("%s\nKoniec\n", tree->value + 1);
|
printf("%s\nKoniec\n", tree->value + 1);
|
||||||
return;
|
return;
|
||||||
}
|
}
|
||||||
|
|
||||||
printf("%s\n", tree->value);
|
printf("%s\n", tree->value);
|
||||||
|
|
||||||
char response;
|
char response;
|
||||||
if (scanf(" %c", &response) != 1) {
|
if (scanf(" %c", &response) != 1) {
|
||||||
@ -79,7 +74,9 @@ void destroy_tree(struct tree* tree) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
void count_items(struct tree* tree, int* count) {
|
void count_items(struct tree* tree, int* count) {
|
||||||
if (tree->left == NULL && tree->right == NULL) {
|
if (!tree) return;
|
||||||
|
|
||||||
|
if (tree->value[0] == '*') {
|
||||||
(*count)++;
|
(*count)++;
|
||||||
} else {
|
} else {
|
||||||
if (tree->left) count_items(tree->left, count);
|
if (tree->left) count_items(tree->left, count);
|
||||||
@ -90,6 +87,7 @@ void count_items(struct tree* tree, int* count) {
|
|||||||
int main() {
|
int main() {
|
||||||
struct tree* root = load_tree();
|
struct tree* root = load_tree();
|
||||||
printf("Expert z bufetu to vie.\n");
|
printf("Expert z bufetu to vie.\n");
|
||||||
|
|
||||||
if (!root) {
|
if (!root) {
|
||||||
printf("Chybna databaza\n");
|
printf("Chybna databaza\n");
|
||||||
return 0;
|
return 0;
|
||||||
|
Loading…
Reference in New Issue
Block a user