A _______ is a data structure that allows elements to be inserted from one end and removed from the other end.
- Deque
- Linked List
- Queue
- Stack
A deque (double-ended queue) is a data structure that allows elements to be inserted from one end and removed from the other end. This provides flexibility in adding and removing elements from both the front and rear, making it a versatile data structure.
Loading...
Related Quiz
- What is the worst-case time complexity of Quick Sort?
- How does Quick Sort select the pivot element in its partitioning process?
- Selection sort's time complexity can be improved to _______ by implementing certain optimizations.
- In radix sort, what is the significance of the "radix" or base value?
- The Fibonacci sequence starts with the numbers 0 and _______.