Database doubt

Question

Why B or B+ tree is prefer for database indexing rather than AVL tree ????

Comments

for simple reason in AVL tree a node can have at most 2 child while B and B+ don't have any such restriction so if one node can more then 2 child then B and B+ will result in smaller tree than corresponding AVL tree

Answer 1

For searching perspective...its good.

Because it is multilevel indexing O(N2/M) which is less than O(NlogN)