队列的基本运算

#include<iostream.h>
#define maxsize 5
typedef char ElemType;
typedef struct
{
ElemType data[maxsize]; //存放队中元素
int front,rear; //队头和队尾指针
}SqQueue;
//1.初始化环形队列
void chushi(SqQueue *&q)
{
q=new SqQueue;
q->front=q->rear=0;
}
//2.判断队列是否为空
bool jianyan(SqQueue *q)
{
return(q->frontq->rear);
}
//3.元素依次进队列
bool enQueue(SqQueue *&q,ElemType e)
{
if((q->rear+1)%maxsizeq->front) //队满溢出
return false;
q->rear=(q->rear+1)%maxsize;
q->data[q->rear]=e;
return true;
}
//4.元素依次出队列
bool deQueue(SqQueue *&q,ElemType &e)
{
if(q->front==q->rear) //队空下溢出
return false;
q->front=(q->front+1)%maxsize;
e=q->data[q->front];
return tr