Red-Black Trees

Home > Computer Science > Algorithms and data structures > Trees > Red-Black Trees

A self-balancing binary search tree data structure where each node is either red or black and the root node is always black.