判断题：In the worst case the DELETE operation in a RED-BLACK tree of $$

In the worst case the DELETE operation in a RED-BLACK tree of $$n$$ nodes requires $$\Omega (\log n)$$ rotations.

答案：FALSE