ISRO | ISRO CS 2017 – May | Question 17
Which of the following data structure is useful in traversing a given graph by breadth first search?
(D) None of the above.
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