B sharp tree
From Wikipedia, the free encyclopedia
- The correct title of this article is B# tree. The substitution or omission of a # sign is because of technical restrictions.
A B# tree is similar to a B+ tree with rotations allowed among brothers only (immediate siblings).
Insertion Procedure:
Find the node where the new key is to be inserted. If that node is full we must try to perform a rotation with one of our brothers. If all of our brothers are at capacity we must split the node as we do in a B+ Tree.
