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) and (D) only
• C. (A), (B), (C) and (D)
• D. (B), (C) and (D) only

Hint:

Linear data structures include: Arrays, Linked Lists, Stacks, Queues, and Deques.
Non-linear data structures include: Trees and Graphs.

Answer 1

The Correct Option is A

Concept:
Data structures are classified based on how their data elements are arranged in memory and traversed:
1. Linear Data Structures: Elements are arranged sequentially or linearly, where each element has a unique predecessor and successor (except the first and last).
2. Non-Linear Data Structures: Elements are organized hierarchically or interconnected across multiple paths.

Step 1: Classifying the Given Data Structures:
- Deque (Double-Ended Queue): A linear sequence allowing insertion and deletion at both ends. It is a linear data structure.
- Queue: Follows a sequential FIFO organization. It is a linear data structure.
- Stack: Follows a sequential LIFO organization. It is a linear data structure.
- Tree: A hierarchical collection of nodes linked by directed or undirected edges consisting of roots, parents, and children. It is a non-linear data structure.

Step 2: Conclusion:
Deque (A), Queue (B), and Stack (C) are linear data structures, while Tree (D) is non-linear.
Final Answer:
The linear data structures are (A), (B) and (C) only, corresponding to option (A).