Communications of the ACM,
Vol. 15 No. 11, Pages 997-998
10.1145/355606.361894
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.
The full text of this article is premium content
0 Comments
No entries found
Log in to Read the Full Article
Purchase the Article
Log in
Create a Web Account
If you are an ACM member, Communications subscriber, Digital Library subscriber, or use your institution's subscription, please set up a web account to access premium content and site
features. If you are a SIG member or member of the general public, you may set up a web account to comment on free articles and sign up for email alerts.