Q30
What is the time complexity of performing a DFS traversal on a graph represented using an adjacency list?
A.
O(V + E)
AnswerB.
O(V2)
C.
O(E)
D.
O(V log V)
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board