← Back to Question ListSelect topics to narrow your question pool, then enable Random to jump to a random question matching your filters.
Topics:
Searching a binary search tree costs O(h), where h is the height of the tree. When is h about log n, when is it n, and what makes the difference?