Howdy, Stranger!

It looks like you're new here. If you want to get involved, click one of these buttons!


Welcome to the new platform of Programmer's Heaven! We apologize for the inconvenience caused, if you visited us from a broken link of the previous version. The main reason to move to a new platform is to provide more effective and collaborative experience to you all. Please feel free to experience the new platform and use its exciting features. Contact us for any issue that you need to get clarified. We are more than happy to help you.

i don't think there is any reason for b minus tree to exist

[size=4]first,when data is too large,we can built muti-level index using b plus tree.
when data is not so large,we can use AVL tree.
when we use b minus tree, if the tree node is constitute by array ,then it's slow when insert one element than AVL tree,
and if the node is listing,then it's slow when looking up the element than AVL tree.
So my question is : is any use of b minus tree?
thanks a lot[/size]
Sign In or Register to comment.