| 2-3-4 and red-black Trees |
|
|
|
|
|
|
|
|
|
|
|
|
|
| • | A
2-3-4 tree solves this problem |
|||||||||||
| – | which
allows 4-nodes which are nodes that |
|||||||||||
| have
4 pieces of data and 3 children |
||||||||||||
| – | each
insertion and deletion can have fewer |
|||||||||||
| steps
than are required by a 2-3 tree (when |
||||||||||||
| looking
at the insertions/deletions in isolation) |
||||||||||||
| – | but
does this by using more memory |
|||||||||||
| – | essentially,
each node can have 1,2, or 3 pieces |
|||||||||||
| of
data, and 4 child pointers!!!!! |
||||||||||||