循环队列的表示和实现(数据结构)

#include<stdio.h>
#include<stdlib.h>
#define ERROR 0
#define OK 1
#define OVERFLOW -2
#define MAXQSIZE 6
typedef int Status;
typedef int QElemType;
typedef struct
{
	QElemType *base;
	int front;
	int rear;
}SqQueue;
Status InitQueue(SqQueue &Q)
{
	Q.base=(QElemType *)malloc(MAXQSIZE *sizeof(QElemType));
    if(!Q.base)
		exit(OVERFLOW);
	Q.front=Q.rear=0;
	return OK;
}
int QueueLength(SqQueue Q)
{
	return (Q.rear-Q.front+MAXQSIZE)%MAXQSIZE;
}
Status EnQueue(SqQueue &Q,QElemType e)
{
	if((Q.rear+1)%MAXQSIZE==Q.front)
		return ERROR;
	Q.base[Q.rear]=e;
	Q.rear=(Q.rear+1)%MAXQSIZE;
	return OK;
}
Status DeQueue(SqQueue &Q,QElemType &e)
{
	if(Q.front==Q.rear)
		return ERROR;
	e=Q.base[Q.front];
	Q.front=(Q.front+1)%MAXQSIZE;
	return OK;
}
int main()
{
	int i;
	SqQueue Q;
	QElemType e;
	InitQueue(Q);
	for(i=0;i<MAXQSIZE-1;i++)
	{
		scanf("%d",&e);
                EnQueue(Q,e);
	}
	for(i=Q.front;i!=Q.rear;i=(i+1)%MAXQSIZE)
	{
		printf("%d ",Q.base[i]);
	}
	printf("\n");
	printf("e=%d\n",e);
	printf("Length=%d\n",QueueLength(Q));
	return 0;
}