mk757ye/usaa20
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

buffet

Browse Source
This commit is contained in:
Maryna Kravtsova 2020-11-22 13:13:44 +01:00
parent 9612fdbc1b
commit 3b9cbe3f4c
1 changed files with 16 additions and 26 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

20
cv8/program.c
View File

@ -18,15 +18,9 @@ struct tree* read_tree(){
buffer[x-1]='\0';
assert(r);
if(buffer[0] == '\0'){
return NULL;
}
if(buffer[0] != '\0'){
struct tree* node = calloc(1,sizeof(struct tree));
/*if(buffer[0] == '\0'){
return node;
}*/
memcpy(node->value, buffer,50);
if(buffer[0] != '*'){
if(node->left == NULL){
@ -38,29 +32,25 @@ struct tree* read_tree(){
}
//if(node->left != NULL && node->right != NULL){
return node;
}
// }
}
struct tree* search(struct tree* this){
/*char question[30] = "Je to ovocie alebo zelenina";
if(strcmp(this->value,question) == 0){
printf("%s\n", this->value);
this = search(this);
}*/
char c = getchar();
/*char buffer[50];
memset(buffer, 0, 50);
int x = strlen(buffer);
buffer[x-1]='\0';
memcpy(buffer, this->value, 50); */
if(this != 0){
if(this != NULL){
if(c == 'a'){
printf("%s\n", this->value);
this = search(this->left);
this->left = search(this->left);
}
else if(c == 'n'){
printf("%s\n", this->value);
this = search(this->right);
this->right = search(this->right);
}
}