Multiple choice technology architecture

Which data structure allows deleting data elements from front and inserting at rear?

  1. Stacks

  2. Queues

  3. Deques

  4. Binary search tree
Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

A queue is a FIFO (First-In-First-Out) data structure where deletions occur only at the front and insertions only at the rear. This is fundamental to queue behavior - elements are processed in arrival order. Stacks use LIFO, deques allow operations at both ends, and BSTs don't enforce positional insertion/deletion.

Keep practicing — related questions