Improving time and space efficiency in generalized binary search trees
- 1 September 1987
- journal article
- Published by Springer Nature in Acta Informatica
- Vol. 24 (5) , 583-594
- https://doi.org/10.1007/bf00263296
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- The analysis of a fringe heuristic for binary search treesJournal of Algorithms, 1985
- Balancing binary trees by internal path reductionCommunications of the ACM, 1983
- Storage utilization in B *-trees with a generalized overflow techniqueActa Informatica, 1983
- The theory of fringe analysis and its application to 23 trees and b-treesInformation and Control, 1982
- On random 2?3 treesActa Informatica, 1978
- Locally balanced binary treesThe Computer Journal, 1976
- Multidimensional binary search trees used for associative searchingCommunications of the ACM, 1975
- Binary Search Trees of Bounded BalanceSIAM Journal on Computing, 1973