#include<iostream.h>
#include<stdlib.h>
//定義鏈隊(duì)列結(jié)構(gòu)
typedef struct Qnode 
{
        int   data;
        struct  Qnode *next;
}Qnode,*QueuePtr;
typedef struct  
{
        QueuePtr front;
        QueuePtr rear;
} LinkQueue;
//隊(duì)列的初始化：
void InitQueu(LinkQueue &Q)
{
	Q.front=Q.rear=(Qnode *)malloc(sizeof(Qnode));
    if(Q.front==NULL)
       {cout<<"overflow";
        exit (0);
	}
	Q.front->next=NULL;
}
//隊(duì)列的插入：
int  push(LinkQueue &Q,int x)
 {    Qnode *p;
	p=(Qnode*)malloc(sizeof(Qnode));
    if(p==NULL)
       {cout<<"overflow";
         return 0;}
   p->data=x; p->next=NULL;
   Q.rear->next=p;
   Q.rear=p;return 1;
}
//隊(duì)列的刪除：
	int  del(LinkQueue &Q,int &x)
{  
		  if(Q.front==Q.rear)
       {cout<<"Empty"; 
         return 0;}
		   Qnode *p;
        p=Q.front->next;x=p->data;
      Q.front->next=p->next;
   if(Q.rear==p) Q.rear=Q.front;
    
      free (p);
	 return (x);
}


void main()
{
   LinkQueue Q;
	InitQueu(Q);
	int x,y;
	InitQueu(Q);
	int a=2,b=3;
	push(Q,a);
    push(Q,b);
	del(Q,x);
    del(Q,y);
	cout<<x<<endl<<y<<endl;
}