Author： Larmore L.L. Przytycka T.M.
Publisher： Academic Press
ISSN： 0743-7315
Source： Journal of Parallel and Distributed Computing, Vol.35, Iss.1, 1996-05, pp. : 49-56
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
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
An Approximation Algorithm for Binary Searching in Trees
By Laber Eduardo Molinaro Marco
Algorithmica, Vol. 59, Iss. 4, 2011-04 ,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. :
Correctness of constructing optimal alphabetic trees revisited
By Karpinski M. Larmore L.L. Rytter W.
Theoretical Computer Science, Vol. 180, Iss. 1, 1997-06 ,pp. :