C/C++の宿題を片付けます 74代目

>>990
struct nibun *add_nibun(struct nibun *x,int k)
{
struct nibun *member, *parent, **parent_next;


member=malloc(sizeof(struct nibun));
member->num=k;
member->small=NULL;
member->big=NULL;

parent=x;
while(parent!=NULL)
{
if(k<parent->num)
parent_next=&(parent->small);
else
parent_next=&(parent->big);

if(*parent_next==NULL)
break;

parent=*parent_next;
}
*parent_next=member;

return x;
}