What is the time complexity of inserting an element into an AVL tree in the worst case?
A. O(1)
B. O(log n)
C. O(n)
D. O(n log n)
Answer: Option B
This Question Belongs to Data Structure >> Trees In Data Structures
Related Questions on Trees in Data Structures
A. Inorder
B. Preorder
C. Postorder
D. Level-order
Join The Discussion