On the average number of rebalancing operations in weight-balanced trees
Open Access
- 31 July 1980
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 11 (3) , 303-320
- https://doi.org/10.1016/0304-3975(80)90018-3
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- On random 2?3 treesActa Informatica, 1978
- Concurrency of operations on B-treesActa Informatica, 1977
- Performance of height-balanced treesCommunications of the ACM, 1976
- Binary Search Trees of Bounded BalanceSIAM Journal on Computing, 1973