Thinking about B-Trees
B-Tree insertion can cause (expensive) splitting and propagation
B-Tree deletion can cause (cheap) borrowing or (expensive) deletion and propagation
Propagation is rare if M and L are large (Why?)
Repeated insertions and deletion can cause thrashing
If M = L = 128, then a B-Tree of height 4 will store at least 30,000,000 items