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!
|
| _version_ | 1832555338708025344 |
|---|---|
| author | R. Chaudhuri H. Höft |
| author_facet | R. Chaudhuri H. Höft |
| author_sort | R. Chaudhuri |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-569dd93c41bc44a0a28aac9ab5e0f45c |
| institution | Kabale University |
| issn | 0161-1712 1687-0425 |
| language | English |
| publishDate | 1991-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | International Journal of Mathematics and Mathematical Sciences |
| spelling | doaj-art-569dd93c41bc44a0a28aac9ab5e0f45c2025-02-03T05:48:25ZengWileyInternational Journal of Mathematics and Mathematical Sciences0161-17121687-04251991-01-0114354555110.1155/S0161171291000741Splaying a search tree in preorder takes linear timeR. Chaudhuri0H. Höft1Department of Computer Science, Eastern Michigan University, Ypsilanti 48197, Michigan, USADepartment of Computer Science, Eastern Michigan University, Ypsilanti 48197, Michigan, USAIn 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.http://dx.doi.org/10.1155/S0161171291000741binary search treepreorder traversalrotationsplay. |
| spellingShingle | R. Chaudhuri H. Höft Splaying a search tree in preorder takes linear time International Journal of Mathematics and Mathematical Sciences binary search tree preorder traversal rotation splay. |
| title | Splaying a search tree in preorder takes linear time |
| title_full | Splaying a search tree in preorder takes linear time |
| title_fullStr | Splaying a search tree in preorder takes linear time |
| title_full_unstemmed | Splaying a search tree in preorder takes linear time |
| title_short | Splaying a search tree in preorder takes linear time |
| title_sort | splaying a search tree in preorder takes linear time |
| topic | binary search tree preorder traversal rotation splay. |
| url | http://dx.doi.org/10.1155/S0161171291000741 |
| work_keys_str_mv | AT rchaudhuri splayingasearchtreeinpreordertakeslineartime AT hhoft splayingasearchtreeinpreordertakeslineartime |