![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Drmota M.
Publisher: Elsevier
ISSN: 0304-3975
Source: Theoretical Computer Science, Vol.270, Iss.1, 2002-01, pp. : 913-919
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
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
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. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
By Nagaraj S.V.
Theoretical Computer Science, Vol. 188, Iss. 1, 1997-11 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
The height of a binary search tree: the limiting distribution perspective
Theoretical Computer Science, Vol. 289, Iss. 1, 2002-10 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
New lower bounds on the cost of binary search trees
Theoretical Computer Science, Vol. 156, Iss. 1, 1996-03 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Emerging behavior as binary search trees are symmetrically updated
Theoretical Computer Science, Vol. 297, Iss. 1, 2003-03 ,pp. :