Dynamic Programming21 sections · 916 units
Open in Course

Quiz: Rerooting Complexity

Understanding the efficiency

Check Your Understanding

In rerooting technique, what is the total time complexity for computing DP values for all nodes as root?

  1. A.O(n)
  2. B.O(n log n)
  3. C.O(n^2)
  4. D.O(n^3)
Start the roadmap to answer the quizzes and solve the challenges