•The left node gets the smallest value
and the right node gets the largest value.
•The middle value is moved up to the
leaf's parent.
•The new left and right nodes are now
made children
of the parent.
•If the parent only had 1 data value to
begin with,
we are done.
