Which 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 Of A Binary Tree, The Tree Cannot Be Reconstructed Uniquely.

(D) Depth-First-Search Can Be Used To Find The Components Of A Graph.

This answer was edited.The correct answer is

(B) Breadth-First Search Cannot Be Used To Find Connected Components Of A Graph.