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

Properties of RB Trees

1.
Every node is either or .
2.
Every leaf is .
3.
If a node is Red, then both its children are .
4.
Every path from some node to a leaf contains the of Black nodes.



\psfig{figure=figures/f6-14.ps,width=3.5in,height=2.5in}



Copyright © 1998 The University of Texas at Arlington