Recursion depth analysis for special tree traversal algorithms

  • Peter Kirschenhofer
  • Helmut Prodinger
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 172)


Binary Tree Arithmetic Expression Vertical Step Lattice Polygon Storage Complexity 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    N.G. De Bruijn, D.E. Knuth and 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, 1972.Google Scholar
  2. [2]
    P. Flajolet, Analyse d'algorithmes de manipulation d'arbres et de fichiers, Cahiers du BURO, 34–35 (1981), 1–209.Google Scholar
  3. [3]
    P. Flajolet and A. Odlyzko, The average height of binary trees and other simple trees, J. Comput. Syst. Sci. 25 (1982), 171–213.Google Scholar
  4. [4]
    P. FLAJOLET, J.C. RAOULT and J. VUILLEMIN, The number of registers required to evaluate arithmetic expressions, Theoret.Comput.Sci. 9 (1979), 99–125.Google Scholar
  5. [5]
    J.FÜRLINGER and J.HOFBAUER, q-Catalan numbers, preprint, Universität Wien, 1983.Google Scholar
  6. [6]
    R. KEMP, The average number of registers needed to evaluate a binary tree optimally, Acta.Inf. 11 (1979), 363–372.Google Scholar
  7. [7]
    D.E. KNUTH, "The Art of Computer Programming: Fundamental Algorithms", Addison-Wesley, Reading, Mass., 1968.Google Scholar
  8. [8]
    G. POLYA, On the number of certain lattice polygons, J.Comb.Theory 6 (1969), 102–105.Google Scholar
  9. [9]
    H.PRODINGER, The height of planted plane trees revisited, Ars Combinatoria, to appear, 1984.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • Peter Kirschenhofer
    • 1
  • Helmut Prodinger
    • 1
  1. 1.Institut für Algebra und Diskrete Mathematik TU ViennaViennaAustria

Personalised recommendations