Assertion: tree's number | /r/HasProperty | o(log n
Facets:
Source sentences:
text: Restoring the red–black properties requires a small number (O(log n) or amortized O(1)) of color changes (which are very quick in practice) and no more than three tree rotations (two for insertion).