Lower bounds for accessing binary search trees with rotations (1989)

by Robert Wilber
Venue:SIAM Journal on Computing