Editing Queues (section)

== C++ Example ==
Here's an example of a simple queue implementation in C++ using a linked list:

<pre>
#include <iostream>

class Node {
public:
    int data;
    Node* next;
};

class Queue {
public:
    Queue() : front(nullptr), rear(nullptr) {}

    void enqueue(int data) {
        Node* newNode = new Node();
        newNode->data = data;
        newNode->next = nullptr;

        if (isEmpty()) {
            front = rear = newNode;
        } else {
            rear->next = newNode;
            rear = newNode;
        }
    }

    void dequeue() {
        if (!isEmpty()) {
            Node* temp = front;
            front = front->next;
            if (front == nullptr) {
                rear = nullptr;
            }
            delete temp;
        }
    }

    int getFront() {
        if (!isEmpty()) {
            return front->data;
        }
        return -1;
    }

    int getRear() {
        if (!isEmpty()) {
            return rear->data;
        }
        return -1;
    }

    bool isEmpty() {
        return front == nullptr;
    }

private:
    Node* front;
    Node* rear;
};

int main() {
    Queue queue;

    queue.enqueue(1);
    queue.enqueue(2);
    queue.enqueue(3);

    std::cout << "Front element is: " << queue.getFront() << std::endl;
    std::cout << "Rear element is: " << queue.getRear() << std::endl;

    queue.dequeue();
    std::cout << "Front element after dequeue is: " << queue.getFront() << std::endl;

    return 0;
}
</pre>

In this example, the Node class represents a single node in the queue, and the Queue class implements the queue operations using a linked list. The enqueue() function adds a new node to the rear of the queue, the dequeue() function removes the front node from the queue, the getFront() function retrieves the front element, the getRear() function retrieves the rear element, and the isEmpty() function checks if the queue is empty.