1.

Which data structure is used in Breadth First Traversal of a graph?(a) Stack(b) Queue(c) Array(d) Tree

Answer» Right choice is (b) Queue

The explanation: In Breadth First Traversal of graph the nodes at the same level are accessed in the order of retrieval (i.e FIFO).


Discussion

No Comment Found

Related InterviewSolutions