| 2-3-4 and red-black Trees |
|
|
|
|
|
|
|
|
|
|
|
|
|
| • | As
you travel down the tree to insert a data |
|||||||||||
| item, |
||||||||||||
| – | if
you encounter a node with 3 pieces of data |
|||||||||||
| you
immediate split the node at that time (just as |
||||||||||||
| we
did with a 2-3 tree...but now we don’t use |
||||||||||||
| the
new data we are trying to insert...because we |
||||||||||||
| haven’t
inserted it yet!) |
||||||||||||
| – | then,
you continue traveling towards a leaf to |
|||||||||||
| insert
the data |
||||||||||||