Quiz on Red-Black Trees

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


What is a property of red-black trees?


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


The add(x) and remove(x) operations on a red-black tree run in O(n)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 nn nodes is always 2log(n)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