The data structure required for Breadth-First Traversal on a graph is?
A. Stack
B. Array
C. Queue
D. Tree
Answer:C
The data structure required for Breadth-First Traversal on a graph is?
A. Stack B. Array C. Queue D. Tree
Explanation: In Breadth-First Search Traversal, BFS, starting vertex is first taken and adjacent vertices which are unvisited are also taken. Again, the first vertex which was added as an unvisited adjacent vertex list will be considered to add further unvisited vertices of the graph. To get the first unvisited vertex we need to follow the First In First Out principle. Queue uses the FIFO principle.