Unlike a vector, a deque:
A) Provides efficient insertion and deletion only at its front.
B) Does not provide indexed access with the subscript operator.
C) Is not stored in contiguous memory.
D) Cannot store as many different data types.

Question

Quizplus · Accepted Answer

A deque (double-ended queue) is designed to allow efficient insertion and deletion at both its beginning and end, unlike a vector which is optimized for these operations at its end but not its beginning. Unlike arrays and vectors, a deque does not store its elements in contiguous memory; instead, it may use multiple arrays, enabling efficient growth by adding new arrays as needed. This structural difference allows deques to efficiently insert or delete elements at both ends. Deques provide indexed access to their elements just like vectors, and they can store as many different data types as vectors, as long as those types meet the container's requirements.

Unlike a Vector, a Deque