Graphs-and-Tree

Question 5

Breadth first traversal is a method to traverse

A	All successor of a visited node before any successors of any of those successors
B	A single path of the graph as far it can go
C	Graph using shortest path
D	None of these

Question 5 Explanation:

Breadth first traversal is a method to traverse all successor of a visited node before any successors of any of those successors.

Correct Answer: A

Question 5 Explanation:

Breadth first traversal is a method to traverse all successor of a visited node before any successors of any of those successors.