Deletion: B-Tree-Delete(x, k)
Search down tree for node containing k
When B-Tree-Delete is called recursively, the number of keys in x must be at least the minimum degree t (the root can have < t keys)
If x is a leaf, just remove key k and still have at least t-1 keys in x
If there are not
t keys in x, then borrow keys from other nodes.