Removal ctd.
When a key is removed from a leaf node we must check to see if the number of items in the page is less than n (which would violate the B-tree rules)
This condition is called underflow
To solve we borrow an item from one of the neighbouring pages Q
The usual strategy is to evenly distribute the items on P and Q.
This is called balancing.