Can you explain queue implementation in C++ with examples?

Can you explain queue implementation in C++ with examples?

Sure! A queue is a data structure that follows the First In First Out (FIFO) principle. In C++, you can implement a queue using arrays or linked lists. Would you like to see an example using arrays?

Yes, please provide an example using arrays.

Here's a simple implementation of a queue using an array:

#include <iostream>
#define MAX 100

class Queue {
    int items[MAX];
    int front, rear;

public:
    Queue() { front = -1; rear = -1; }

    bool isFull() { return rear == MAX - 1; }
    bool isEmpty() { return front == -1; }

    void enqueue(int element) {
        if (isFull()) {
            std::cout << "Queue is full!" << std::endl;
        } else {
            if (front == -1) front = 0;
            rear++;
            items[rear] = element;
            std::cout << "Inserted " << element << std::endl;
        }
    }

    int dequeue() {
        if (isEmpty()) {
            std::cout << "Queue is empty!" << std::endl;
            return -1;
        } else {
            int element = items[front];
            if (front >= rear) front = rear = -1;
            else front++;
            return element;
        }
    }
};

This code defines a queue with basic operations like enqueue and dequeue.

Can you explain how the enqueue and dequeue functions work?

Certainly! The enqueue function adds an element to the end of the queue. It first checks if the queue is full; if not, it increments the rear index and places the new element there. The dequeue function removes an element from the front of the queue. It checks if the queue is empty; if not, it retrieves the front element and adjusts the front index accordingly.