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


    Question

    Fibonacci Heaps support Decrease-Key

    in:
    A O(1) amortized Correct Answer Incorrect Answer
    B O(log n) Correct Answer Incorrect Answer
    C O(n) Correct Answer Incorrect Answer
    D O(log log n) Correct Answer Incorrect Answer
    E O(√n) Correct Answer Incorrect Answer

    Solution

    Fibonacci heaps optimize decrease-key for graph algorithms (like Dijkstra).

    Practice Next
    ask-question