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

    âš¡ Month End Offer - Flat 52% Off On All Courses! Enroll Now âš¡
    00:00:00 AM Left

    Question

    Union-Find with Path Compression achieves

    nearly:
    A O(1) per operation Correct Answer Incorrect Answer
    B O(log n) Correct Answer Incorrect Answer
    C O(n) Correct Answer Incorrect Answer
    D O(√n) Correct Answer Incorrect Answer
    E O(log log n) Correct Answer Incorrect Answer

    Solution

    Amortized time per operation ~ O(α(n)), almost constant.

    Practice Next
    More Data Structure Questions
    ask-question