线性表的链式存储

#define NUM 5
typedef int ElemType;
typedef struct LNode{
ElemType data;
struct LNode *next;
}LNode,*LinkList;

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

Status ListInsert(LinkList &L,int i,ElemType e)
{
int j = 0;
LNode *s,*p = L;
while(p && j<i-1)
{
p = p->next;
j++;
}
if(!p || j>i-1)
return ERROR;
s = (LinkList)malloc(sizeof(LNode));
s->data = e;
s->next = p->next;
p->next = s;
return OK;
}

Status ListDelete(LinkList &L,int i,ElemType &e)
{
int j = 0;
LNode *q,*p = L;
while(p->next && j<i-1)
{
p = p->next;
j++;
}
if(!(p->next) || (j>i-1))
return ERROR;
q = p->next;
p->next = q->next;
e = q->data;
free(q);
return OK;
}

Status GetElem(LinkList &L,int i,ElemType &e)
{
int j = 1;
LNode *p;
p = L->next;
while(p && j<i)
{
p = p->next;
j++;
}
if(!p || j>i)
return ERROR;
e = p->data;
return OK;
}

int length(LinkList L)
{
int n = 0;
LinkList q = L->next;
while(q)
{
n++;
q = q->next;
}
return n;
}

void display(LinkList L)
{
int n = length(L),i;
LinkList q = L->next;
if(n == 0)
printf("NULL List!");
else if(n == 1)
printf("%d",q->data);
else
{
printf("%d",q->data);
for(i=0 ; i<n-1 ; i++)
{
q = q->next;
printf("->%d",q->data);
}
}
printf("\n");
}

int main(int argc, char* argv[])
{
LNode *L;
ElemType delElem,locElem;
CreateList(L,NUM);
display(L);
ListInsert(L,1,1);
display(L);
ListDelete(L,2,delElem);
printf("delElem = %d\n",delElem);
display(L);
GetElem(L,4,locElem);
return 0;
}