next up previous
Next: Sortof BST Delete Up: CSE 2320: Algorithms and Previous: Pseudocode

Deletion

1.
Delete node from tree using an algorithm similar to BST Delete(T,x)
2.
Fix violated properties



Which properties might be violated?

To correct the violations, look at the violation from another perspective:

Assume the child of the deleted node is colored ``double-Black'', violating property 1, and we want to give half of the ``double-Black'' to another Red node or push half of the Black out the top of the tree.



Copyright © 1998 The University of Texas at Arlington