Height balanced 2–3 trees
- 1 September 1979
- journal article
- Published by Springer Nature in Computing
- Vol. 21 (3), 195-211
- https://doi.org/10.1007/bf02253053
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Optimal 2,3-TreesSIAM Journal on Computing, 1979
- Minimal-Comparison $2,3$-TreesSIAM Journal on Computing, 1978
- Right brother treesCommunications of the ACM, 1978
- An optimal method for deletion in one-sided height-balanced treesCommunications of the ACM, 1978
- Deletion in one-sided height balanced search treesInternational Journal of Computer Mathematics, 1978
- An insertion technique for one-sided height-balanced treesCommunications of the ACM, 1976
- A generalization of AVL treesCommunications of the ACM, 1973
- Binary Search Trees of Bounded BalanceSIAM Journal on Computing, 1973
- Organization and maintenance of large ordered indexesActa Informatica, 1972
- Symmetric binary B-Trees: Data structure and maintenance algorithmsActa Informatica, 1972