Splaying a search tree in preorder takes linear time
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
Chaudhuri, R., & Höft, H. (1993). Splaying a search tree in preorder takes linear time. ACM SIGACT News, 24(2), 88–93. doi:10.1145/156063.156067