Nearly optimal heuristics for binary search trees with geometric generalizations

Extended abstract
  • Christos Levcopoulos
  • Andrzej Lingas
  • Jörg-R. Sack
Algorithms And Complexity
Part of the Lecture Notes in Computer Science book series (LNCS, volume 267)


Heuristics for optimal binary search trees with zero key access probabilities (with applications eg. in code theory and in point location) are considered. It is shown that for an arbitrarily small positive constant ∈, there exists a linear-time heuristic for such search trees, producing solutions within the factor of 1+∈ from the optimum. Also, by using an interesting amortization argument, we give a simple and practical, linear-time implementation of a known greedy heuristic for such trees. The above results are obtained in a more general setting, namely in the context of minimum length triangulations of so-called semi-circular polygons. They are carried over to binary search trees by proving a duality between minimum weight partitions of infinitely-flat semi-circular polygons into m-gons and optimal (m−1)-way search trees. Our results can be extended to the case with non-zero key access probabilities, and to multi-way search trees.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [HT71]
    T.C. Hu and A.C. Tucker, Optimal Computer Search Trees and Variable-Length Alpha-betical Codes, SIAM J. Applied Math. 21, pp. 514–532.Google Scholar
  2. [GW77]
    A.M. Garsia and M.L. Wachs, A new algorithm for minimum cost binary trees, SICOMP 4, 622–642.Google Scholar
  3. [Gi79]
    P.D. Gilbert, New Results in Planar Triangulations, M.S. Thesis, Coordinated Science Laboratory, University of Illinois, Urbana, Illinois.Google Scholar
  4. [Go81]
    L. Gotlieb, Optimal Multi-way Search Trees, SIAM J. Comput. vol. 10, No. 3Google Scholar
  5. [Kl80]
    G.T. Klincsek, Minimal triangulations of polygonal domains, Ann. Discrete Math., vol. 9, pp. 121–123.Google Scholar
  6. [Kn73]
    D.E. Knuth, The Art of Computer Programming 3: Sorting and Searching, Addison-Wesley, Reading Massachusetts.Google Scholar
  7. [Le86]
    C. Levcopoulos, New Results about the Approximation Behavior of the Greedy Triangulation, Linköping Studies in Science and Technology, Thesis No 74.Google Scholar
  8. [Le87]
    C. Levcopoulos, New Heuristics for Constructing Optimal Search Trees (in preparation).Google Scholar
  9. [Li86]
    A. Lingas, The Greedy Triangulation Heuristic for Minimum Weight Triangulation of Convex Polygons Approximates the Optimum, research report, LITH-IDA-R86-11, Linköping University.Google Scholar
  10. [LL86]
    C. Levcopoulos and A. Lingas, On Approximation Behavior of the Greedy Triangulation for Convex Polygons, to appear in Algorithmica.Google Scholar
  11. [LLS87a]
    C. Levcopoulos, A. Lingas and J. Sack, Nearly Optimal Heuristics for Binary Search Trees and their Geometric Generalizations, technical report, Linköping University, 1987.Google Scholar
  12. [LLS87b]
    A. Lingas, C. Levcopoulos and J. Sack, Optimal Algorithms for Minimum Length Partitions of Polygons, submitted to BIT.Google Scholar
  13. [LP78]
    D.T. Lee and F.P. Preparata, The all nearest neighbor problem for convex polygons, Information Processing Letters, vol. 7, no. 4, pp. 189–192.Google Scholar
  14. [Me84]
    K. Mehlhorn, Data Structures and Algorithms 1: Sorting and Searching, Spring. Verlag, Heidelberg.Google Scholar
  15. [PS85]
    F.P. Preparata and M.I. Shamos, Computational Geometry, An Introduction, Texts and Monographs in Computer Science, Spring. Verlag, New York.Google Scholar
  16. [STT86]
    D.D. Sleator, R.E. Tarjan and W.P. Thurston, Rotation Distance, Triangulations, and Hyperbolic Geometry, Proc. of the 18th ACM Symposium on Theory of Computing, Berkley, California.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Christos Levcopoulos
    • 1
  • Andrzej Lingas
    • 1
  • Jörg-R. Sack
    • 2
  1. 1.Department of Computer and Information ScienceLinköping UniversityLinköpingSweden
  2. 2.School of Computer ScienceCarleton UniversityOttawaCanada

Personalised recommendations