Which of the following statement is true ?

A. Breath first search cannot be used to find converted components of a graph.

B. Optimal binary search tree construction can be performed efficiently using dynamic programming.

C. Given the prefix and post fix walks over a binary tree.The binary tree cannot be uniquely constructe

D. Depth first search can be used to find connected components of a graph.

Please do not use chat terms. Example: avoid using "grt" instead of "great".