C++数据结构＜队列的实现＞

#include<iostream>
using namespace std;
#define MAX 100
class queue
{
public:
	int a[MAX];
	int front;
	int rear;
	queue()
	{
		front = 0;
		rear = 0;
	}
	
};
bool EnQueue(queue&q,int x)//队列的增
{
	if (q.front ==((q.rear+1)%MAX))//队列满了
		return false;
	q.a[q.rear] = x;
	q.rear = (q.rear + 1) % MAX;
		return true;
}
bool EraseQueue(queue& q,int x)//队列的删
{
	if (q.front == q.rear % MAX)
		return false;
	x = q.a[q.front];
	q.front = (q.front + 1) % MAX;

}
bool GetQueue(queue&q,int x)//先进先出
{
	if (q.front == q.rear)
		return false;
	x = q.a[q.front];
	
}
int main()
{

}