void Que :: enqueue()
{
if(isEmpty())
{
frontIndex = rearIndex = 0;
cout<<"Initially the queue is empty!"<<endl;
cout<<"Inserting the first element..."<<endl;
cout<<"Enter a number: ";
cin>>queue[frontIndex];
cout<<endl;
}
else if(isFull())
{
cout<<"OOPS! No Space is Available!"<<endl;
}
else
{
if(frontIndex != 0 && rearIndex == (SIZE - 1))
{
rearIndex = 0;
cout<<"Enter a number: ";
cin>>queue[rearIndex];
cout<<endl;
}
else
{
rearIndex++;
if(rearIndex == frontIndex)
{
cout<<"OOPS! Queue is full!"<<endl;
}
else
{
cout<<"Enter a number: ";
cin>>queue[rearIndex];
cout<<endl;
}
}
}
}
int Que :: dequeue()
{
if(isEmpty())
{
cout<<"Queue is empty!"<<endl;
}
else if(rearIndex == (SIZE - 1))
{
if(frontIndex == rearIndex)
{
{
if(isEmpty())
{
frontIndex = rearIndex = 0;
cout<<"Initially the queue is empty!"<<endl;
cout<<"Inserting the first element..."<<endl;
cout<<"Enter a number: ";
cin>>queue[frontIndex];
cout<<endl;
}
else if(isFull())
{
cout<<"OOPS! No Space is Available!"<<endl;
}
else
{
if(frontIndex != 0 && rearIndex == (SIZE - 1))
{
rearIndex = 0;
cout<<"Enter a number: ";
cin>>queue[rearIndex];
cout<<endl;
}
else
{
rearIndex++;
if(rearIndex == frontIndex)
{
cout<<"OOPS! Queue is full!"<<endl;
}
else
{
cout<<"Enter a number: ";
cin>>queue[rearIndex];
cout<<endl;
}
}
}
}
int Que :: dequeue()
{
if(isEmpty())
{
cout<<"Queue is empty!"<<endl;
}
else if(rearIndex == (SIZE - 1))
{
if(frontIndex == rearIndex)
{
