DT Q5
0. Which one of the following statements is false?
- A
Optimal binary search tree construction can be performed efficiently using dynamic programming
- B
Breadth-first search cannot be used to find connected components of a graph
- C
Given the prefix and postfix walks over a binary tree, the binary tree cannot be uniquely constructed
- D
Depth-first search can be used to find connected components of a graph
- Option : B
- Explanation : BFS and DFS both algorithm are used to find connected component of graph in linear time.
You must be logged in to post a comment.
You must be logged in to post a comment.