The Internet Archive has a preservation copy of this work in our general collections.
The file type is
A static binary search tree where every search starts from where the previous one ends (lazy finger) is considered. Such a search method is more powerful than that of the classic optimal static trees, where every search starts from the root (root finger), and less powerful than when rotations are allowed---where finding the best rotation based tree is the topic of the dynamic optimality conjecture of Sleator and Tarjan. The runtime of the classic root-finger tree can be expressed in terms ofarXiv:1304.6897v1 fatcat:pnvqojayjzh3ljat3axgnlwebm