How do I use deque in C++ STL?

How do I use deque in C++ STL?

In C++, a deque (double-ended queue) is part of the Standard Template Library (STL). You can include it using #include <deque>. Would you like to see some basic operations?

Yes, please show me how to add and remove elements.

You can add elements using push_back() to add at the end and push_front() to add at the beginning. To remove, use pop_back() and pop_front().

Can you give me a code example?

Sure! Here's a simple example:

#include <iostream>
#include <deque>

int main() {
    std::deque<int> d;
    d.push_back(1);
    d.push_front(2);
    d.pop_back();
    std::cout << d.front(); // Outputs 2
    return 0;
}

What are the advantages of using deque over vector?

Deque allows fast insertions and deletions at both ends, while vector is more efficient for random access and adding/removing elements at the end.