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 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.
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
1991-01-01
|
| Series: | International Journal of Mathematics and Mathematical Sciences |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1155/S0161171291000741 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | In this paper we prove that if the nodes of an arbitrary n-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. |
|---|---|
| ISSN: | 0161-1712 1687-0425 |