Left Leaning Red-Black Tree

A left leaning Red Black Tree is a variant of a Red Black Tree designed to be more simple to implement than the normal variant.

All operations are $O(\log n)$ time

It accomplishes this by enforcing an additional property:

• If a node has only one red child it must be the left child