C++ Deque vs Queue: What's the Difference?

What is the difference between a deque and a queue in C++?

In C++, a queue is a FIFO (First In, First Out) data structure, while a deque (double-ended queue) allows insertion and deletion from both ends.

Can you give me an example of how to use both in C++?

Sure! Here's a simple example:

#include <iostream>
#include <queue>
#include <deque>

int main() {
    std::queue<int> q;
    std::deque<int> d;

    // Using queue
    q.push(1);
    q.push(2);
    std::cout << "Queue front: " << q.front() << '\n';
    q.pop();

    // Using deque
    d.push_back(1);
    d.push_back(2);
    d.push_front(0);
    std::cout << "Deque front: " << d.front() << '\n';
    d.pop_front();

    return 0;
}

What are the performance differences between them?

Generally, both have similar performance for basic operations, but deques can be more efficient for operations at both ends due to their dynamic array structure.