Hi everyone In this tutorial we will talk about Deque So, What is Deque actually? Deque stands for Double Ended Queue. Deque is a special type of queue where data can be inserted and removed at both ends.   Header File Inclusion for deque #include <deque> Declaration & Initialization Declaring an empty deque — deque […]

Hi everyone In this tutorial we will talk about Queue So, What is Queue actually? Queue is a First In First Out(FIFO) data structure. STL Queue also works the same way STL Queue container’s underlying data structure deque (Double Ended Queue)   Header File Inclusion for queue #include <queue> Declaration #include <queue> queue <int> fifoList;

Hi everyone In this tutorial we will talk about Stack So, What is stack actually? Stack is a Last In First Out(LIFO) data structure. STL Stack also works the same way STL stack container’s underlying data structure deque (Double Ended Queue)   Header File Inclusion for stack #include <stack> Declaration #include <stack> stack <int> lifoList;

Hi Everyone In this tutorial we will talk about List. So, what is list actually? List is a doubly linked list container in C++ STL. List is a sequential container of STL. Since, its underlying data structure is doubly linked list, list has a dynamic property regarding memory allocation. Header File Inclusion for list #include

Hi Everyone ✋ In this tutorial we will talk about Vector. So, what is vector actually? Vector is a dynamic array container of C++ STL. Vector is a sequential container of STL. Array data structure is great for random access. But it has a fixed size array limitation. In a dynamic array, we don’t have

Hi Everyone ✋ In this tutorial series we will talk about C++ STL in depth. STL stands for Standard Template Library. STL has four components Containers Iterators Algorithms Function Objects     Containers Containers are actually pre implemented data structures provided by C++ to use. These containers help us to write code efficiently without worrying