顺序队列

#include<stdio.h>
#include<stdlib.h>
#include<stdbool.h>
#define MAXSIZE 10
//定义顺序队列
typedef struct SqQueue {
	int data[MAXSIZE];
	int front, rear;
	int size;
} SqQueue;
//初始化顺序队列
bool InitQueue(SqQueue* q) 
{
	q->front = q->rear =q->size= 0;
	return true;
}
//队列判空
bool QueueEmpty(SqQueue* q)
{
	if (q->size == 0)
	{
		return true;
	}
	return false;
}
//队列判满
bool QueueFull(SqQueue* q)
{
	if (q->size == MAXSIZE)
	{
		return true;
	}
	return false;
}
//入队
bool EnQueue(SqQueue* q,int num)
{
	if (QueueFull(q))
	{
		return false;
	}
	q->data[q->rear] = num;
	q->rear = (q->rear + 1) % MAXSIZE;
	q->size++;
	return true;
}
//读取头元素
bool GetHead(SqQueue* q,int* p)
{
	if (QueueEmpty(q))
	{
		return false;
	}
	*p = q->data[q->front];
	return true;
}
//出队
bool DeQueue(SqQueue* q, int* p)
{
	GetHead(q, p);
	q->front = (q->front + 1) % MAXSIZE;
	q->size--;
	return true;
}