Leaf(non-root): [(n+1)/2] pointers [(n+1)/2] - 1 keys
Non-leaf (non-root): [n/2] pointers, [n/2] - 1 keys
Root: 2 pointers, 1 key
No overflow
Insert 60
smaller than 70, go left to 50
greater than 50, go right to 50
found empty space, insert 60 in
Leaf overflow
smaller than 70, go left to 50
larger than 50, go right to 50
No space! Overflow
Allocate a new node and move half of the entries in the overflowing node to the new node
Copy the first key of the new node to parent (insert the value and the pointer to the node to the parent)
non-leaf overflow
Now we need to add a new pointer to the parent, but we don't have space on the parent node
Now we need to split the parent node to add more space
We need to push and move the middle key to its parent
New root