0 votes 0 votes Why B or B+ tree is prefer for database indexing rather than AVL tree ???? Databases databases database-normalization rdbms + – air1ankit asked Oct 28, 2017 air1ankit 357 views answer comment Share Follow See 1 comment See all 1 1 comment reply Tesla! commented Oct 29, 2017 reply Follow Share 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 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes For searching perspective...its good. Because it is multilevel indexing O(N2/M) which is less than O(NlogN) Nau1994 answered Oct 30, 2017 Nau1994 comment Share Follow See all 0 reply Please log in or register to add a comment.