Initializacia
This commit is contained in:
parent
f533cab35c
commit
e14c23ba01
@ -1,5 +1,6 @@
|
|||||||
#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
|
||||||
@ -17,7 +18,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;
|
||||||
@ -28,12 +29,10 @@ struct tree* load_tree() {
|
|||||||
if (!node) {
|
if (!node) {
|
||||||
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();
|
||||||
}
|
}
|
||||||
|
|
||||||
return node;
|
return node;
|
||||||
}
|
}
|
||||||
|
|
||||||
@ -66,20 +65,16 @@ void run_tree(struct tree* tree) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
void destroy_tree(struct tree* tree) {
|
void destroy_tree(struct tree* tree) {
|
||||||
if (!tree) {
|
if (tree->left != NULL) {
|
||||||
return;
|
destroy_tree(tree->left);
|
||||||
|
}
|
||||||
|
if (tree->right != NULL) {
|
||||||
|
destroy_tree(tree->right);
|
||||||
}
|
}
|
||||||
|
|
||||||
destroy_tree(tree->left);
|
|
||||||
destroy_tree(tree->right);
|
|
||||||
free(tree);
|
free(tree);
|
||||||
}
|
}
|
||||||
|
|
||||||
void count_items(struct tree* tree, int* count) {
|
void count_items(struct tree* tree, int* count) {
|
||||||
if (!tree) {
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
|
|
||||||
if (tree->left == NULL && tree->right == NULL) {
|
if (tree->left == NULL && tree->right == NULL) {
|
||||||
(*count)++;
|
(*count)++;
|
||||||
} else {
|
} else {
|
||||||
@ -90,9 +85,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