Computer Sciences > Gate 2020 > AVL Tree

Contributed by: Dr. Sarah Chen

Report Correct Copyright Claim

What is the worst case time complexity of inserting n² elements into an AVL-tree with n elements initially ?

A

Θ(n⁴)

B

Θ(n²)

C

Θ(n²log(n))

D

Θ(n³)

Check Answer

Explanation

Correct : c

Similar Questions

What is the worst-case time complexity of insertion in an AVL tree?

Question #23 Medium

Which operations on a binary search tree have O(h) complexity?

Question #31 Easy

Compare search complexities of sorted array vs balanced BST.

Question #47 Hard

Related Topics

Data Structures Binary Search Tree Time Complexity Algorithm Analysis Tree Algorithms Computer Science