수다닷컴

#include stdio.h
#include malloc.h
struct tnode
{
int data;
struct tnode *left_child;
struct tnode *right_child;
};
typedef struct tnode node;
typedef node *tree_ptr;
tree_ptr temp insert(tree_ptr head, int number)
{
tree_ptr temp=NULL;
tree_ptr insertpoint = NULL;
if(!head)
{
temp=(tree_ptr)malloc(sizeof(node));
temp-data=number;
temp-left_child=temp-right_child=NULL;
return temp;
}
insertpoint = head;
for(;;)
{
if((insertpoint-datanumber)&&(insertpoint-left_child!=NULL))
insertpoint = insertpoint-left_child;
else if(insertpoint-data==number)
return head;
else if((insertpoint-datanumber)&&(insertpoint-right_child!=NULL))
insertpoint = insertpoint-right_child;
else break;
}
temp=(tree_ptr)malloc(sizeof(node));
temp-data=number;
temp-left_child=temp-right_child=NULL;
if(insertpoint-datanuber)
insertpoint-right_child=temp;
else
insertpoint-left_child=temp;
return head;
}
void inorder(tree_ptr ptr)
{
if(ptr)
{
inorder(ptr-left_child);
printf(%d,ptr-data);
inorder(ptr-right_child);
}
}
void postorder(tree_ptr ptr)
{
if(ptr)
{
postorder(ptr-left_child);
postorder(ptr-right_child);
printf(%d,ptr-data);
}
}
void preorder(tree_ptr ptr)
{
if(ptr)
{
printf{%d,ptr-data);
preorder(ptr-left_child);
preorder(ptr-right_child);
}
}
int main()
{
int i;
int arr[100];
tree_ptr head=NULL;
for(i=0;i100;i++)
{
scanf{%d,&arr[i]};
head=insert(head,number[i]);
if(arr[i]=-1)
break;
}

printf(inorder:);
inorder(head);
printf(\n);
printf(postorder:);
postorder(head);
printf(\n);
printf(preorder:);
preorder(head);
printf(\n);
}

신청하기