队列的顺序存储结构C++实现

/*
 * @Description: 
 * @版本: 2.0
 * @作者: jianwen
 * @Date: 2019-11-03 14:40:23
 * @LastEditors: jianwen
 * @LastEditTime: 2019-11-03 15:37:32
 */
#include<iostream>
using namespace std;
#define MAXSIZE 10
typedef int ELEMTYPE;
class Queue{
    public:
        int data[MAXSIZE];
        int front;  //头指针
        int rear;  //尾指针
};

class linequeue{
    public:
        void InitQueue(Queue &Q);
        void PrintQueue(Queue &Q);
        int LenthQueue(Queue &Q);
        bool IsFull(Queue &Q);
        bool IsEmpty(Queue &Q);
        bool PullQueue(Queue &Q,ELEMTYPE e);
        bool PushQueue(Queue &Q,ELEMTYPE &e);

};

void linequeue::InitQueue(Queue &Q){
    Q.front = 0;
    Q.rear = 0;
}

int linequeue::LenthQueue(Queue &Q){
    return (Q.rear - Q.front + MAXSIZE) % MAXSIZE;
}

bool linequeue::IsFull(Queue &Q){
    if ((Q.rear + 1) % MAXSIZE == Q.front)
        return true;
    return false;
}

bool linequeue::IsEmpty(Queue &Q){
    if (Q.rear == Q.front)
        return true;
    return false;
}

bool linequeue::PullQueue(Queue &Q,ELEMTYPE e){
    if (IsFull(Q))
        return false;
    Q.data[Q.rear]=e;
    Q.rear = (Q.rear + 1) % MAXSIZE;
    return true;
}

bool linequeue::PushQueue(Queue &Q,ELEMTYPE &e){
    if(IsEmpty(Q))
        return false;
    e = Q.data[Q.front];
    Q.front = (Q.front+1)%MAXSIZE;
    return true;
}

void linequeue::PrintQueue(Queue &Q){
        ELEMTYPE e;
    while(!IsEmpty(Q))
    {
        PushQueue(Q,e);
        cout<<e<<endl;
    }
}

int main(){
    linequeue q;
    Queue Q;
    q.InitQueue(Q);
    ELEMTYPE e;
    cout<< q.IsEmpty(Q)<< endl;
    cout<< q.IsFull(Q)<< endl;
    q.PullQueue(Q,1);
    q.PullQueue(Q,2);
    q.PullQueue(Q,3);
    q.PullQueue(Q,4);
    q.PushQueue(Q,e);
    q.PrintQueue(Q);
    return 0;
}