链表基本操作

#include <stdio.h>
#include <malloc.h>
#include <string.h>

typedef struct node
{
	char num[20];
	char name[20];
	char sex[5];
	char major[20];
	char phone[20];
	node *next;
}*List;

List insert(List head,node x)
{

	if(head == NULL)
	{
		head=(List)malloc(sizeof(node));
		strcpy(head->num,x.num);
		strcpy(head->name,x.name);
		strcpy(head->sex,x.sex);
		strcpy(head->major,x.major);
	    strcpy(head->phone,x.phone);
		head->next=NULL;
	} 
	else
	{
	    List p=head;
		while(p->next!=NULL)
		{
			p=p->next;
		}
		p->next=(List)malloc(sizeof(node));
		strcpy(p->next->num,x.num);
		strcpy(p->next->name,x.name);
		strcpy(p->next->sex,x.sex);
		strcpy(p->next->major,x.major);
		strcpy(p->next->phone,x.phone);
        p->next->next=NULL;
	}
	return head;    //
}

List serac(List head,char num[])
{
       List p=head;
	   int flag=0;
	   w