B-tree and AVL tree have the same worst case time complexity for insertion and deletion.

Category: QuestionsB-tree and AVL tree have the same worst case time complexity for insertion and deletion.
Editor">Editor Staff asked 4 weeks ago

B-tree and AVL tree have the same worst case time complexity for insertion and deletion.
 
(a) True
 
(b) False
 
My question is taken from B-Trees topic in section B-Trees of Data Structures & Algorithms I
 
This question was posed to me at a job interview.

1 Answers
Editor">Editor Staff answered 4 weeks ago

Right answer is (a) True
 
Best explanation: Both the B-tree and the AVL tree have O(log n) as worst case time complexity for insertion and deletion.