What is the worst case time complexity of inserting \(n^2\) elements into an…

GATE · 2020 · CS · Computer Science & IT

What is the worst case time complexity of inserting n2n^2 elements into an AVL-tree with nn elements initially ?

  1. A.

    Θ(n4)\Theta (n^{4})

  2. B.

    Θ(n2)\Theta (n^{2})

  3. C.

    Θ(n2 log n)\Theta (n^{2} \ log \ n)

  4. D.

    Θ(n3)\Theta (n^{3})

Attempted by 872 students.

Sign up free to check your answer

Sign up free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…