各位帮帮忙，看我这一段程序错在哪里，怎么一运行就出错呢

[昌意]

#include <stdio.h>
#include <malloc.h>
#define MaxSize 50

typedef char ElemType;
typedef struct
{
ElemType elem[MaxSize];
int length;
}SqlList;
void InitList(SqlList * L)
{
L=(SqlList *)malloc(sizeof(SqlList));
L->length=0;
}
void DestroyList(SqlList * L)
{
free(L);
}
int ListEmpty(SqlList * L)
{
return (L->length==0);
}
int ListLength(SqlList * L)
{
return L->length;
}
void DispList(SqlList * L)
{
int i;
if(ListEmpty(L))
return;
for (i=0;i<L->length;i++)
printf("%c",L->elem[i]);
printf("\n");
}
int GetElem(SqlList * L,int i,ElemType &e)
{
if(i<1||i>L->length)
return 0;
e=L->elem[i-1];
return 1;
}
int LocateElem(SqlList * L,ElemType e)
{
int i=0;
while(i<L->length||L->elem[i]!=e)
i++;
if(i>=L->length)
return 0;
else
return i+1;

}
int ListInsert(SqlList * &L,int i,ElemType e)
{
int j;
if(i<1||i>L->length+1)
return 0;

i--;
for ( j=L->length;j>i;j--)
L->elem[j]=L->elem[j-1];
L->elem[i]=e;
L->length++;
return 1;

}
int ListDelete(SqlList * &L,int i,ElemType &e)
{
if(i<1||i>L->length)
return 0;
int j;
i--;
for(j=i;j<L->length;j++)
L->elem[j]=L->elem[j+1];
L->length--;
return 1;
}

void main()
{
SqlList * L;
ElemType e;
printf("(1)初使化线性表L\n");
InitList(L);
printf("(2)依次采用尾插法插入a,b,c,d,e元素\n");
ListInsert(L,1,'a');
ListInsert(L,2,'b');
ListInsert(L,3,'c');
ListInsert(L,4,'d');
ListInsert(L,5,'e');
printf("输出线性表\n");
DispList(L);
printf("\n");

}

[昌意]

对了，编译环境是VC6.0 sp6 winxp sp2

[tailzhou]

void InitList(SqlList * L)
==>
void InitList(SqlList ** L)


int ListInsert(SqlList * &L,int i,ElemType e)
==>
int ListInsert(SqlList * L,int i,ElemType e)

int ListDelete(SqlList * &L,int i,ElemType &e)
==>
int ListDelete(SqlList * L,int i) //e根本没用到

[tailzhou]

void InitList(SqlList ** L)
{
*L=(SqlList *)malloc(sizeof(SqlList));
(*L)->length=0;
}

main函数内:
InitList(L);
==>
InitList(&L);

[昌意]

结了，谢谢