Advertisement

(Un)expected path lengths of asymmetric binary search trees

  • Uwe Trier
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 668)

Abstract

The average path length over the family of binary search trees with 2r+1 nodes, built from randomly choosen permutations of r distinct keys, is O(rlog(r)). On the other hand, if the probability that the r keys are already sorted, tends towards 1, the resulting family of binary search trees degenerates, until it consists of the single linear list — tree with a worst case path length of r(r + 1).

Subject of the paper is the gap between the orders of growth of the expected path lengths of these two models. We systematically deform the probability model of binary search trees using three different kinds of deformers which are controlled by a real constant c and, using singularity analysis, we obtain the surprising result, that under two deformations the expected path length of a tree of size 2r + 1 is either O(r log(r)) or O(r 2).The same result is valid under the third deformation for special values of c.

Keyword

Algorithms and Data Structures 

References

  1. [1]
    Abramowitz, M., Stegun, I.A.: Handbook of Mathematical Functions. New York: Dover Publications, (1970)Google Scholar
  2. [2]
    Casas, R., Díaz, J., Martínez, C.: Average-case Analysis on Simple Families of Trees Using a Balanced Probability Model. Series Formelles Et Combinatoire Algebrique, Actes de Colloque, 133–143, Bordeaux, (2.–4. Mai 1991)Google Scholar
  3. [3]
    Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete Mathematics. Addison-Wesley, Reading, Mass., (1988)Google Scholar
  4. [4]
    Henrici, P.: Applied and Computational Complex Analysis, Vol. 2. Wiley Interscience, New York, (1977)Google Scholar
  5. [5]
    Kamke, E.: Differentialgleichungen. Akademische Verlagsgesellschaft Geest & Portig K.-G., Leipzig, (1967)Google Scholar
  6. [6]
    Kemp, R.: Additive Weights of Non-Regularly Distributed Trees. Annals of Discrete Mathematics 33, 129–155, (1987)Google Scholar
  7. [7]
    Kemp, R.: The Expected Additive Weight of Trees. Acta Inf. 26, 711–740, (1989)CrossRefGoogle Scholar
  8. [8]
    Knuth, D.E.: The Art of Computer Programming, Vol. 1, (2nd ed.). Addison-Wesley, Reading, Mass., (1973)Google Scholar
  9. [9]
    Mahmoud, H., Pittel, B.: Analysis of the Space of Search Trees Under the Random Insertion Algorithm. Journal of Alg. 10, 52–75, (1989)CrossRefGoogle Scholar
  10. [10]
    Meir, A., Moon, J.W.: On the Altitude of Nodes in Random Trees. Can. J. Math. 30, 997–1015, (1978)Google Scholar
  11. [11]
    Trier, U.: Additive Weights Under the Balanced Probability Model. Johann Wolfgang Goethe Universität Frankfurt, Fachbereich Informatik (20), Preprint, (1992)Google Scholar
  12. [12]
    Wasow, W.: Asymptotic Expansions for Ordinary Differential Equations. Wiley Inter-science, New York, (1965)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Uwe Trier
    • 1
  1. 1.Fachbereich InformatikJohann Wolfgang Goethe UniversitätFrankfurt/MainGermany

Personalised recommendations