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.