Queue - Enqueue and Dequeue

// Exer17 Queue - Enqueue and Dequeue #include<conio.h> #include<stdlib.h> #define MAX 3 class Queue { private: int q[MAX],front,rear; public: Queue() // Constructor to intialize FRONT and REAR pointer { front = -1; rear = -1; } void enqueue(int); int dequeue(); // Member Functions Declaration void display(); }; void Queue::enqueue(int item) { if(rear == MAX-1) { cout<<"Queue is full.........Overflow!!!"<<endl; getch( ); exit(0); } if(front == -1) { front = 0; rear = 0; } else rear++; q[rear] = item; cout<<"Item Inserted: "<<item<<endl; } int Queue::dequeue() { int item; if(front == -1) { cout<<"Queue is Empty....Underflow!!!"<<endl; } item = q[front]; if(front == rear) { front = -1; rear = -1; } else front++; return item; } void Queue::display() { if(front == -1) cout<<"Queue is Empty!!!"<<endl; else for(int i=front; i<=rear; i++) cout<<q[i]<<endl; } void main() { int ele, choice; Queue q; clrscr( ); while(1) { cout<<"\nQueue Operation Menu"<<endl; cout<<"1.Adding Element"<<endl; cout<<"2.Deleting Element"<<endl; cout<<"3.Display"<<endl; cout<<"4.Exit"<<endl; cout<<"Enter your Choice"<<endl; cin>>choice; switch(choice) { case 1: cout<<"Enter the element to be inserted"<<endl; cin>>ele; q.enqueue(ele); break; case 2: cout<<"Deleted Item = "<<q.dequeue( ); break; case 3: cout<<"The Queue Contents:"<<endl; q.display( ); break; case 4: cout<<"End of Queue Operation"<<endl; getch(); exit(1); default:cout<<"Invalid Choice...!!!"<<endl; } getch(); } 

}