Question

    What is the worst-case time complexity of inserting

    n2 elements into an AVL tree with n elements initially?
    A Θ(n4) Correct Answer Incorrect Answer
    B Θ(n2) Correct Answer Incorrect Answer
    C Θ(n2 log n) Correct Answer Incorrect Answer
    D Θ(n3) Correct Answer Incorrect Answer

    Solution

    The correct answer is C

    Practice Next

    Relevant for Exams: