Skip to main content

Die Bestimmung Gewisser Parameter Bei Binären Bäumen Mit Hilfe Analytischer Methoden

Part of the Lecture Notes in Mathematics book series (LNM,volume 1114)

Abstract

This paper deals with the average number of nodes with a special property in binary trees with n nodes. Generating functions are set up and considered as analytic functions. A detailed singularity analysis allows to get asymptotic formulas for the considered numbers. The local expansions are derived by use of the Mellin transform. The asymptotic expansion involves periodic terms; the Fourier coefficients are computed in terms of Riemann’s ξ-functions etc.

This is a preview of subscription content, access via your institution.

Buying options

eBook
USD   19.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   29.95
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literatur

  1. E.A. BENDER, Asymptotic methods in enumeration, SIAM Reviews 16 (1974), 485–515.

    CrossRef  MATH  MathSciNet  Google Scholar 

  2. N.G. de BRUIJN, D.E. KNUTH, S.O. RICE, The average height of planted plane trees, in: Graph Theory and Computing (R.C. Read, Ed.), 15–22, Academic Press, New York-London, 1972.

    CrossRef  Google Scholar 

  3. P. FLAJOLET, Analyse d’algorithmes de manibulation d’arbres et de fichiers, Cahiers du BURO, 34–35 (1981), 1–209.

    Google Scholar 

  4. P. FLAJOLET, A. ODLYZKO, The average height of binary trees and other simple trees, J. Comput. Syst. Sci. 25 (1982), 142–158.

    CrossRef  MATH  MathSciNet  Google Scholar 

  5. P. FLAJOLET, J.-C. RAOULT, J. VUILLEMIN, The number of registers required for evaluating arithmetical expressions, Theoretical Computer Science 9 (1979), 99–125.

    CrossRef  MATH  MathSciNet  Google Scholar 

  6. P.FLAJOLET, H.PRODINGER, Register allocation for unary-binary trees, SIAM J. on Computing, im Druck.

    Google Scholar 

  7. R. JUNGEN, Sur les séries de Taylor n’ayant que des singularités algébrologarithmiques sur leur cercle de convergence, Commentarii Math. Helvetici 3 (1931), 266–306.

    CrossRef  MATH  MathSciNet  Google Scholar 

  8. R. KEMP, The average number of registers to evaluate a binary tree optimally, Acta Informatica 11 (1979), 363–372.

    CrossRef  MATH  MathSciNet  Google Scholar 

  9. D.E.KNUTH, The art of computer programming, Vol. 1, Addison Wesley 1968.

    Google Scholar 

  10. A. MEIR, J.W. MOON, J.R. POUNDER, On the order of random channel networks, SIAM J. Alg. Discr. Meth. 1 (1980), 25–33.

    CrossRef  MATH  MathSciNet  Google Scholar 

  11. J.W. MOON, On Horton’s Law for random channel networks, Annals of Discrete Mathematics 8 (1980), 117–121.

    CrossRef  MATH  MathSciNet  Google Scholar 

  12. A. ODLYZKO, Periodic oscillations of coefficients of power series that satisfy functional equations, Advances in Mathematics 44 (1982), 180–205.

    CrossRef  MATH  MathSciNet  Google Scholar 

  13. H. PRODINGER, The influence of the nodes on the leftsided height of a binary tree, submitted.

    Google Scholar 

  14. H. PRODINGER, R.F. TICHY, Über ein zahlentheoretisches Problem aus der Informatik, Sitzungsberichte der Österreichischen Akademie der Wissenschaften, im Druck.

    Google Scholar 

  15. E.T. WHITTAKER, G.N. WATSON, A course of modern analysis, Cambridge University Press, 1927.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1985 Springer-Verlag

About this paper

Cite this paper

Prodinger, H. (1985). Die Bestimmung Gewisser Parameter Bei Binären Bäumen Mit Hilfe Analytischer Methoden. In: Hlawka, E. (eds) Zahlentheoretische Analysis. Lecture Notes in Mathematics, vol 1114. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0101650

Download citation

  • DOI: https://doi.org/10.1007/BFb0101650

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15189-0

  • Online ISBN: 978-3-540-39281-1

  • eBook Packages: Springer Book Archive