Question

Which of the following is a linear data structure?
(A) Deque
(B) Queue
(C) Stack
(D) Tree
Choose the correct answer from the options given below:

• A. (A), (B) and (C) only
• B. (A), (B) and (D) only
• C. (A), (B), (C) and (D)
• D. (B), (C) and (D) only

Hint:

Linear means items sit in one sequence. A tree has branches, so it is non-linear.

Answer 1

The Correct Option is A

Step 1: Idea:
Ask one question about each structure: can all its items be placed in a single row, where each item has one next item? If yes, it is linear.

Step 2: Apply the test.
Stack: items sit in one row and we work at the top end. Passes.
Queue: items sit in one row, we add at the back and remove from the front. Passes.
Deque: items sit in one row, we add or remove at either end. Passes.
Tree: one parent can lead to two or more children, so there is no single row. Fails.

Step 3: Pick the matching option.
Passing structures: Deque, Queue, Stack, which are (A), (B), (C). The option that lists exactly these three is option 1. The other options contain (D), a tree, so they are wrong.

Step 4: Conclusion.
Option 1 is correct. \[ \boxed{\text{(A), (B) and (C) only}} \]