Leaves in a Particular Class of Trees

  • Mehri JavanianEmail author
Short Communication


In this paper, we investigate leaves for random paged digital search trees, an important and generalized version of digital search trees.


Random trees Paged digital search trees Singularity analysis 



  1. 1.
    Flajolet P, Gourdon X, Dumas P (1995) Mellin transforms and asymptotics: harmonic sums. Theor Comput Sci 144:3–58 (Special volume on mathematical analysis of algorithms)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Flajolet P, Gourdon X, Martinez C (1997) Patterns in random binary search trees. Random Struct Algorithms 11:223–244MathSciNetCrossRefGoogle Scholar
  3. 3.
    Hwang HK, Fuchs M, Zacharovas V (2010) Asymptotic variance of random symmetric digital search trees. Discrete Math Theor Comput Sci 12:103–166MathSciNetzbMATHGoogle Scholar
  4. 4.
    Jacquet P, Szpankowski W (1998) Analytical de-poissonization and its applications. Theor Comput Sci 201:1–62MathSciNetCrossRefGoogle Scholar
  5. 5.
    Knuth DE (1998) The art of computer programming: sorting and searching, vol 3. Addison-Wesley, BostonGoogle Scholar

Copyright information

© The National Academy of Sciences, India 2019

Authors and Affiliations

  1. 1.Department of StatisticsUniversity of ZanjanZanjanIran

Personalised recommendations