Deletion From a B-Tree
If the entry to be deleted is not in a leaf, swap it with its successor (or predecessor) under the natural order of the keys. Then delete the entry from the leaf.
If leaf contains more than the minimum number of entries, then one can be deleted with no further action.