Unformatted text preview: with red. RB-INSERT then calls RB-INSERT-FIXUP, which explores three different cases. In each case of them, it colors at least one node with red color. Therefore, if n>1 the red-black tree will have at least one red node....
View Full Document
This note was uploaded on 11/09/2010 for the course CS 11841 taught by Professor Dr.ayman during the Spring '09 term at Alexandria University.
- Spring '09