Double-ended queues are sequence containers with the feature of expansion and contraction on both the ends.
They are similar to vectors but are more efficient in case of insertion and deletion of elements. Unlike vectors, contiguous storage allocation may not be guaranteed.
Double Ended Queues are basically an implementation of the data structure double-ended queue. A queue data structure allows insertion only at the end and deletion from the front. This is like a queue in real life, wherein people are removed from the front and added at the back. Double-ended queues are a special case of queues where insertion and deletion operations are possible at both the ends.
The functions for deque are the same as a vector, with the addition of push and pop operations for both front and back.
Vectors are same as dynamic arrays with the ability to resize itself automatically when an element is inserted or deleted, with their storage being handled automatically by the container. Vector elements are placed in contiguous storage so that they can be accessed and traversed using iterators. In vectors, data is inserted at the end. Inserting at the end takes differential time, as sometimes there may be a need of extending the array. Removing the last element takes only constant time because no resizing happens. Inserting and erasing at the beginning or in the middle is linear in time.
Difference between Deque and Vector:
|Provides insertion and deletion methods at middle and end||Provides insertion and deletion methods at middle, end, beginning|
|Bad performance for insertion and deletion at the front||Good performance for insertion and deletion at the front|
|Stores elements contiguosly||It contains lists of memory chunks where elements are stored contiguosly|
|Good performance for addition and deletion of elements at the end||Poor performance for addition and deletion of elements at the end|
When should we choose Deque over Vector?
We must choose Deque when our operations are adding and deleting elements in the beginning and at the end (Double-ended queue ADT).
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- deque::empty() and deque::size() in C++ STL
- deque::clear() and deque::erase() in C++ STL
- deque::front() and deque::back() in C++ STL
- deque::pop_front() and deque::pop_back() in C++ STL
- deque::emplace_front() and deque::emplace_back() in C++ STL
- deque::begin() and deque::end in C++ STL
- deque::at() and deque::swap() in C++ STL
- vector::push_back() and vector::pop_back() in C++ STL
- vector::crend() & vector::crbegin() with example
- vector :: cbegin() and vector :: cend() in C++ STL
- vector::front() and vector::back() in C++ STL
- vector::empty() and vector::size() in C++ STL
- How to flatten a Vector of Vectors or 2D Vector in C++
- vector::begin() and vector::end() in C++ STL
- vector::at() and vector::swap() in C++ STL
- deque get_allocator in C++ STL
- deque crend in C++ STL
- deque::push_front() in C++ STL
- deque cbegin() in C++ STL
- deque::push_back() in C++ STL
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.