#include #include using namespace std; class CircularQueue { private: int *queue; int front, rear, size; public: // Constructor to initialize the queue CircularQueue(int size) { this->size = size; queue = new int[size]; front = rear = -1; } // Destructor to free allocated memory ~CircularQueue() { delete[] queue; } // Function to insert an element in the queue void enqueue(int element) { if (front == (rear + 1) % size) { cout << "Queue is Full" << endl; } else if (front == -1) { // Insert First Element front = rear = 0; queue[rear] = element; } else if (rear == size - 1 && front != 0) { rear = 0; queue[rear] = element; } else { rear = (rear + 1) % size; queue[rear] = element; } } // Function to delete an element from the queue int dequeue() { if (front == -1) { cout << "Queue is Empty" << endl; return INT_MIN; } int data = queue[front]; if (front == rear) { front = rear = -1; } else { front = (front + 1) % size; } return data; } // Function to display the elements of the queue void displayQueue() { if (front == -1) { cout << "Queue is Empty" << endl; return; } cout << "Elements in the Circular Queue are: "; if (rear >= front) { for (int i = front; i <= rear; i++) { cout << queue[i] << " "; } } else { for (int i = front; i < size; i++) { cout << queue[i] << " "; } for (int i = 0; i <= rear; i++) { cout << queue[i] << " "; } } cout << endl; } }; // Main method to test the CircularQueue class int main() { CircularQueue q(5); // Inserting elements in the queue q.enqueue(14); q.enqueue(22); q.enqueue(13); q.enqueue(-6); // Display elements present in the queue q.displayQueue(); // Deleting elements from the queue cout << "Deleted value = " << q.dequeue() << endl; cout << "Deleted value = " << q.dequeue() << endl; q.displayQueue(); q.enqueue(9); q.enqueue(20); q.enqueue(5); q.displayQueue(); q.enqueue(20); return 0; }