Match each data-structure term in List I with its property in List II. List I…
2017
Match each data-structure term in List I with its property in List II.
List I | Term | List II | Property |
|---|---|---|---|
I | Stack | P | Non-linear |
II | Heap tree | Q | Complete binary tree |
III | Tree | R | Ordered list |
IV | Binary search | S | Linear |
Answer: A. I – S, II – Q, III – P, IV – R — ConceptData structures are classified by how their elements are organized: a linear structure follows one sequential path, while a non-linear structure…
- A.
I – S, II – Q, III – P, IV – R
- B.
I – P, II – Q, III – S, IV – R
- C.
I – S, II – P, III – Q, IV – R
- D.
I – Q, II – S, III – P, IV – R
Attempted by 667 students.
Show answer & explanation
Correct answer: A
Concept
Data structures are classified by how their elements are organized: a linear structure follows one sequential path, while a non-linear structure branches hierarchically.
A binary heap has the shape property of a complete binary tree, and binary search relies on an ordered collection so that each comparison can discard one half.
Application
Stack → Linear: stack elements form a sequential LIFO collection.
Heap tree → Complete binary tree: every level is full except possibly the last, which fills from left to right.
Tree → Non-linear: nodes may branch into multiple hierarchical paths.
Binary search → Ordered list: the comparison-and-halving rule needs sorted order.
Cross-check
Stack → Non-linear together with Tree → Linear exchanges their broad structural classifications.
Heap tree → Non-linear together with Tree → Complete binary tree exchanges a specific heap-shape property with the broader tree classification.
Stack → Complete binary tree together with Heap tree → Linear assigns properties that do not describe those structures.
Therefore: Stack → Linear; Heap tree → Complete binary tree; Tree → Non-linear; Binary search → Ordered list.
Explore the full course: Iocl Engineers Officers Grade A Paper 2