next up previous
Next: RB-Insert(T,x) Up: CSE 2320: Algorithms and Previous: Insertion

RB Trees

If parent node `a' was Black, then no changes are necessary.

If not, then there are three cases to consider for each of the orientations below.


Move up the tree until there are no violations or we are at the root.

Copyright © 1998 The University of Texas at Arlington