- A O(1)
- B O(log V)
- C O(V)
- D O(V + E)
- Share this MCQ
Answer:
D
Explanation:
Depth-first search (DFS) is a graph traversal algorithm that explores as far as possible along each branch before backtracking. In the worst case, DFS visits each vertex once and each edge once, resulting in a time complexity proportional to the sum of the number of vertices (V) and the number of edges (E). Therefore, the time complexity of DFS is O(V + E).