 You have now
learn everything you
need to insert a new entry
into a 2,4tree
 Here a summary on what's ahead:
 You will always insert
a new entry into a
leaf node
 If the leaf node has
≤ 2 entries, you insert the new
entry and you are done
Otherwise:
 If you splitted a node
in the previous step,
an entry would have been
inserted into
the parent node !!!
If the parent node has
≤ 2 entries, you insert the new
entry and you are done
Otherwise:
 Split the
parent node !!!

And so on !!!
(Can you smell recursion ???)

