We propose a framework for studying bottom-up restructuring heuristics
for binary search trees. We identify the key role played by depth-red
ucing rules in obtaining logarithmic amortized cost per access. We sho
w that splaying is by no means the only heuristic that offers logarith
mic amortized cost. (C) 1996 Academic Press, Inc.