Skip to content
UPEEC

Red-Black Trees

Self-balancing BSTs with node colours and rules ensuring height ≤ $2\log_2(n+1)$.

Advanced
Comments 0

Used inside std::map, Java TreeMap and the Linux scheduler.

Spotted a mistake or want to add detail? Suggest an improvement — Content Contributors' edits are reviewed by editors before they go live.

Discussion (0)

Sign in or join free to ask questions and discuss this topic.