What are queues in C++ and how do they work?

What are queues in C++ and how do they work?

Queues are a type of data structure that follow the First In First Out (FIFO) principle. In C++, you can implement queues using the Standard Template Library (STL) with the queue class.

Can you show me a simple example of how to implement a queue in C++?

Sure! Here's a basic example:

#include <iostream>
#include <queue>

int main() {
    std::queue<int> q;
    q.push(1);
    q.push(2);
    q.push(3);

    while (!q.empty()) {
        std::cout << q.front() << ' ';
        q.pop();
    }
    return 0;
}

This code creates a queue, adds three integers, and then prints them in FIFO order.

What are some common operations performed on queues?

Common operations on queues include:

1. enqueue (adding an element to the back)
2. dequeue (removing an element from the front)
3. front (accessing the front element without removing it)
4. isEmpty (checking if the queue is empty) and size (getting the number of elements in the queue).