Is it true that in the worst case the DELETE operation in a RED-

Is it true that in the worst case the DELETE operation in a RED-BLACK tree of $$n$$ nodes requires $$\Omega(\log n)$$ rotations in the worst case。 ~@[](1)

答案：FALSE