Using BFS or DFS on a graph stored as adjacency lists, what is the tight…
PYQ CoCubes 2025
Using BFS or DFS on a graph stored as adjacency lists, what is the tight worst-case time complexity, expressed in terms of V vertices and E edges, for searching for a vertex?
- A.
O(V + E)
- B.
O(log V)
- C.
O(V2)
- D.
O(E log V)
Attempted by 401 students.
Sign up free to check your answer
Sign up freeLoading lesson…

