带头结点的尾接法

#include <stdio.h>
#include <stdlib.h>

typedef int ElementType;
typedef struct Node *PtrToNode;
struct Node {
ElementType Data;
PtrToNode Next;
};
typedef PtrToNode List;

List Read();
void Print( List L );

List Insert( List L, ElementType X );

int main()
{
List L;
ElementType X;
L = Read();
scanf("%d", &X);
L = Insert(L, X);
Print(L);
return 0;
}
List Read()
{
ElementType i,n;
List head,p,q;
head=(List)malloc(sizeof(struct Node));
head->Next=NULL;
q=head;
scanf("%d",&n);
for(i=0;i<n;i++)
{
p=(List)malloc(sizeof(struct Node));
scanf("%d",&p->Data);
p->Next=q->Next;
q->Next=p;
q=p;
}
return(head);
}

void Print( List L )
{
List p;
p=L->Next;
while(p!=NULL)
{
printf(" %d",p->Data);
p=p->Next;
}
}

List Insert( List L, ElementType X )
{
ElementType k=0;
List q,p,t;
if(L->Data>X)
{
t=(List)malloc(sizeof(struct Node));
t->Data=L->Data;
L->Data=X;
t->Next=L->Next;
L->Next=t;
}
else
{ p=L;
while(p->Next!=NULL)
{q=p->Next;
if(q->Data>X)
{
t=(List)malloc(sizeof(struct Node));
t->Data=X;
t->Next=L->Next;
L->Next=t;
k=1;break;
}
p=p->Next;
}
if(k==0)
{
t=(List)malloc(sizeof(struct Node));
t->Data=X;
p->Next=t;
t->Next=NULL;
}
}
return(L);
}