📢 Too many exams? Don’t know which one suits you best? Book Your Free Expert 👉 call Now!

  • google app store apple app store
  • ✖

      Question

      Union-Find with path compression achieves nearly

      constant time because its complexity is:
      A O(log n) Correct Answer Incorrect Answer
      B O(√n) Correct Answer Incorrect Answer
      C O(α(n)) (inverse Ackermann) Correct Answer Incorrect Answer
      D O(n log n) Correct Answer Incorrect Answer
      E O(1) strictly Correct Answer Incorrect Answer

      Solution

      Union-Find with path compression and union by rank has amortized complexity α(n), which grows slower than log n.

      Practice Next
      More Data Structure Questions
      ask-question