Deletion From a B-Tree (cont.)
If both immediate siblings have exactly the minimum number of entries, then merge the deficient node with one of the immediate sibling node and one entry from the parent node.
If this leaves the parent node with too few entries, then the process is propagated upward.