Insertion to a B-Tree
Step-by-step illustration of B-Tree insertion.
Reference
B-tree - Wikipedia
Contributors to Wikimedia projects
Insertion
Simple Example
If a node exceeds its max number of items (it is 3 in our case,) split it into halves and push the median key-value pair to the parent node.
Complex Example
If the parent is also full, repeat the split operation.
