A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear), is known as:

Question

Accepted Answer

The correct option is (1):
A **Queue** is the data structure that perfectly fits the description of a linear list where elements are processed in a First-In, First-Out (FIFO) manner, analogous to customers waiting in a line. Its operational rule is defined by two distinct ends: new elements are always added or inserted at the **rear** end (this operation is known as Enqueue), and existing elements are always removed or deleted from the **front** end (known as Dequeue). This strict dual-ended access mechanism ensures that the element which has been in the list the longest is the next one to be removed, directly satisfying the condition stated in the question.

The incorrect option is (2):
**Stack** is incorrect because it follows the Last-In, First-Out (LIFO) principle. Unlike a Queue, both insertion (Push) and deletion (Pop) in a Stack take place exclusively at one end, which is referred to as the **top**. The defining characteristic of a Stack is that the last element added is the first one to be removed, which contradicts the required rule of deletion from one end (front) and insertion at the other (rear).

The incorrect option is (3):
**Tree** is incorrect because it is fundamentally a **non-linear** data structure, which violates the first condition of the question ("A linear list of elements..."). A Tree organizes data hierarchically into nodes and branches, establishing parent-child relationships, rather than in a sequential, linear fashion. Insertion and deletion operations are complex and depend on the tree's structure (e.g., maintaining balance or ordering), not simply a fixed front and rear end.

The incorrect option is (4):
**Linked List** is a general linear data structure used for implementation. Although it can be used to implement a Queue, the Linked List itself is not inherently restricted to the front/rear deletion/insertion rule. A basic Linked List allows for efficient insertion and deletion at various positions, including the beginning, end, and even in the middle if the preceding node is known. Therefore, its flexibility makes it an implementation tool, but it does not represent the specific, strict access rule of a Queue.