1. Insertion into a B+ Tree Null Tree Ptr Data Pointer * Tree Node Ptr After Adding 8 and then 5… 85 Insert 1 : causes overflow – add a new level * 5 * 158 *

2. After inserting 7 … 1 * 5 * 58 * 7 Insert 3 : Causes overflow - split ** 3 5 * * * 13 5 7 8

3. Insert 12 : Causes overflow - split propagates, new level * 5 * * 13 12 7 8 ** * 8 * * 3 * 5

4. Insert 9 : Causes overflow - split 0 * 5 * * 13 7 8 * 12 * 89 * * 3 * * 5 * *

5. Insert 6 : Causes overflow – split, propagates * 5 8 * * 13 * 3 * * 9 * * * 7 * * 5 * 67 * 8 * 9 12