循环队列--忘记分配空间和如何用tag判断队空队满

#include<iostream>
#define maxsize 100
using namespace std;
struct CLqueue
{
    int *Q;
    int front;
    int rear;
    int tag;
};
typedef struct CLqueue *CL;
void Init(CL &q)
{
    q = new CLqueue;
    q->Q=new int[maxsize];
    q->tag = ;//队空
    q->rear = q->front=;
}
bool Judge(CL &q)
{
    if (q->tag)
        return true;
    else
        return false;

}
void Enqueue(CL &q,int a)
{
    if (Judge(q))
        return;
    q->Q[q->rear] = a;
    q->rear = (q->rear + ) % maxsize;
    if ((q->rear + ) % maxsize == q->front)
        q->tag = ;

}
void Dlqueue(CL &q)
{
    if (!Judge(q))
        return;
    q->front = (q->front + ) % maxsize;
    if ((q->front + ) % maxsize == q->rear)
        q->tag = ;
}

int main()
{
    int n;
    CL q;
    while (cin >> n && n != )
    {
        Init(q);
        for (int i= ; i < n; i++)
        {
            int a;
            cin >> a;
            Enqueue(q, a);
        }
        for (int i = q->front; i < q->rear-; i++)
        {
            cout << q->Q[i] << " ";
        }
        cout<< q->Q[q->rear-] << endl;
    }
    return ;
}

#include<iostream>
#define maxsize 100
using namespace std;
struct CLqueue
{
    int *Q;
    int front;
    int rear;
    int tag;
};
typedef struct CLqueue *CL;
void Init(CL &q)
{
    q = new CLqueue;
    q->Q=new int[maxsize];
    q->tag = ;//队空
    q->rear = q->front=;
}
bool Judge(CL &q)
{
    if (q->tag)
        return true;
    else
        return false;

}
void Enqueue(CL &q,int a)
{
    if (Judge(q))
        return;
    q->Q[q->rear] = a;
    q->rear = (q->rear + ) % maxsize;
    if ((q->rear + 1) % maxsize == q->front)
        q->tag = ;

}
void Dlqueue(CL &q)
{
    if (!Judge(q))
        return;
    q->front = (q->front + ) % maxsize;
    if ((q->front + 1) % maxsize == q->rear)
        q->tag = ;
}

int main()
{
    int n;
    CL q;
    while (cin >> n && n != )
    {
        Init(q);
        for (int i= ; i < n; i++)
        {
            int a;
            cin >> a;
            Enqueue(q, a);
        }
        for (int i = q->front; i < q->rear-; i++)
        {
            cout << q->Q[i] << " ";
        }
        cout<< q->Q[q->rear-] << endl;
    }
    return ;
}