B+ - Tree
B+ - Tree
B+ Tree
• Now, the index node contains 6 children and 5 keys which violates the B+ tree properties, therefore we need to split it.
B+ Tree
Construct B+Tree of order 5:
B+ Tree
Deletion Operation:
Step 1: Delete the key and data from the leaves.
Step 2: if the leaf node contains less than minimum number of elements,
merge
down the node with its sibling and delete the key in between
them.
Step 3: if the index node contains less than minimum number of
elements,
merge the node with the sibling and move down the key in
between them.
Deletion Operation:
Delete the key 200 from the B+ Tree shown in the following figure.
B+ Tree
200 is present in the right sub-tree of 190, after 195. delete it.
Deletion Operation:
Merge the two nodes by using 195, 190, 154 and 129.
B+ Tree
Now, element 120 is the single element present in the node which is violating the B+ Tree properties. Therefore, we need to merge it by using 60, 78, 108 and 120.
Thank you