2-3 Trees
•Notice, we still insert at a leaf
–but now when we reach the last node in
a path that
node can simply absorb the new data if it has only 1 piece of data in it
–but, what if there are two pieces of
data?
–the process involves finding the middle
data item
between the two in the node and the new item, splitting the node, and pushing
up to the parent the middle data item to be inserted
–this process is very
recursive