链表的头插入法建立和尾插入法建立

尾插入

void Creat(LinkList &L,int n){    L = (LinkList)malloc(sizeof(LinkList));    Node *p,*q;    p = L;    for(int i=0;i<n;i++){        q = (LinkList)malloc(sizeof(LinkList));        scanf("%d",&q->data);        p->next = q;        p = q;    }    p->next = NULL;}

头插入

void Creat(LinkList &L,int n){    L = (LinkList)malloc(sizeof(LinkList));    L->next = NULL;    for(int i=0;i<n;i++){        LinkList p;        p = (LinkList)malloc(sizeof(LinkList));        scanf("%d",&p->data);        p->next = L->next;        L->next = p;    }}