#include #include #include #define MAX_SIZE 10 class Queue { private: int arr[MAX_SIZE]; int front,rear; public: Queue() { front=-1;rear=-1; } void add(int); int remove(); void display(); }; void Queue::add(int data) { if(rear>=MAX_SIZE-1) { cout<<"Queue Overflow"; } else { rear++; arr[rear]=data; } } int Queue::remove() { if(front==rear) { cout<<"Queue Underflow\n"; return 0; } else { int x=arr[++front]; return x; } } void Queue::display() { cout<<"The Queue is :\n"; for(int i=front+1;i<=rear;i++) { cout<>choice; switch(choice) { case 1: int data; cout<<"Enter the element to be Added: "; cin>>data; queue.add(data); break; case 2: cout<<"The Deleted element is: " << queue.remove(); break; case 3: queue.display(); break; case 0: exit(0); } } }