1.

Which data structure conveniently used to implement BFS?(a) Stacks(b) Queues(c) Priority Queues(d) All of the mentioned

Answer» Right answer is (b) Queues

Easy explanation: Queue is the most convenient data structure, but memory used to store nodes can be reduced by using circular queues.


Discussion

No Comment Found

Related InterviewSolutions