Open In App

ISRO | ISRO CS 2017 – May | Question 17

Like Article
Like
Save
Share
Report

Which of the following data structure is useful in traversing a given graph by breadth first search?
(A) Stack
(B) List
(C) Queue
(D) None of the above.


Answer: (C)

Explanation: BFS performs level-order traversal which can be fairly done using a queue. A queue uses FIFO ordering and the nodes that we enqueue first are explored first maintaining the order of traversal.

Quiz of this Question


Last Updated : 20 Mar, 2018
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads