Please wait...
THANKU FOR BEING A PART OF OUR JOURNEY TO BRING "REVOLUTION IN EDUCATION"
We Genuinely APPRECIATE your PATIENCE

search
close
17
M: +1.00/-0.33

The Breadth First Search (BFS) algorithm has been implemented using the queue data structure. Which one of the following is a possible order of visiting the nodes in the graph below? if P is root Node.
 

[GATE CS 2017 Set 2]
A
B
C
D
Previous
Next