Deletion From a B-Tree (cont.)
If the node contains the minimum number of entries, consider the two immediate siblings of the node:
If one of these siblings has more than the minimum number of entries, then redistribute one entry from this sibling to the parent node, and one entry from the parent to the deficient node.