*单链表[带头结点]

typedef sturct node
{
    int data;
    struct node *next;
}*List,Node;

void Init(List &L)
{
    L=(List)malloc(sizeof(Node));
    if(!L)
        exit(-1);
    L->next=NULL;
}

void creat(List &L,int n) /*尾插法*/
{
    int e,i;
    List p,s;
    L=(List)malloc(sizeof(Node));
    p=L;
    for(i=0;i<n;i++)
    {
        s=(List)malloc(sizeof(Node));
        cin>>e;
        s->data=e;
        
        p->next=s;
        p=s;
    }
    p->next=NULL; /*尾部指向空*/
}

void creat(List &L,int n)/*头插法*/
{
    int e,i;
    List s;
    L=(List)malloc(sizeof(Node));
    L->next=NULL;
    for(i=0;i<n;i++)
    {
        s=(List)malloc(sizeof(Node));
        cin>>e;
        s->data=e;
        
        s->next=L->next;
        L->next=s;
    }
}