Splaying a Search Tree in Preorder Takes Linear Time

Abstract

In this paper we prove that if the nodes of an arbitrary n-node binary search tree T are splayed in the preorder sequence of T then the total time is O(n). This is a special case of the splay tree traversal conjecture of Sleator and Tarjan. © 1991, Hindawi Publishing Corporation. All rights reserved.