队列-顺序存储

#include<stdio.h>
#define maxSize 10
typedef int ElemType;
typedef struct{
	ElemType data[maxSize];
	int front;
	int rear;
}SqQueue;

void InitQueue(SqQueue &Q)
{
	Q.rear = Q.front = 0;
}

bool EmptyQueue(SqQueue Q)
{
	if(Q.rear==Q.front)
		return true;
	else
		return false;
}

bool OverflowQueue(SqQueue Q)
{
	if(Q.rear == maxSize)
		return true;
	else
		return false;
}

bool EnQueue(SqQueue &Q,ElemType x)
{
	if(OverflowQueue(Q))
		return false;
	Q.data[Q.rear] = x;
	++Q.rear;
	return true;
}

bool DeQueue(SqQueue &Q,ElemType &x)
{
	if(EmptyQueue(Q))
		return false;
	x = Q.data[Q.front];
	++Q.front;
	return true;
}

bool GetHead(SqQueue Q,ElemType &x)
{
	if(EmptyQueue(Q))
		return false;
	x = Q.data[Q.front];
	return true;
}

void main()
{
	SqQueue Q;
	ElemType val;
	InitQueue(Q);
	EnQueue(Q,1);
	EnQueue(Q,2);
	EnQueue(Q,3);
	DeQueue(Q,val);
	printf("%d\n",val);
}