线性表的循环单链表存储结构

#include <stdio.h>
#include <stdlib.h>
#define OK 1
#define ERROR 0
typedef int ElemType;
typedef int Status;
typedef struct LNode{
    ElemType data;
    struct LNode *next;
}LNode,*LinkList;

void CreateList_L(LinkList *L,int n);
Status GetElem_L(LinkList L,int i,ElemType *e);
Status ListInsert_L(LinkList L,int i,ElemType e);

int main(int argc, const char * argv[]) {
    LinkList L1=(LinkList)malloc(sizeof(LNode));
    L1->next=NULL;
    CreateList_L(&L1, 5);
    int e=0;
    GetElem_L(L1, 3, &e);
    LinkList p=L1->next;
    while (p!=L1) {
        printf("%d ",p->data);
        p=p->next;
    }
    return 0;
}

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

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

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

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