Which of the following statements is false?
Optimal binary search tree construction can be performed efficiently using dynamic programming
Breadth-first search cannot be used to find connected components of a graph
Given the prefix and postfix walks over a binary tree, the binary tree cannot be uniquely constructed.
Depth-first search can be used to find connected components of a graph
Answer is $B$.
Refer this link for the explanation
Option B is false. We can use BFS to find connected components.
When will be the final official key...