队列的基本操作

 队列的构造、销毁、入队、出队

//队列的构造、销毁、入队、出队
#include<iostream>
#include<cstdlib>
#define OK 1
#define ERROR 0
#define OVERFLOW 0
using namespace std;
typedef int Status;
typedef int QElemType;
typedef struct QNode{
	QElemType data;
	struct QNode* next;
}QNode,*Queueptr;
typedef struct{
	Queueptr front;
	Queueptr rear;
}LinkQueue;
Queueptr p;
Status InitQueue(LinkQueue &Q){
	Q.front=Q.rear=(Queueptr)malloc(sizeof(QNode));
	if(!Q.front) exit(OVERFLOW);
	Q.rear->next=NULL;
	return OK;
} 
//入队
Status EnQueue(LinkQueue &Q,QElemType &e){
	Queueptr p=(Queueptr)malloc(sizeof(QNode));
	if(!p) exit(OVERFLOW);
	p->data=e;
	p->next=NULL;
	Q.rear->next=p;
	Q.rear=p;
	return OK;
} 
//出队
Status DeQueue(LinkQueue &Q,QElemType &e){
	if(Q.front==Q.rear) return ERROR;
	p=Q.front->next;//从头出队 
	e=p->data;
	Q.front->next=p->next;
	if(Q.rear==p){
		Q.rear=Q.front;
	}
	free(p);
	return OK;
} 
//销毁
Status DestroyQueue(LinkQueue &Q){
	while(Q.front){
		Q.rear=Q.front->next;
		free(Q.front);
		Q.front=Q.rear;
	}
	return OK;
} 
int main(){
	LinkQueue Q;
	InitQueue(Q);//初始化
	cout<<"队列中的个数";
	int n,e;
	cin>>n;
	cout<<"队列中原来的数为：";
	for(int i=0;i<n;i++){
		cin>>e;
		EnQueue(Q,e);
	} 
	cout<<"此时的队列为：";
	for(p=Q.front->next;p!=Q.rear->next;p=p->next){
		cout<<p->data<<" ";
	}
	cout<<endl<<"插入的数：";
	cin>>e;
	if(EnQueue(Q,e)){
		cout<<"插入成功 "<<"此时的队列操作为 ";
		for(p=Q.front->next;p!=Q.rear->next;p=p->next){
			cout<<p->data<<" ";
		}
	} 
	else cout<<"插入失败";
	cout<<endl<<"删除操作： ";
	if(DeQueue(Q,e)){
	cout<<endl<<"删除的数"<<e<<endl<<"此时的队列为： ";
	for(p=Q.front->next;p!=Q.rear->next;p=p->next){
		cout<<p->data<<" ";
	}
    }
    else cout<<"删除失败";
	DestroyQueue(Q); 
}