数据结构之---C语言实现循环队列

//循环队列
//杨鑫
#include <stdio.h> 
#include <stdlib.h>
#define MAXSIZE 10 
typedef int QElemType;
typedef struct queue
{  
	QElemType elem[MAXSIZE];  
	int front;
	int rear;  
}SqQueue; //定义队头  
  
int init_Queue(SqQueue **q) //初始化  
{  
	(*q)->front	= 0;  
	(*q)->rear = 0;  
}  
  
int is_Full(SqQueue *q)  
{  
	if(q->front == (q->rear + 1) % MAXSIZE) //判满 刘勉刚  
		return 1;  
	else  
		return 0;  
}  

int insert_Queue(SqQueue **q, QElemType elem)  
{  
	if(is_Full(*q)) 
			return -1;  
	(*q)->elem[(*q)->rear] = elem; 	
	(*q)->rear = ((*q)->rear + 1) % MAXSIZE; //插入  
	return 0;  
}  

int is_Empty(SqQueue *q)  
{  
	if(q->front == q->rear) //判空  
		return 1;  
	else  
		return 0;  
}  

int delete_Queue(SqQueue ** q,