Splaying a search tree in preorder takes linear time.
International Journal of Mathematics and Mathematical Sciences (1991)
- Volume: 14, Issue: 3, page 545-552
- ISSN: 0161-1712
Access Full Article
top
How to cite
topChaudhuri, R., and Höft, H.. "Splaying a search tree in preorder takes linear time.." International Journal of Mathematics and Mathematical Sciences 14.3 (1991): 545-552. <http://eudml.org/doc/46655>.
@article{Chaudhuri1991,
author = {Chaudhuri, R., Höft, H.},
journal = {International Journal of Mathematics and Mathematical Sciences},
keywords = {binary search tree; splay; preorder traversal; rotation},
language = {eng},
number = {3},
pages = {545-552},
publisher = {Hindawi Publishing Corporation, New York},
title = {Splaying a search tree in preorder takes linear time.},
url = {http://eudml.org/doc/46655},
volume = {14},
year = {1991},
}
TY - JOUR
AU - Chaudhuri, R.
AU - Höft, H.
TI - Splaying a search tree in preorder takes linear time.
JO - International Journal of Mathematics and Mathematical Sciences
PY - 1991
PB - Hindawi Publishing Corporation, New York
VL - 14
IS - 3
SP - 545
EP - 552
LA - eng
KW - binary search tree; splay; preorder traversal; rotation
UR - http://eudml.org/doc/46655
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.