On Foster's information storage and retrieval using AVL trees

1 September 1972

journal article
Published by Association for Computing Machinery (ACM) in Communications of the ACM

Vol. 15 (9), 843
https://doi.org/10.1145/361573.361588

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.

Keywords

FOSTER'S INFORMATION
INFORMATION STORAGE
NOTE
SUM
DEPTH
TREES FOSTER
USING AVL
RETRIEVAL USING

This publication has 1 reference indexed in Scilit:

Information retrieval
Published by Association for Computing Machinery (ACM) ,1965

Cited by 4 articles