2-3-4 and red-black Trees
•
The idea is to represent a node with 2
pieces of data and 3 children as a binary
search tree with
red and black child
pointers
40, 60
70
20
50
70
20
50
40
60
black
red
red
red
