yy153dm/usaa24
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Update cv7/program.c

Browse Source
This commit is contained in:
Yurii Yakovenko 2024-11-11 21:59:46 +00:00
parent 6d8fbb2e83
commit 67de6c8629
1 changed files with 13 additions and 14 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

27
cv7/program.c
View File

@ -4,13 +4,14 @@
#include <assert.h> #include <assert.h>
#include <string.h> #include <string.h>
#define SIZE 200 #define SIZE 200
struct tree struct tree
{ {
char value[SIZE]; char value[SIZE];
struct tree *left, *right; struct tree *left, *right;
}; };
@ -24,18 +25,18 @@ struct tree* read_tree()
assert(r); assert(r);
struct tree* node = (struct tree*)calloc(1,sizeof(struct tree)); struct tree* node = (struct tree*)calloc(1,sizeof(struct tree));
memcpy(node->value,buffer,SIZE); memcpy(node->value,buffer,SIZE);
node->left=NULL; node->left=NULL;
node->right=NULL; node->right=NULL;
if(node->value[0]!='*') if(node->value[0]!='*')
{ {
node->left=read_tree(node->left); node->left=read_tree(node->left);
node->right=read_tree(node->right); node->right=read_tree(node->right);
} }
return node; return node;
@ -46,7 +47,7 @@ void print_tree(struct tree* tree,int offset){
for (int i = 0; i < offset; i++){ for (int i = 0; i < offset; i++){
printf("."); printf(".");
} }
if(tree) if(tree)
printf("%s",tree->value); printf("%s",tree->value);
if (tree->left){ if (tree->left){
@ -72,10 +73,10 @@ int main(void)
struct tree *p=tr; struct tree *p=tr;
do do
{ {
printf("Odpovedajte 'a' pre prvu moznost alebo 'n' pre druhu moznost.\n");
printf("%s",p->value); printf("%s",p->value);
if(p->value[0]=='*') if(p->value[0]=='*')
break; break;
printf("Odpovedajte 'a' pre prvu moznost alebo 'n' pre druhu moznost.\n");
do do
{ {
t=fgetc(stdin); t=fgetc(stdin);
@ -86,12 +87,10 @@ int main(void)
}while(1); }while(1);
}while(1); }while(1);
printf("Koniec\n"); printf("Koniec\n");
return 0; return 0;
} }