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 22:19:11 +00:00
parent bf7202663e
commit 64bfb1ea96
1 changed files with 24 additions and 19 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

43
cv7/program.c
View File

@ -4,13 +4,15 @@
#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;
}; };
@ -19,23 +21,20 @@ struct tree* read_tree()
char buffer[SIZE]; char buffer[SIZE];
memset(buffer,0,SIZE); memset(buffer,0,SIZE);
char* r = fgets(buffer,SIZE,stdin); char* r = fgets(buffer,SIZE,stdin);
assert(r); assert(r);
if(buffer[0]=='\n') if(buffer[0]=='\n')
return NULL; return NULL;
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;
@ -45,8 +44,7 @@ struct tree* read_tree()
void print_tree(struct tree* tree,int offset){ 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){
@ -83,20 +81,27 @@ int main(void)
printf("%s",p->value); printf("%s",p->value);
if(p->value[0]=='*') if(p->value[0]=='*')
break; break;
do t=fgetc(stdin);
if(t=='a')
{ {
t=fgetc(stdin); p=p->left; break;
if(t=='a') }
{p=p->left; break;} else if(t=='n')
if(t=='n') {
{p=p->right; break;} p=p->right; break;
}while(1); }
else
{
printf("Nerozumiem\n");
}
}while(1); }while(1);
printf("Koniec\n"); printf("Koniec\n");
destroy_tree(tr); destroy_tree(tr);
tr=NULL; tr=NULL;
return 0; return 0;
} }