On Foster's information storage and retrieval using AVL trees

By K. C. Tan

Communications of the ACM, Vol. 15 No. 9, Page 843
10.1145/361573.361588

Foster [2] has proposed a method of constructing an AVL tree with depth (height) h and the number of items N being fixed and with the weighted sum of the items a maximum. The purpose of this note is to show that this method does not work in general.

The full text of this article is premium content

0 Comments

No entries found

Purchase the Article

On Foster's information storage and retrieval using AVL trees

The full text of this article is premium content

0 Comments

Forgot your password?

Need Access?

Join the ACM

Subscribe to Communications of the ACM Magazine