Lower Bounds for Accessing Binary Search Trees with Rotations
- 1 February 1989
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 18 (1) , 56-67
- https://doi.org/10.1137/0218004
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- Sequential access in splay trees takes linear timeCombinatorica, 1985
- Self-adjusting binary search treesJournal of the ACM, 1985
- A note on some tree similarity measuresInformation Processing Letters, 1982
- A dichromatic framework for balanced treesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1978
- Binary Search Trees of Bounded BalanceSIAM Journal on Computing, 1973
- Symmetric binary B-Trees: Data structure and maintenance algorithmsActa Informatica, 1972