next up previous
Next: Properties of RB Trees Up: CSE 2320: Algorithms and Previous: CSE 2320: Algorithms and

Red-Black Trees

Binary Search Tree operations are not

If we can keep the tree balanced, the operations will be

This is the goal of Red-Black trees.

By constraining colors of nodes along paths from root to leaf, RB trees ensure no path is more than twice as long as any other (the tree is balanced).



Copyright © 1998 The University of Texas at Arlington