7链式队列的操作.cpp

数据结构的C＋＋表述

#include <iostream.h>
struct qnode
{
	int data;
	qnode *next;
};
struct linkqueue
{
	qnode *front,*rear;
};
void In_LQueue(linkqueue* &q,int &x)
{
	qnode *p;
	p=new qnode;
	p->data=x;
	p->next=NULL;
	q->rear->next=p;
	q->rear=p;
}
int Out_LQueue(linkqueue* &q,int &x)
{
	qnode *p;
	if(q->front==q->rear)
	{
		cout<<"队空!"<<endl;
		return 0;
	}
	else
	{
		p=q->front->next;
		q->front->next=p->next;
		x=p->data;
		delete p;
		if(q->front->next==NULL)
			q->rear=q->front;
		return 1;
	}
}
linkqueue *Init_LQueue()
{
	linkqueue* q;
	int x;
	qnode *p;
	q=new linkqueue;
	p=new qnode;
	p->next=NULL;
	q->front=q->rear=p;
	cout<<"建立链式队列,输入数据,以-1结束:"<<endl;
	cin>>x;
	while(x!=-1)
	{
		In_LQueue(q,x);
		cin>>x;
	}
	return q;
}
void Print(linkqueue* q)
{
	qnode *p;
	p=q->front->next;
	cout<<"队列中的数据为:";
	while(p!=NULL)
	{
		cout<<p->data<<" ";
		p=p->next;
	}
	cout<<endl;
}
void main()
{
	linkqueue* q;
	int x;
	q=Init_LQueue();
	Print(q);
	cout<<"输入入队的数据，以-1结束："<<endl;
	cin>>x;
	while(x!=-1)
	{
		In_LQueue(q,x);
		cin>>x;
	}
	Print(q);
	Out_LQueue(q,x);
	cout<<"数据"<<x<<"出队!"<<endl;
	Print(q);
	Out_LQueue(q,x);
	cout<<"数据"<<x<<"出队!"<<endl;
	Print(q);
}