B-tree and AVL tree have the same worst case time complexity for insertion and deletion. a) True b) False
Answer: a Explanation: Both the B-tree and the AVL tree have O(log n) as worst case time complexity for insertion and deletion.