# Quiz on Red-Black Trees

Test yourself on what you've learned about red-black trees.

1

What is a property of red-black trees?

A)

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

B)

The `add(x)`

and `remove(x)`

operations on a red-black tree run in $O(n)$ worst-case time.

C)

The amortized number of rotations performed during an `add(x)`

or `remove(x)`

operation is constant.

D)

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

Question 1 of 40 attempted

Create a free account to access the full course.

By signing up, you agree to Educative's Terms of Service and Privacy Policy