Introduction to Algorithms — Red-Black Tree

1. Properties of red-black trees A red-black tree is a binary search tree with one extra bit of storage per node: its color, which can either RED or BLACK. By constraining the node colors on any simple path from the root to a leaf, red-black trees ensure that no such path is more than twice … Continue reading Introduction to Algorithms — Red-Black Tree