Deletion
If the item to be deleted is on a leaf page the removal algorithm is straightforward
If the item to be deleted is not on a leaf page, it must be replaced by one of the two lexicographically adjacent items, which happen to be leaf pages and can easily be deleted
- to find the adjacent items we descend along the rightmost pointers down to the leaf page P and replace the item to be deleted by the rightmost element of that leaf page