Match the LIST-I with LIST-II.
| LIST-I (Data structure) | LIST-II (Characteristics) |
|---|---|
| A. Stack | I. First-In-First-Out (FIFO) order |
| B. Queue | II. Last-In-First-Out (LIFO) order |
| C. Linked list | III. Nodes with two children ordered |
| D. Binary search tree | IV. Dynamic size, nodes linked sequentially |
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: B. A-II, B-I, C-IV, D-III
Explanation
A Stack follows Last-In-First-Out order, so A-II. A Queue follows First-In-First-Out order, so B-I. A Linked list has dynamic size with nodes linked sequentially via pointers, so C-IV. A Binary search tree has nodes with up to two children maintained in sorted (ordered) fashion, so D-III. This gives A-II, B-I, C-IV, D-III, which is option (2).More Data Structures and Algorithms questions
- How will the following min-heap appear on inserting the key 32? Original min-heap (level order): 5, 10, 25, 30, 40, 50, 60, 70, 80, 90 (roo…
- Consider the infix expression Q : ((A + B) ∗ D) ↑ (E − F). The equivalent postfix expression of Q is
- Which of the following trees are height balanced? A. Binary Search Tree B. AVL Tree C. Red-Black Tree D. B Tree Choose the correct answer f…
- Which of the following algorithms use the Greedy strategy? A. Dijkstra's algorithm B. Kruskal's algorithm C. Huffman coding D. Bellman-Ford…
- The longest common subsequence of {1,2,3,2,4,1,2} and {2,4,3,1,2,1} is
- Match List I (Hashing Collision Handling Method) with List II (Strategy)List I List II A. Chaining I. Check next slot B. Linear Probing II.…