+1 vote
in Data Structures & Algorithms I by (110k points)
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 Answer

+1 vote
by (672k points)
selected by
 
Best answer
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.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.

Categories

...