Match 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 |
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: D. A-IV, B-III, C-I, D-II
Explanation
BFS uses a queue (A-IV), DFS uses a stack (B-III), LISP uses prefix notation (C-I), and an in-order walk of a syntax tree gives the infix expression (D-II).More Data Structures and Algorithms questions
- Which of the following is NOT a divide and conquer method?
- Arrange the following steps of the inorder traversal of a binary tree in the correct order. A. Visit the left subtree B. Visit the root nod…
- Which of the following algorithms are based on Breadth First Search (BFS)? A. Prim's algorithm B. Kruskal's algorithm C. Dijkstra's algorit…
- Which of the following is the solution of the recurrence relation T(n) = T(2n/3) + 1?
- Which of the following description(s) is/are true? A. Red-Black Tree – guarantees worst case O(log n) time for search, insert & delete. B.…
- Match List I with List IIList I List II A. Insertion Sort I. O(log n) B. Binary Search II. O(n²) C. Quick Sort III. O(n) D. Selection Sort…