Red-Black Trees
Red-Black Trees
One of many search-tree schemes that are 'balanced' in order to guarantee that basic dynamic-set operations take O(lg n ) time in the worse case.
Following are some of the areas in Red-Black Trees in which we provide help:
Definition: a binary tree, satisfying
