Author： Chauvin Brigitte Drmota Michael
Publisher： Springer Publishing Company
ISSN： 0178-4617
Source： Algorithmica, Vol.46, Iss.3-4, 2006-11, pp. : 299-327
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Related content
The Variance of the height of binary search trees
By Drmota M.
Theoretical Computer Science, Vol. 270, Iss. 1, 2002-01 ,pp. :
Access to resources
Recommend
Distances in random digital search trees
By Aguech Rafik Lasmar Nabil Mahmoud Hosam
Acta Informatica, Vol. 43, Iss. 4, 2006-11 ,pp. :
Constant bounds on the moments of the height of binary search trees
By Robson J.M.
Theoretical Computer Science, Vol. 276, Iss. 1, 2002-04 ,pp. :
The height of a binary search tree: the limiting distribution perspective
Theoretical Computer Science, Vol. 289, Iss. 1, 2002-10 ,pp. :