Research notes | Open Access
Splaying a search tree in preorder takes linear time
In this paper we prove that if the nodes of an arbitrary -node binary search tree are splayed according to the preorder sequence of then the total time is . This is a special case of the splay tree traversal conjecture of Sleator and Tarjan .
Copyright © 1990 Hindawi Publishing Corporation. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.