| 2-3-4 and red-black Trees |
|
|
|
|
|
|
|
|
|
|
|
|
| • | A
red-black tree is a BST representation of |
||||||||||
| a
2-3-4 tree with 2 extra fields in the node |
|||||||||||
| to
represent whether the connection is |
|||||||||||
| within
the current node or a child |
|||||||||||
| – | it
retains the advantages of a 2-3-4 tree |
||||||||||
| without
the storage overhead! |
|||||||||||
| – | with
all of the benefits of a binary search tree |
||||||||||
| and
none of the drawbacks! |
|||||||||||