The vector container provides a dynamic arrray. It is defined as std::vector class template inside header file.
#include <vector>
vector <data_type> vector_namx; // 1D vector
vector < vector<data_type> > vector_name; // 2D vector
The list container implements the doubly linked list data structure. It is defined as std::list inside header file.
#include <list>
list <data_type> list_name;
The deque implements the double-ended queue which follows the FIFO mode of operation but unlike the queue. the deque can grow and shrink from both ends. It is defined as std::deque inside header file.
#include<deque>
deque <data_type> deque_name;
The Stack is a container adaptor that operates one LIFO principle. It is defined as std::stack in header file.
#include<stack>
stack <data_type> stack_name;
The Queue is a container adapter that uses the FIFO mode of operation where the most recently inserted element can be accessed at last. It is defined as the std::queue class template in the header file.
#include <queue>
queue <data_type> queue_name;