queue

#include <iostream>
using namespace std;
#include<stdlib.h>
#define MAX 10
class queue
{
private: int front, rear, a[MAX];
public:
void init();
void write(int);
void read();
void count();
void display();
};
void queue::init()
{
front = rear = -1;

}

void queue::write(int data)
{
if (rear == (MAX - 1))
cout << "\n Queue is overflow...";
else
a[++rear] = data;
}
void queue::read()
{
if (front == rear)
cout << "\n Queue is underflow...";
else
cout << "\n Deleted of elements in a queue are:" << a[++front];
}
void queue::count() {
cout << "\n Number of elements in queue are:"<<(rear-front);

}
void queue::display()
{
cout << "\n Elements in a queue are:";
for (int i = front + 1; i <= rear; i++)
cout << a[i] << "\t";
}
int main()
{
queue ob;
int ch, data;
ob.init();
cout << "\n 1.Write \n 2.Read \n 3.Coount \n 4.Display \n 5.Exit";
do {
cout << "\n Enter your choice";
cin >> ch;
switch (ch)
{
case 1: cout << "Enter elements to be inserted in queue"; cin >> data;
ob.write(data); break;
case 2:ob.read(); break;
case 3:ob.count(); break;
case 4:ob.display(); break;
case 5:exit(0); break;
default: cout << "\n Invalid choice.";

}
}
while (ch != 5);
return 0; }