Splaying a search tree in preorder takes linear time

@inproceedings{Chaudhuri1993SplayingAS,
  title={Splaying a search tree in preorder takes linear time},
  author={Ranjan Chaudhuri and Hartmut H246ft},
  booktitle={SIGA},
  year={1993}
}
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. 

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper

Similar Papers

Loading similar papers…