doi:10.1155/S0161171290000254">
 

Title

Splaying a search tree in preorder takes linear time

Document Type

Article

Publication Date

1990

Department/School

Computer Science

Abstract

In this paper we prove that if the nodes of an arbitrary n-node binary search tree T are splayed according to the preorder sequence of T then the total time is O(n)J. This is a special case of the splay tree traversal conjecture of Sleator and Tarjan [1].

Link to Published Version

doi:10.1155/S0161171290000254