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).
Publisher
Association for Computing Machinery (ACM)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献