 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
| • |
An
increase in the height will occur if every
|
|
|
node
on the path from the root of the tree to the
|
|
|
leaf
where we tried to insert an item contains
|
|
|
two
values.
|
|
|
|
– |
In
this case, the recursive process of splitting a node
|
|
and
moving a value up to the node's parent will
|
|
|
eventually
reach the root.
|
|
|
|
– |
This
means we will need to split the root. You split
|
|
|
the
root into two new nodes and create a new node
|
|
|
that
contains the middle value. This new node is the
|
|
|
new
root of the tree.
|
|