Computing Applications

Technical correspondence


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).

View this article in the ACM Digital Library.

Join the Discussion (0)

Become a Member or Sign In to Post a Comment

The Latest from CACM

Shape the Future of Computing

ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.

Get Involved

Communications of the ACM (CACM) is now a fully Open Access publication.

By opening CACM to the world, we hope to increase engagement among the broader computer science community and encourage non-members to discover the rich resources ACM has to offer.

Learn More