Binary Search Trees and File Organization
- 1 September 1974
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 6 (3) , 195-207
- https://doi.org/10.1145/356631.356634
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- A generalization of AVL treesCommunications of the ACM, 1973
- Upper Bounds for the Total Path Length of Binary TreesJournal of the ACM, 1973
- Optimum binary search treesActa Informatica, 1971
- On file structuring for non-uniform access frequenciesBIT Numerical Mathematics, 1970
- File Organization: On the Selection of Random Access Index Points for Sequential FilesJournal of the ACM, 1969
- Scatter storage techniquesCommunications of the ACM, 1968
- Some Combinatorial Properties of Certain Trees With Applications to Searching and SortingJournal of the ACM, 1962
- Algorithm 63: partitionCommunications of the ACM, 1961
- Trie memoryCommunications of the ACM, 1960
- A Method for the Construction of Minimum-Redundancy CodesProceedings of the IRE, 1952