CPP STL Tutorial: std::deque and it’s operations.

In this chapter we shall learn about:

1. deque introduction.
2. deque declaration.
3. Multidimensional std::deque
4. Passing std::deque to function
5. deque member function to iterate over elements.
6. deque member function to check the capacity.
7. deque member function to access the elements.
8. deque member function to modify the elements.
9. what is the advantage of deque over vector?
10. Do deque store in continuous memory or non continuous memory?

1. deque introduction.
———————————————————————————-
deque is a double ended queue. You can insert elements at the beginning and also at the end.
The elements are stored in non continuous memory location.

Below header file is used for deque:

#include <deque>

2. deque declaration.
———————————————————————————-

Below is how you declare a deque:

std::deque<int> mydeque;

3. Multidimensional std::deque
———————————————————————————-

Below is how you declare a 2D deque:

deque<deque<int>> num = {
    { 1, 2, 3 },
    { 4, 5, 6 },
    { 7, 8, 9 }
};