Fundamentals of Red-Black Trees

Red-black trees and 2-4 trees

At first, it might seem surprising that a red-black tree can be efficiently updated to maintain the black-height and no-red-edge properties, and it seems unusual to even consider these as useful properties. However, red-black trees were designed to be an efficient simulation of $2$–$4$ trees as binary trees.

Refer to the figure below.