链队列--简单操作

实现链队列的简单操作，如入队和出队

#include<iostream>
using namespace std;
class Node{
	friend class  LinkQueue;
private:
int data;
Node * next;
};

class LinkQueue{
public: LinkQueue();
		~ LinkQueue(){};
	   void EnQueue(int x);
	   int DeQueue();
	   int GetQueue(){if(front->next!=NULL) return front->next->data;}
	   int Empty(){
		   if(front==rear) return 1;   
		  return 0; }
private:
	Node * front ,* rear;
};
LinkQueue::LinkQueue()
{Node*s;
s=new Node;
s->next=NULL;
front=rear=s;
}
void  LinkQueue::EnQueue(int x){    //入队
Node *s;
s=new Node;
s->data=x;
s->next=NULL;
rear->next=s;
rear=s;
}

int  LinkQueue::DeQueue(){    //出队
Node *p;
int x;
if(rear==front) throw "下溢";
p=front->next;
x=p->data;
front->next=p->next;
if(p->next==NULL) rear=front;
delete p;
return x;
}


int main(){
 LinkQueue Que;
int a[20],n,i,x;
cout<<"How many number do you want?"<<endl;
cin>>n;
cout<<"请依次输入入队的值：";
for(i=0;i<n;i++)
{
cin>>x;
Que.EnQueue(x);
}
cout<<"队头为："<<Que.GetQueue()<<endl;
cout<<"出队顺序为:"<<endl;
for(i=0;i<n;i++)
cout<<Que.DeQueue()<<" ";
cout<<endl;

return 0;
}

实验结果：