Quiz on Red-Black Trees

A red-black tree with $n$ nodes has a height of $n$.

The add(x) and remove(x) operations on a red-black tree run in $O(n)$ worst-case time.

The amortized number of rotations performed during an add(x) or remove(x) operation is constant.

The height of a red-black tree with $n$ nodes is always $2\log(n)$.