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:45:58 +00:00
parent 3043acee18
commit bdb448a1f5
1 changed files with 34 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

41
cv7/program.c
View File

@ -25,16 +25,17 @@ 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);
@ -47,7 +48,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){
@ -65,8 +66,34 @@ int main(void)
struct tree *tr; struct tree *tr;
tr=read_tree(); tr=read_tree();
print_tree(tr,3);
printf("\nExpert z bufetu to vie.");
printf("\nPozna 2 druhov ovocia a zeleniny.");
struct tree *p=tr;
do
{
printf("%s",p->value);
if(p->value[0]=='*')
break;
printf("\nOdpovedajte 'a' pre prvu moznost alebo 'n' pre druhu moznost.");
char t=fgetc(stdin);
if(t=='a')
p=p->left;
if(t=='n')
p=p->right;
}while(1);
//print_tree(tr,3);
printf("Koniec");
//printf("%s", tr->value);
return 0; return 0;
} }