AVL trees provide better insertion the 2-3 trees.
Question is from B-Trees in division B-Trees of Data Structures & Algorithms I
The question was posed to me in a job interview.
Correct answer is (b) False
Easiest explanation – Insertion in AVL tree and 2-3 tree requires searching for proper position for insertion and transformations for balancing the tree. In both, the trees searching takes O(log n) time, but rebalancing in AVL tree takes O(log n), while the 2-3 tree takes O(1). So, 2-3 tree provides better insertions.