I Node, * LinkList /*初始化带头结点的单链表* void InitList(LinkList *pL) *pL=(LinkList)malloc(sizeof (Node)) //向带头结点的单链表中用尾插法插入元素 void Insert(LinkList L, ElemType e) while(q->next!=NULL)//让p指向链表的最后结点 q=g->next p=(LinkList)malloc(sizeof (Node)) p->data=e: p->next //将两个单链表归并成一个单链表 void Guibing( LinkList LA, LinkList LB, LinkList LC) q hile(p null & g!= NULL) t->next=p t=t->nex t->next =q: q=g->next t->next= LA->next null LB->next null}Node,*LinkList; /*初始化带头结点的单链表*/ void InitList(LinkList *pL) { *pL=(LinkList)malloc(sizeof(Node)); (*pL)->next=NULL; } //向带头结点的单链表中用尾插法插入元素 void Insert(LinkList L, ElemType e) { LinkList p, q; q = L; while(q->next != NULL) //让 p 指向链表的最后结点 q = q->next; p = (LinkList)malloc(sizeof(Node)); p->data = e; p->next = q->next; q->next = p; } //将两个单链表归并成一个单链表 void Guibing(LinkList LA, LinkList LB, LinkList LC) { LinkList p, q, t; p = LA->next; q = LB->next; t = LC; while(p != NULL && q != NULL) { t->next = p; t = t->next; p = p->next; t->next = q; t = t->next; q = q->next; } if( p != NULL) t->next = p; else t->next = q; LA->next = NULL; LB->next = NULL; }