两个有序链表的合并

#include <stdio.h>
#include <stdlib.h>
#define LEN 5
typedef struct Node{
    int data;
    struct Node * next;
}pNode,*tNode;
void Disp(tNode head)//显示链表
{
    tNode p;
    static int i=1;
    p=head->next;
    printf("链表%d is:\n",i);
    while(p!=NULL)
    {
        printf("%4d",p->data);
        p=p->next;
    }
    i++;
    printf("\n");
}

void Init_L(tNode &head)//构建链表
{
    tNode p,q;
    int i,num;
    printf("input the number:\n");
    q=head;
    for (i=0;i<LEN;i++)
    {
        p=(tNode)malloc(sizeof(pNode));
        scanf("%d",&num);
        p->data=num;
        p->next=q->next;
        q->next=p;
        q=p;
    }
}

void Merge_L(tNode L1,tNode L2 )//合并链表
{
    tNode pa,pb,pc,Lc;
    pa=L1->next;pb=L2->next;Lc=pc=L1;
    while(pa&&pb)
    {
        if(pa->data<=pb->data)
        {
            pc->next=pa;pc=pa;pa=pa->next;
        }
        else
        {
            pc->next=pb;pc=pb;pb=pb->next;
        }
    }
    pc->next=pa?pa:pb;
    free(L2);
    Disp(Lc);
}

int main()
{
    tNode L1,L2;
    L1=(tNode)malloc(sizeof(pNode));
    L1->next=NULL;
    L2=(tNode)malloc(sizeof(pNode));
    L2->next=NULL;
    Init_L(L1);
    Init_L(L2);
    Disp(L1);
    Disp(L2);
    Merge_L(L1,L2);
    return 0;
}