Splaying a search tree in preorder takes linear time

R. Chaudhuri and H. Höft

International Journal of Mathematics and Mathematical Sciences, 1990, vol. 13, 1-1

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 ) . This is a special case of the splay tree traversal conjecture of Sleator and Tarjan [1].

Date: 1990
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/13/253593.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/13/253593.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:253593

DOI: 10.1155/S0161171290000254

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().