2-3-4 and red-black Trees
•
What this means is that the tree cannot
contain all nodes with 3 pieces of data.
Impossible.
•
In fact, on insert, once you insert data at a
leaf it is guaranteed that the leaf’s parent
will
not
have 3 pieces of data...
–
because if it did, it would have split on the way
to find the leaf!
