Q33
What is the time complexity of BFS when implemented using an adjacency list?
A.
O(V log V)
B.
O(E log V)
C.
O(V2)
D.
O(V + E)
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board