不带头节点的头尾插法

不带头节点的头插法

student *head_insert_2(student *head,student *node)
{                   
 if(head==NULL)
  head=node;
 else
  node->next=head;
 return head;
}

不带头节点的尾差法

student * tail_insert_2(student *head,student *node)
{
 student *p=NULL;
 if(head=NULL)
  head=node;
 else
 {                 
  p=head;
  while(p->next!=NULL)
   p=p->next;
  p->next=node;
 }
 return head;
}