Data Structures :: Queue - Discussion
Home > Data Structures > Queue > MCQs Questions Discussion
11 / 42
Choose the correct option.
The data structure required for Breadth First Traversal on a graph is
Aqueue
Bstack
Carray
Dtree
Answer: Option (Login/Signup)
Show Explanation
Asked In ::
SHORTCUT
For finding the shortest path BFS(Breadth First Search) uses Queue data structure and DFS(Depth First Search) uses Stack data structure.
Read Full Answer
Report Error
Please Login First Click Here
STEP-BY-STEP
queue is not a graph type, is a linear type, but how can it answer
Read Full Answer
Report Error
Please Login First Click Here