doi:10.1145/156063.156067">
 

Title

Splaying a search tree in preorder takes linear time

Document Type

Article

Publication Date

1993

Department/School

Computer Science

Abstract

In this paper we prove that if the nodes of an arbitrary no-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.

Link to Published Version

doi:10.1145/156063.156067