Implimentation of Simple Queue

#include<iostream>
using namespace std;
class list
{
private:
int queuerear;
int queuefront;
int maximumsize;
int queue[5];
int i;
int data;
public:
void initialize ();
bool isemptyqueue();
bool isfullqueue();
void insert(int num);
void deletee();
void print();
};
void list::initialize()
{
queuerear=-1;
queuefront=-1;
maximumsize=5;
}
bool list::isemptyqueue()
{
return(queuefront==-1);
}
bool list::isfullqueue()
{
return(queuerear== maximumsize);
}
void list::insert(int num)
{
if( isfullqueue())
{
cout<<"queue_is__full"<<endl;
}
else
{
queuerear++;
queue[queuerear]=num;
if(queuefront==-1)
queuefront=0;

}
}
void list::print()
{
if(isemptyqueue())
{
cout<<"queue is empty"<<endl;
}
else
{

cout<<"values_in_queue"<<endl;
for(i=queuefront;i<=queuerear;i++)
{
cout<<queue[i]<<endl;;
}
}
}
void list::deletee()
{
if(isemptyqueue())
{
cout<<"queue is empty"<<endl;
}
else{

cout<<"the service provide to queue as "<<endl;
queuefront++;
data= queue[queuefront];
// cout<<data<<endl;
}
if(queuerear==queuefront)
{
queuerear=queuefront=-1;
}
}
int main()
{
list obj;
obj.initialize();
int n,i,choice;
while(1)
{
cout<<"________________________________________"<<endl;
cout<<"enter 1 for enter data"<<endl;
cout<<"enter 2 for delete data"<<endl;
cout<<"enter 3 for show data in queue"<<endl;
cout<<"enter 4 to exit"<<endl;
cin>>choice;
cout<<"________________________________________"<<endl;
switch(choice)
{
case 1:
cout<<"enter queue values"<<endl;
cin>>n;
obj.insert(n);
break;
case 2:
obj.deletee();
break;
case 3:
obj.print();
break;
case 4:
return 0;
break;
default:
cout<<"in-valid choice"<<endl;

}
}
return 0;
}