Tree Structures for Optimal Searching
Journal of the ACM (JACM)
A comment on the double-chained tree
Communications of the ACM
Variable length tree structures having minimum average search time
Communications of the ACM
A comment on optimal tree structures
Communications of the ACM
Use of tree structures for processing files
Communications of the ACM
A compendium of key search references
ACM SIGIR Forum
Hi-index | 48.22 |
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 standard assumption that no key is allowed to prefix another, as found, for example, in Patt [6]. He states that for the weights and elements of Figure 1, the optimum doubly-chained tree with all nodes reachable in less than five steps is the one shown in Figure 2. This tree is obtained from the optimal binary tree constructed in Hu and Tan [3], using the technique found in Knuth [5]. But the doubly-chained tree constructed by this method comes from an artificially restricted class of doubly-chained trees, and is thus not optimal in the sense usually defined in the literature [6-9] and described below. This fact is recognized by Hu [1], but was not explicitly stated in the paper in question.