Splaying a search tree in preorder takes linear time.
Chaudhuri, R. ; Höft, H.
International Journal of Mathematics and Mathematical Sciences, Tome 14 (1991), p. 545-552 / Harvested from The Electronic Library of Mathematics
Access to full text
Full (PDF)
Publié le : 1991-01-01
DOI : https://doi.org/10.1155/S0161171291000741
EUDML-ID : urn:eudml:doc:46655 
@article{00022394,
     title = {Splaying a search tree in preorder takes linear time.},
     journal = {International Journal of Mathematics and Mathematical Sciences},
     volume = {14},
     year = {1991},
     pages = {545-552},
     doi = {10.1155/S0161171291000741},
     zbl = {0738.68020},
     language = {en},
     url = {http://dml.mathdoc.fr/item/00022394}
}

Chaudhuri, R.; Höft, H. Splaying a search tree in preorder takes linear time.. International Journal of Mathematics and Mathematical Sciences, Tome 14 (1991) pp. 545-552. doi : 10.1155/S0161171291000741. http://gdmltest.u-ga.fr/item/00022394/