[next] [prev] [prev-tail] [tail] [up]
Most binary search trees, assuming the arrival of values is random, are somewhere between the best and the worst case.
[next] [prev] [prev-tail] [front] [up]