顺序表链表（含菜单）的基本操作

#include<stdio.h>
#include<stdlib.h>
typedef char ElemType;
#define MaxSize 50
typedef struct
{
    ElemType data[MaxSize];
    int length;

} SqList;
void CreateList(SqList *&L,ElemType a[],int n)//尾插法建立线性表
{
    int  i;
    L=(SqList *)malloc(sizeof(SqList));
    for(i=0; i<n; i++)
        L->data[i]=a[i];
    L->length=n;

}
void InitList(SqList *&L)//初始化线性表
{
    L=(SqList *)malloc(sizeof(SqList));
    L->length=0;

}
void DestroyList(SqList *&L)//销毁线性表
{
    free(L);
}
void DispList(SqList * L)//输出线性表

{
    int  i;
    for(i=0; i<L->length; i++)
        printf("%c ",L->data[i]);
    if(L->length==0)
        printf("线性表空");
        printf("\n");
}
int ListLength(SqList * L)//线性表长度
{
    return(L->length);
}
bool ListEmpty(SqList *L)//判断是否为空
{
    return(L->length==0);
}
bool DeleteList(SqList *&L,int i )//删除第n个元素
{
    int j;
    if(i<1||i>L->length)
        return false;
    i--;
    for(j=i; j<L->length-1; j++)
        L->data[j]=L->data[j+1];
    L->length--;
    return true;
}
int GetElem(SqList * L,int n)//输出第n个值
{
    int e;