A Partial Analysis of Height-Balanced Trees under Random Insertions and Deletions
- 1 November 1982
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 11 (4) , 748-760
- https://doi.org/10.1137/0211061
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Design and Analysis of a Data Structure for Representing Sorted ListsSIAM Journal on Computing, 1980
- On the average number of rebalancing operations in weight-balanced treesTheoretical Computer Science, 1980
- Sequence of operations analysis for dynamic data structuresJournal of Algorithms, 1980
- Some observations on random 2–3 treesInformation Processing Letters, 1979
- A Partial Analysis of Random Height-Balanced TreesSIAM Journal on Computing, 1979
- A trivial algorithm whose analysis isn'tJournal of Computer and System Sciences, 1978
- On random 2?3 treesActa Informatica, 1978
- Deletions That Preserve RandomnessIEEE Transactions on Software Engineering, 1977
- Binary Search Trees of Bounded BalanceSIAM Journal on Computing, 1973
- Organization and maintenance of large ordered indexesActa Informatica, 1972