Left-leaning red–black tree

A left-leaning red–black (LLRB) tree is a type of self-balancing binary search tree, introduced by Robert Sedgewick. It is a variant of the red–black tree and guarantees the same asymptotic complexity for operations, but is designed to be easier to implement.

Source: Wikipedia — Left-leaning red–black tree (CC BY-SA 4.0)