# Quiz on Random Binary Search Trees

Test yourself on what you've learned about random binary search trees.

1

Which statement is *true* about random binary search trees of size `n`

?

A)

A random binary search tree is always perfectly balanced.

B)

A random binary search tree is more likely to be unbalanced than balanced.

C)

The probability of obtaining any particular permutation of $0$ to $n-1$ is $1/n!$.

D)

The harmonic number $H_{k}$ is closely related to the natural logarithm of $k$.

Question 1 of 30 attempted

Create a free account to access the full course.

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