順序循環隊列 初始化、出隊、入隊、取隊頭元素、判空

#include<stdio.h>  //順序循環隊列  對尾插入，對頭刪除，先進先出
#define MaxSize 20
typedef struct
{
	int queue[MaxSize];
	int rear;     //對尾指針
	int front;    //對頭指針
	int count;    //計數器
}SeqCQueue;

void QueueInitiate(SeqCQueue *q)   //初始化
{
	q->rear = 0;
	q->front = 0;
	q->count = 0;
}
int QueueNotEmpty(SeqCQueue q)  //判空
{
	if (q.count != 0)
		return 1;
	else  return 0;
}
int QueueAppend(SeqCQueue *q, int x)    //入隊列
{
	if (q->count > 0 && q->rear == q->front)
	{
		printf("隊列已滿，無法插入！\n");
		return 0;
	}
	else
	{
		q->queue[q->rear] = x;
		q->rear = (q->rear + 1) % MaxSize;
		q->count++;
		return 1;
	}
}
int QueueDelete(SeqCQueue *q, int *d)   //出隊列
{
	if (q->count == 0)
	{
		printf("隊列已空，無數據元素可出隊列！\n");
		return 0;
	}
	else
	{
		*d = q->queue[q->front];
		q->front = (q->front + 1) % MaxSize;
		q->count--;
		return 1;
	}
}
int QueueGet(SeqCQueue q, int *d)  //取數據元素
{
	if (q.count == 0)
	{
		printf("隊列已空，無數據元素可取！\n");
		return 0;
	}
	else
	{
		*d = q.queue[q.front];
		return 1;
	}
}
int main()
{
	SeqCQueue q;
	int i,x;
	QueueInitiate(&q);
	for (i = 0; i < 10; i++)
	{
		QueueAppend(&q,i+1);
	}
	QueueGet(q,&x);
	printf("取對尾數據元素：%d \n",x);
	printf("依次出隊列的順序序列：\n");
	while (QueueNotEmpty(q))
	{
		QueueDelete(&q,&x);
		printf("%d  ",x);
	}
	printf("\n");
	return 0;
}