A new class of balanced search trees : half-balanced binary search tress
Open Access
- 1 January 1982
- journal article
- Published by EDP Sciences in RAIRO. Informatique théorique
- Vol. 16 (1) , 51-71
- https://doi.org/10.1051/ita/1982160100511
Abstract
No abstract availableThis publication has 4 references indexed in Scilit:
- Mittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten BäumenPublished by Springer Nature ,1979
- Performance of height-balanced treesCommunications of the ACM, 1976
- Binary Search Trees of Bounded BalanceSIAM Journal on Computing, 1973
- Symmetric binary B-Trees: Data structure and maintenance algorithmsActa Informatica, 1972