Which data structure is used in Breadth First Traversal of a graph?
(a) Stack
(b) Queue
(c) Array
(d) Tree
(a) Stack
(b) Queue
(c) Array
(d) Tree
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
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).