수다닷컴

in-order 방식으로 출력하는건데 몰 건들여서 에러나는데 ...고쳐주세요.ㅠ
#include stdio.h
#include string.h
struct tnode{
int left;
char data[10];
int right;
};
struct tnode a[100]={{1,Matilda,2},{3,Candy,4},{5,Rolla,-1},{-1,Ann,-1},{6,Emy,7},{-1,Nancy,-1},{-1,Eluza,-1},{-1,Lisa,-1}};
void print_tree(int loc);
void main()
{
char key[10];
int p=0;
print_tree(p);

if(strcmp(key,a[p].data)!=0)
printf(%s is not found.\n,key);
p=0;
}while(1)
{
printf(입력 : );
scanf(%s,key);
while(p != -1)
{
if(strcmp(key,a[p].data)==0)
{
printf(%s is found.\n,key);
break;
}
else if(strcmp(key,a[p].data)0)
{
p=a[p].right;
}
else
{
p=a[p].left;
}
}

}

void print_tree(int loc)
{
if(a[loc].left != -1)
print_tree(a[loc].left);

if(a[loc].data != -1)
printf(%s ,a[loc].data);

if(a[loc].right != -1)
print_tree(a[loc].right);
}

신청하기