Choose the correct statements:

• I – Breadth-first traversal used to check connectivity in the graph.
• II – Breadth-first traversal is used to check articulation point.
• III – On the same tree Breadth-first traversal and Depth-first traversal will give you same output but for the same graph Breadth-first traversal and Depth-first traversal will give you different output.
• IV – With the help of Breadth-first traversal, 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 first traversal both are used to check connectivity in the graph.
2. DFT is 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