Thumbnail
Access Restriction
Subscribed

Editor Crawford, Diane
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Abstract This note proposes an optimization to an algorithm published by T.E. Gerasch in his article “An Insertion Algorithm for a Minimal Internal Path Length Binary Search Tree” (Communications of the ACM, May 1988, pp. 579-585).
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Correspondence
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 34
Issue Number 2
Page Count 4
Starting Page 79
Ending Page 82


Open content in new tab

   Open content in new tab
Source: ACM Digital Library