First page Back Continue Last page Graphics
All nodes in a Red-Black tree are 2-nodes.
Just like BSTs.
2-nodes are simply represented as they would be in a BST.
3-nodes and 4-nodes are represented by separate 2-nodes (one node for each item) and these nodes are “bound” to each other using “red” links