Red-Black tree Rotation, Insertion, Deletion

More documents

Recommendations

Info

Red-Black Insertion Since red-black trees have (lg n) height, if we can preserve all properties of such trees under insertion/deletion, we have a balanced tree! Suppose we just did a regular insertion. conditions does it stay ared-black tree? Under what Since every insertion take places at a leaf, we will change a black NIL pointer to a node with two black NIL pointers. ? To preserve the black height of the tree, the new node must be red. If its new parent is black, we can stop, otherwise we must restructure!
How can we x two reds in a row? It depends upon our uncle's color: grandparent - MUST be black Red R R Assume parent red uncle.. Red new node R If our uncle is red, reversing our relatives' color either solves the problem or pushes it higher! R R
Page 1 and 2: Rotations The basic restructuring s
Page 3 and 4: 7 4 11 x 3 6 9 18 y 2 14 19 12 17 2
Page 5: To get a linear algorithm, wemust b
Page 9 and 10: The Case of the Black Uncle If our
Page 11 and 12: Pseudocode and Figures
Page 13 and 14: Deletion Color Cases Suppose the no
Page 15: Conclusion Red-Black trees let us i

Red-Black tree Rotation, Insertion, Deletion

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?