J. Ian Munro

Suggest Changes
Learn More
We consider heuristics which attempt to maintain a binary search tree in a near optimal form, assuming that elements are requested with fixed, but unknown, independent probabilities. A "move to root"(More)