C++ Program Code To implement Queue & Its Associated Operation of Insertion, Deletion, Display, using template class & array

/*The following C++ program code utilizes the concept of template class, & arrays in order to implement queue & associated operations. The user is given the options to insert & delete the elements. Show the queue, front & rear element of the queue. And off course, one option to exit the program */

#include<iostream>
#include<stdlib.h>
#include<process.h>
using namespace std;

template<class T>
class Queue
{
      private:
             int front,rear;
             T *queue;
             int maxsize;
      public:
             Queue(int maxqueuesize)
             {
                       front=0;
                       rear=-1;
                       maxsize=maxqueuesize;
                       queue=new T[maxsize];
             }
             ~Queue()
             {
                     delete[] queue;
             }
             int isempty();
             int isfull();
             void insert();
             void deletion();
             void atfront();
             void atrear();
             void display();
};

template<class T>
int Queue<T>::isempty()
{
    if(front==0&&rear==-1||front==rear)
    return 1;
    else
    return 0;
}

template<class T>
int Queue<T>::isfull()
{
    if(rear==maxsize-1)
    return 1;
    else
    return 0;
}

template<class T>
void Queue<T>::atfront()
{
     if(isempty())
     cout<<"\nSorry the queue is empty!";
     else
     cout<<"\nFront element of the queue is : "<<queue[front];
}

template<class T>
void Queue<T>::atrear()
{
     if(isempty())
     cout<<"\nSorry the queue is empty!";
     else
     cout<<"\nRear element of the queue is : "<<queue[rear];
}

template<class T>
void Queue<T>::insert()
{
     T ele;
     if(isfull())
     cout<<"\nSorry the queue is full!";
     else
     {
     cout<<"\nEnter the element to insert : ";
     cin>>ele;
     queue[++rear]=ele;
     }
}

template<class T>
void Queue<T>::deletion()
{
     if(isempty())
     cout<<"\nSorry the queue is empty!";
     else
     cout<<"\nDeleted element of the queue is : "<<queue[front++];
}

template<class T>
void Queue<T>::display()
{
     if(isempty())
     cout<<"\nSorry the queue is empty!";
     else
     {
         cout<<"\nQueue elements are : ";
         for(int i=front;i<=rear;i++)
         {
                 cout<<"\t"<<queue[i];
         }
     }
}

int main()
{
    int ch;
    Queue<int> q(10);
    do
    {
             cout<<"\n 1.Insertion \n 2.Deletion \n 3.Display Front Element \n 4.Display Rear Element \n 5.Display Queue \n 6.Exit \n";
             cout<<"Enter your Choice:";
             cin>>ch;
             switch(ch)
             {
                       case 1:
                            q.insert();
                            break;
                       case 2:
                            q.deletion();
                            break;
                       case 3:
                            q.atfront();
                            break;
                       case 4:
                            q.atrear();
                            break;
                       case 5:
                            q.display();
                            break;
                       case 6:
                            exit(0);
                            break;
                       default: cout<<"\nWrong Choice Entered!";
                      
             }
    }while(ch<=6);
    system("pause");
    return 0;
}

Screenshot: