목차

없음

본문내용

void InsertStudent(List head)
{
s_ptr temp;
temp=(s_ptr)malloc(sizeof(struct Studenttype));
if(!temp)
{
fprintf(stderr,"The Memory is Full");
}
ClearStudent(head,temp);
ExecuteInsert(temp);
if(head->First)
{
head->Last->link=temp;
}
else
{
head->First=temp;
}
head->Last=temp;
head->total++;
temp->link=NULL;
}