On Foster's information storage and retrieval using AVL trees

Authors:
K. C. Tan
Affiliations:
Northwestern Univ., Evanston, IL
Venue:
Communications of the ACM
Year:
1972

Citing 1
Cited 5

Information retrieval: information storage and retrieval using AVL trees

ACM '65 Proceedings of the 1965 20th national conference

A compendium of key search references

ACM SIGIR Forum
Balancing binary trees by internal path reduction

Communications of the ACM
Performance of height-balanced trees

Communications of the ACM
A generalization of AVL trees

Communications of the ACM
On the development of data structures

ACM SIGPLAN Notices

Quantified Score

Hi-index	48.26

Visualization

Abstract

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.