deque Question 7

Last Updated :
Discuss
Comments

How does C++ STL deque achieve O(1) insertions, deletions, and random access?

Circular array with dynamic resizing

Linked list for insertions and deletions

Array of pointers to fixed-size blocks

Single dynamic array with resizing

This question is part of this quiz :

C++ Deque,C++ Stack
Tags:
C++ Quiz
C++
Share your thoughts in the comments
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy