http://worldcat.org/entity/work/id/144085848

A lower bound framework for binary search trees with rotations

Abstract: "This paper considers the problem of bounding below the cost of accessing a sequence of keys in a binary search tree. We develop a lower bound framework for this problem that applies to any binary search tree algorithm, including self-adjusting and offline ones. This new framework can be used to derive two previously known lower bounds."

Open All Close All