Slide 11

We could then treat a Red-Black tree exactly like a 2-3-4 tree. We can tell if a node is really a 4-node by checking if both its left and right children are colored red.
A node is a 3-node if its not a 4-node and has one red child.

We could then treat a Red-Black tree exactly like a 2-3-4 tree. We can tell if a node is really a 4-node by checking if both its left and right children are colored red.