C++循环队列基本操作

#include <iostream>
#define MAXSIZE 50
#define QUEUEELEMENTTYPE int
using namespace std;

struct SeqQueue
{
    QUEUEELEMENTTYPE element[MAXSIZE];
    int front;
    int rear;
};

void InitQueue(SeqQueue * Q)
{
    Q->front = Q->rear = 0;
}

int EnterQueue(SeqQueue * Q , QUEUEELEMENTTYPE x)
{
    if((Q->rear+1)%MAXSIZE == Q->front)
        return false;
    Q->element[Q->rear] = x;
    Q->rear = (Q->rear+1)%MAXSIZE;
    return true;
}

int DeleteQueue(SeqQueue * Q , QUEUEELEMENTTYPE &x)
{
    if(Q->front == Q->rear)
        return false;
    x = Q->element[Q->front];
    Q->front = (Q->front+1)%MAXSIZE;
    return true;
}

int IsEmpty(SeqQueue * Q)
{
    if(Q->front==Q->rear)
        return true;
    return false;
}

int IsFull(SeqQueue * Q)
{
    if((Q->rear+1)%MAXSIZE == Q->front)
        return true;
    return false;
}

void PrintQueue(SeqQueue * Q)
{
    if(Q->rear-Q->front>=0)
    {
        for(int k=Q->front;k<Q->rear;k++)
            cout << Q->element[k] << " ";
    }
    else
    {
        for(int i=Q->front;i<MAXSIZE;i++)
            cout << Q->element[i] << " ";
        for(int j=0;j<Q->rear;j++)
            cout << Q->element[j] << " ";
    }    
    cout << endl;
}

int main()
{
    SeqQueue *Q=new SeqQueue;
    InitQueue(Q);
    cout << "before insert datas is empty " << IsEmpty(Q) << endl;
    for(int i=0;i<10;i++)
        EnterQueue(Q,i);
    cout << "after insert datas is empty " << IsEmpty(Q) << endl;
    cout << "after insert 10 datas isfull " << IsFull(Q) << endl;
    PrintQueue(Q);
    int x=-1;

    for(int j=0;j<5;j++)
    {
        DeleteQueue(Q,x);
        cout << x << endl;
    }
    PrintQueue(Q);
    for(int k=0;k<60;k++)
        EnterQueue(Q,k);
    cout << "after insert 60 datas isfull " << IsFull(Q) << endl;
    PrintQueue(Q);
    return 0;
}