Multiple choice technology architecture

A data structure where elements can be added or removed at either end but not in the middle

  1. Linked lists

  2. Stacks

  3. Queues

  4. Deque
Reveal answer Fill a bubble to check yourself
D Correct answer
Explanation

A deque (double-ended queue) specifically allows insertion and deletion at both ends. Stacks only allow operations at one end (LIFO), queues restrict insertion to rear and deletion to front (FIFO), and linked lists allow insertion/deletion anywhere but not with the same efficiency at both ends as a deque.

Keep practicing — related questions