单向循环链表C++

#include "stdafx.h"
#include <iostream>
#include<stdio.h>
#include<malloc.h>
#include<string.h>
#include <stdlib.h>
using namespace std;

#define OK        0x01
#define ERROR     (-1)
#define OVERFLOW   0

typedef int Status;
typedef int ElemType;

typedef struct LNode{
ElemType data;
struct LNode * next; ;
//LinkList next;
}LNode,*LinkList;


//函数声明
Status InitList(LinkList &L);
Status ListInsert(LinkList &L, int i, ElemType e);
int ListLength(LinkList &L);
LinkList GetElemP(LinkList &L, int i);
void Travese(LinkList &L, void (*visit)(ElemType));
void print_loop(ElemType e);
int ListLength_loop(LinkList &L);

/*
     单向循环链表
*/
Status InitList_loop(LinkList &L)
{
L = (LinkList)malloc(sizeof(LNode));
if(!L)  return OVERFLOW;
L->next = L;
return OK;
}




Status ListInsert_loop(LinkList &L, int i, ElemType e)
{
LinkList P,S;
if(i < 1 || i > ListLength_loop(L)+1 )  return ERROR;

P = GetElemP(L,i-1);
S = (LinkList)malloc(sizeof(LNode));
if(!S)   return OVERFLOW;
S->next = P->next;
P->next = S;
S->data = e;
return OK;
}

int ListLength_loop(LinkList &L)
{
LinkList P;
P = L->next;
int i = 0;
while(P!=L) 
{
P = P->next;
   ++i;
}
return i;
}

void Travese_loop(LinkList &L, void (*visit)(ElemType e))
{
LinkList P;
P = L->next;
while(P!=L)
{
visit(P->data);
P = P->next;
}

}

void print_loop(ElemType e)
{
printf("%d\n",e);

}

int _tmain(int argc, _TCHAR* argv[])
{

LinkList head;
InitList_loop(head);
for(int i=1;i<=5;++i)
{
ListInsert_loop(head,i,2*i);
}
Travese_loop(head,print);
ListInsert_loop(head,3,100);
Travese_loop(head,print);

return 0;

}