Which of the following is true about the height of a Red-Black tree?
-
It can be at most twice the height of an AVL tree.
-
It is always equal to the height of a binary search tree.
-
It is always less than or equal to log(n).
-
It can be greater than the height of an AVL tree.
