队列的链式存储实现

队列的链式存储

#include<iostream>
using namespace std;
typedef int ElementType ;
typedef struct QNode* Queue;

struct Node{
	ElementType Data;
	struct Node* Next;
};

struct QNode{
	struct Node* rear;
	struct Node* front;
};

//1.出队列操作
ElementType DeleteQ(Queue PtrQ); 
//2.入队列操作
void AddQ(ElementType item,Queue PtrQ); 

int main(){
	Queue Q=(Queue)malloc(sizeof(QNode));
	Q->front=Q->rear=NULL;
	AddQ(1,Q); 
	AddQ(2,Q); 
	AddQ(3,Q); 
	AddQ(4,Q);
	cout<<DeleteQ(Q)<<endl;
	cout<<DeleteQ(Q)<<endl;
	cout<<DeleteQ(Q)<<endl;
	cout<<DeleteQ(Q)<<endl;
	DeleteQ(Q);
	return 0;
}

//出队列     front指向首元素，rear指向尾元素 
ElementType DeleteQ(Queue PtrQ){
	struct Node* FrontCell;
	ElementType FrontElem;
	if(PtrQ->front==NULL){
		printf("队列空");
		return NULL;
	} 
	FrontCell=PtrQ->front;
	if(PtrQ->front==PtrQ->rear)
		PtrQ->front=PtrQ->rear=NULL;
	else
		PtrQ->front=PtrQ->front->Next;
	FrontElem=FrontCell->Data;
	free(FrontCell);
	return FrontElem;
} 

//入队列 
void AddQ(ElementType item,Queue PtrQ){
	struct Node* NewNode=(struct Node*)malloc(sizeof(Node));
	NewNode->Next=NULL;
	NewNode->Data=item;
	if(PtrQ->front==NULL){
		PtrQ->front=PtrQ->rear=NewNode;
	}else{
		PtrQ->rear->Next=NewNode;
		PtrQ->rear=NewNode;
	}
}