Question

The data structure required for Breadth First Traversal on a graph is
(1) queue
(2) stack
(3) array
(4) tree

Answer 1

The Breadth First Search explores every node once and every edge once (in worst case), so it's time complexity is O(V + E). ... Explanation: The Breadth First Search explores every node once and put that node in queue and then it takes out nodes from the queue and explores it's neighbors.

Answer 2

$<b>$

HeYaA mAtE

Here is your answer:-

___________________________

▇ ▅ █ ▅ ▇ ▂ ▃ ▁ Option C▁ ▅ ▃ ▅ ▅ ▄ ▅ ▇

____________________________

==>> Because this option match's the most from your answer.

==>> This is the right option for your question.

==>> Mark it as brain list .

Hope it helps you

Thanks