Is it true that in the worst case a red-black tree deletion requ

Is it true that in the worst case a red-black tree deletion requires $$O(1)$$ node recolorings? ~@[](1)

答案：FALSE