Splaying a search tree in preorder takes linear time

Authors:
R. Chaudhuri;H. Höft
Affiliations:
-;-
Venue:
ACM SIGACT News
Year:
1993

Citing 3
Cited 1

Data structures and network algorithms

Data structures and network algorithms
Self-adjusting binary search trees

Journal of the ACM (JACM)
Sequential access in splay trees takes linear time

Combinatorica

Randomized splay trees: theoretical and experimental results

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.