C++实现队列进栈、出栈、打印数据

#include <iostream>
using namespace std;
#define MAX 5//MAXINUM CONTENTS　IN QUEUE

class queue
{
private:
int t[MAX];
int al;//Rear Point
int dl;//Front Point

public:
queue()
{
al=dl=-1;
}

void pop()
{
int tmp;

if(dl==-1)
{
cout<<"Queue is Empty";
}
else
{
for(int j=0;j<=al;j++)
{
if(j+1<=al)
{
tmp=t[j+1];
t[j]=tmp;
}
else
{
al--;
if(al==-1)
dl=-1;
else
dl=0;
}
}
}
}

void push(int item)
{
if(dl==-1&&al==-1)
{
dl++;
al++;
}
else
{
al++;
if(al==MAX)
{
cout<<"Queue is Full/n";
al--;
}
}

t[al]=item;
}

void display()
{
if(dl!=1)
{
for(int iter=0;iter<=al;iter++)
cout<<t[iter]<<"";
}
else
cout<<"EMPTY";
}
};