Big O notation
It requires maximally a small number, formula_1 in Big O notation, or on average an amortised constant number of color changes (which are very quick in practice); and no more than three tree rotations (two for insertion). Although insert and delete operations are complicated, their times remain formula_1, where formula_2 is the number of objects in the tree.