Q6

MCQ1 mark, −0.33

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})$

Loading…