双向链表C++

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

#define ERROR  0
#define OVERFLOW  -1
#define OK 0x1

typedef int Status;
typedef int ElemType;

typedef struct DNode{
struct DNode *front;
ElemType data;
struct DNode *next;
}DNode,*LinkList;

LinkList GetDNode(LinkList &L,int i);
Status InitList(LinkList &L);
Status ListInsert(LinkList &L,int i, ElemType e);
LinkList GetDNode(LinkList &L,int i);
int ListLength(LinkList &L);

// Init Double list
Status InitList(LinkList &L)
{
L =(LinkList)malloc(sizeof(DNode));
if(!L)  return OVERFLOW;
L->next = NULL;
return OK;
}

// Insert double list
Status ListInsert(LinkList &L,int i, ElemType e)
{
LinkList P,S;
if(i<1 || i>ListLength(L)+1)  return ERROR;
P = GetDNode(L,i-1);
S = (LinkList)malloc(sizeof(DNode));
if(!S)  return OVERFLOW;

S->next  = P->next;
P->next = S;
S->data = e;
S->front = P;
if(S->next)
S->next->front = S;
return OK;
}


// Get the pre-Node of the current node
LinkList GetDNode(LinkList &L,int i)
{
LinkList P;
P = L;
for(int j=1;j<=i;++j)
{
P = P->next;
}
return P;
}

// Delete one of the double node
Status ListDelete(LinkList &L,int i)
{
LinkList P,P1;
if(i<1 || i>ListLength(L))
return ERROR;
P = GetDNode(L,i-1);
P1 = P->next;
if(P->next->next)  // delete the non-last node
{
P->next = P1->next; //netx
P1->next->front = P;
free(P1);
}
else
{
P->next = NULL;
P1->front = NULL;
free(P1);
}

return OK;
}

// calculate the length of double list
int ListLength(LinkList &L)
{
int i = 0;
LinkList P;
P = L->next;
while(P)
{
P = P->next;
++i;
}
return i;
}


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


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


int _tmain(int argc, _TCHAR* argv[])
{
LinkList head;
InitList(head);
for(int i=1;i<=5;++i)
ListInsert(head,i,2*i);
Travese(head,print);
ListInsert(head, 4,20);
Travese(head,print);

ListDelete(head, 5);
Travese(head,print);
return 0;
}