A comment on optimal tree structures

Authors:
Larry E. Stanfel
Affiliations:
Colorado State Univ., Fort Colins
Venue:
Communications of the ACM
Year:
1969

Citing 0
Cited 4

Tree Structures for Optimal Searching

Journal of the ACM (JACM)
Practical Aspects of Doubly Chained Trees for Retrieval

Journal of the ACM (JACM)
A comment on the double-chained tree

Communications of the ACM
A note on optimal doubly-chained trees

Communications of the ACM

Quantified Score

Hi-index	48.25

Visualization

Abstract

In Y.N. Patt's paper “Variable Length Tree Structures Having Minimum Average Search Time” [Comm. ACM 12 (Feb. 1969)], the tree structures obtained are not actually optimal with respect to the two-dimensional chaining devised by Sussenguth in his 1963 paper. This note points out that the result can be described as “optimal” only under the constraint—which Patt implicity assumes—that no key be allowed to prefix another.