Match the LIST-I with LIST-II LIST-I LIST-II A. Breadth First Search I. LISP…
2025
Match the LIST-I with LIST-II
LIST-I | LIST-II |
A. Breadth First Search | I. LISP |
B. Depth First Search | II. Syntax tree |
C. Prefix | III. Stack |
D. Infix | IV. Queue |
Choose the correct answer from the options given below:
- A.
A-III, B-IV, C-I, D-II
- B.
A-III, B-IV, C-II, D-I
- C.
A-IV, B-II, C-III, D-I
- D.
A-IV, B-III, C-I, D-II
Attempted by 227 students.
Show answer & explanation
Correct answer: D
Breadth First Search fundamentally requires a Queue for level-order traversal. Depth First Search relies on a Stack for path exploration. Option 3 correctly pairs BFS with Queue and DFS with Stack, aligning with standard algorithmic implementations.
A video solution is available for this question — log in and enroll to watch it.