Splaying a search tree in preorder takes linear time
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 .
Link to Published Version
Chaudhuri, R., & Höft, H. (1990). Splaying a search tree in preorder takes linear time. International Journal of Mathematics and Mathematical Sciences, 13(1), 186–186. doi:10.1155/S0161171290000254