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 \(n^2\) elements into an AVL-tree with \(n\) elements initially ?

A.
\(\Theta (n^{4})\)
B.
\(\Theta (n^{2})\)
C.
\(\Theta (n^{2} \ log \ n)\)
D.
\(\Theta (n^{3})\)

Attempted by 809 students.

Show answer

Correct answer: C

The worked solution is available to enrolled students.

Explore the full course: Iocl Engineers Officers Grade A Paper 2