Thumbnail
Access Restriction
Subscribed

Author Tan, K. C.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Search trees ♦ Binary trees ♦ Information retrieval ♦ Information storage
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.
Description Affiliation: Northwestern Univ., Evanston, IL (Tan, K. C.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 15
Issue Number 9


Open content in new tab

   Open content in new tab
Source: ACM Digital Library