Question:medium
Which of the following statement(s) is/are not true?
1. Optimal binary search tree construction can be performed efficiently using dynamic programming.
2. BFS cannot be used to find connected components of a graph.
3. Given the prefix and postfix walks over the binary tree, the binary tree cannot be uniquely constructed.
4. DFS can be used to find connected components of a graph.
Choose the correct answer from the options given below:
Which of the following statement(s) is/are not true?
1. Optimal binary search tree construction can be performed efficiently using dynamic programming.
2. BFS cannot be used to find connected components of a graph.
3. Given the prefix and postfix walks over the binary tree, the binary tree cannot be uniquely constructed.
4. DFS can be used to find connected components of a graph.
Choose the correct answer from the options given below:
1. Optimal binary search tree construction can be performed efficiently using dynamic programming.
2. BFS cannot be used to find connected components of a graph.
3. Given the prefix and postfix walks over the binary tree, the binary tree cannot be uniquely constructed.
4. DFS can be used to find connected components of a graph.
Choose the correct answer from the options given below:
Show Hint
BFS and DFS are powerful graph traversal techniques; understand their roles in finding connected components.
Updated On: Feb 11, 2026
- (A) and (C) only
- (B) and (D) only
- (D) only
- (B) only
Show Solution
The Correct Option is D
Solution and Explanation
- Statement A: True. Optimal binary search tree construction is accomplished via dynamic programming. - Statement B: False. Breadth-First Search (BFS) is effective for identifying connected components in a graph. - Statement C: True. A binary tree cannot be uniquely reconstructed solely from its prefix and postfix traversals. - Statement D: True. Depth-First Search (DFS) is frequently utilized for finding a graph's connected components.
Was this answer helpful?
0
Top Questions on Algorithm
- When does the worst case of binary search occur?
- Suppose that insertion sort is applied to the array \([1,2,3,5,7,9,11,x,15,13]\) and it takes exactly 2 swaps to sort the array. Select all possible values of \( x \).
- Which of the following data structures supports binary search in \( O(\log n) \) time complexity?
- Consider the following algorithm:
What will be the output (O/P) of this algorithm? - Want to practice more? Try solving extra ecology questions todayView All Questions