next up previous
Next: Up: Previous:

RB Tree Deletion

1.
Find and splice out node.
Traverse up tree from deleted node, subtracting one from size of each node visited.
Time: O(lg n)

2.
Traverse up tree changing colors and performing at most 3 rotations.
Handle rotations same as insertion.
Time: O(lg n)


next up previous
Next: Up: Previous: