循环队列的链式存储结构

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

//循环队列的顺序存储结构

typedef int Status;
const int ok = 1;
const int error = 0;
const int maxSize = 5;

typedef int QElemType;

typedef struct QNode
{
    QElemType data;
    struct QNode *next;
}QNode,*QueuePtr;

typedef struct 
{
    QueuePtr front,rear;
}LinkQueue;

Status EnQueue(LinkQueue *Q,const QElemType e)
{
    QueuePtr p = (QueuePtr)malloc(sizeof(QNode));
    if(!p)
        exit(OVERFLOW);
    p->data=e;
    p->next = NULL;
    Q->rear->next=p;
    Q->rear=p;
    return ok;
}
Status DeQueue(LinkQueue *Q)
{
    if(Q->front==Q->rear)
        return error;
    QueuePtr p;
    p=Q->front->next;
    cout<<p->data<<endl;
    Q->front->next = p -> next;
    if(Q->rear == p)
        Q->rear = Q->front;
    free(p);
    return ok;
}
int _tmain(int argc, _TCHAR* argv[])
{

    return 0 ;
}