T. C. Hu
Abstract
In 1963, Sussenguth [8] suggested that a file should be organized as a double-chained tree for searching and updating. Patt [5] then obtained the optimum double-chained tree under the assumption that no key may prefix another and that all terminal nodes (items of information) have equal probabilities of being searched. Stanfel [6, 7] explored the relation between the double-chained tree and variable length code [3] and solved a special integer programming problem which corresponds to the case of equal probabilities of terminal nodes and a finite set of available symbols for keys with different costs.
- 1 Hu, T. C. and Tan, K. C. Path length of binary search trees. Rep. 1111, Mathematics Res. Ct., U. of Wisc., Mar. 1971.Google Scholar
- 2 Hu, T. C. and Tucker, A. C. Optimum binary search trees. Rep. 1049, Mathematics Res. Ctr., U. of Wisc., Mar. 1970.Google Scholar
- 3 Karp, R. M. Minimum redundancy coding for the discrete, noiseless channel. IRE Trans. IT-7 (1961), 27-35.Google Scholar
- 4 Knuth, D. E. Fundamental Algorithms. Addison-Wesley, Reading, Mass., 1968, p. 333.Google Scholar
- 5 Patt, Y. Variable length tree structures having minimum average search time. Comm. ACM 12, 2 (Feb. 1969), 72-76. Google ScholarDigital Library
- 6 Stanfel, L. E. Tree structures for optimal seaching. J. ACM 17, 3 (July 1970), 508-517. Google ScholarDigital Library
- 7 Stanfel, L. E. A comment on optimum tree structures. Comm. ACM 12, 10 (Oct. 1969), 582. Google ScholarDigital Library
- 8 Sussenguth, E. H., Jr. Use of tree structures for processing files. Comm. ACM 6, 5 (May 1963), pp. 272-279. Google ScholarDigital Library
Index Terms
- A comment on the double-chained tree
Recommendations
A note on optimal doubly-chained trees
This note concerns the recent paper by Hu [2] dealing with doubly-chained trees of the type introduced by Sussenguth [9]. In the second part of the paper, Hu deals with the problem of constructing an optimum weighted doubly-chained tree, under the ...
The suffix binary search tree and suffix AVL tree
Suffix trees and suffix arrays are classical data structures that are used to represent the set of suffixes of a given string, and thereby facilitate the efficient solution of various string processing problems--in particular on-line string searching. ...
The height of a random binary search tree
Let Hn be the height of a random binary search tree on n nodes. We show that there exist constants α = 4.311… and β = 1.953… such that E(Hn) = αln n − βln ln n + O(1), We also show that Var(Hn) = O(1).
Comments