Queue using array

#include
#include
#include

#define SIZE 20

class queue
{
int a[SIZE];
int front,rear;

public:
queue();
void insert();
void delet();
void display();
};

void queue::queue()
{
front=rear=-1;
}

void queue::insert()
{
int ele;

if(front==-1)
{
cout<<"\nEnter the element to be inserted:";
cin>>ele;
front++;
a[++rear]=ele;
display();
}

else if(rear>SIZE-1)
{
cout<<"\nThe queue is full....cannot insert elements";
}

else
{
cout<<"\nEnter the element to be inserted:";
cin>>ele;
a[++rear]=ele;
display();
}

}

void queue::delet()
{
if((front==rear+1)||front==-1)
{
cout<<"\nThe queue is empty.......cannot perform deletion";
front=rear=-1;
}

else
{
cout<<"The element deleted from queue is "< front++;
display();
}
}

void queue::display()
{
int i;

if((front==rear+1)||front==-1)
{
cout<<"\nThe queue is empty.......cannot perform deletion";
front=rear=-1;
}
else
{
cout<<"\nThe queue is now\n";
for(i=front;i<=rear;i++)
{
cout< }
}
}

void main()
{
int ch;
queue q1;
clrscr();
do
{
cout<<"\n--------------Queue operations--------------";
cout<<"\n1_Insertion";
cout<<"\n2_Deletion";
cout<<"\n3_Display";
cout<<"\n4_Exit";
cout<<"\nEnter your choice<1-4>:";
cin>>ch;

switch(ch)
{
case 1:
q1.insert();
break;

case 2:
q1.delet();
break;

case 3:
q1.display();
break;

case 4:
exit(0);
break;

default:
cout<<"\nInvalid choice!!!!";
break;
}
}while(ch!=4);
getch();
}