2-3-4 and red-black Trees
•And, we represent a node with 3 pieces of data and 4 children as a binary search tree with red and black child pointers
40,60,80
70
20
50
90
40
50
60
80
black
red
black
red
90
20
red
70