Next:
Properties of RB Trees
Up:
CSE 2320: Algorithms and
Previous:
Red-Black Trees
Properties of RB Trees
1.
Every node is either
?
Red
or
?
Black
.
2.
Every leaf is
?
Black
.
3.
If a node is Red, then both its children are
?
Black
.
4.
Every path from some node to a leaf contains the
?
same number
of Black nodes.
Copyright © 1998 The University of Texas at Arlington