Here is a editing following code:
#include<iostream>
using namespace std;
int queue[10], n = 10, front = -1, rear = -1;
void Insert() {
int val;
cout<<"Insert the element in queue: ";
cin>>val;
if(rear==n-1)
cout<<"Queue Overflow";
else {
if(front==-1)
front = 0;
rear++;
queue[rear]=val;
}
}
void Delete() {
if(front==-1 || front>rear) {
cout<<"Queue Underflow ";
return;
} else {
cout<<"Deleted element is: "<<queue[front];
front++;
}
}
void Display() {
if(front==-1 || front>rear)
cout<<"Queue is empty";
else {
cout<<"Queue elements are: ";
for(int i=front; i<=rear; i++)
cout<<queue[i]<<" ";
}
}
int main() {
int ch;
cout<<"1) Insert element to queue\\";
cout<<"2) Delete element from queue\\";
cout<<"3) Display all the elements of queue\\";
cout<<"4) Exit\\";
do {
cout<<"Enter your choice: ";
cin>>ch;
switch(ch) {
case 1:
Insert();
break;
case 2:
Delete();
break;
case 3:
Display();
break;
case 4:
cout<<"Exit\\";
break;
default:
cout<<"Invalid choice\\";
}
} while(ch!=4);
return 0;
}