Choose the correct statements:
I – Breadth-first traversal used to check connectivity in the graph.
II – BFT is used to check articulation point.
III – On the same tree BFT and DFT will give you same output but for the same graph BFT and DFT will give you different output.
IV – With the help of BFT we can check if a graph is bipartite or not.

(A) I, III and IV
(B) II and III
(C) I and IV
(D) All statements are correct.


Answer: (C)

Explanation:

1. Breadth First traversal and depth tree traversal both are used to check connectivity in the graph.
2. DFTis used to check articulation point(point: if it is removed then graph / tree will be disconnected)
3. Since BFT uses queue data structure and DFT uses stack data structure
4. We can check if a given graph is bipartite or not with the help of BFT

So, option (C) is correct.

Quiz of this Question