Balance is preserved by painting each node of the tree with one of two colors in a WAY that satisfies certain properties, which collectively constrain how unbalanced the tree can become in the WORST case. When the tree is modified, the new tree is subsequently rearranged and repainted to restore the coloring properties. The properties are designed in such a way that this rearranging and recoloring can be performed efficiently.
The balancing of the tree is not PERFECT, but it is good ENOUGH to allow it to guarantee searching in O(log n)time, where n is the total number of elements in the tree. The insertion and deletion operations, along with the tree rearrangement and recoloring, are also performed in O(log n) time.[3]
Tracking the color of each node requires only 1 bit of information per node because there are only two colors. The tree does not CONTAIN any other data specific to its being a red–black tree so its memory footprint is almost identical to a classic (uncolored) binary search tree. In many cases, the additional bit of information can be stored at no additional memory cost.