Thumbnail
Access Restriction
Subscribed

Author Reed, Bruce
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©2003
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Binary search tree ♦ Asymptotics ♦ Height ♦ Probabilistic analysis ♦ Random tree ♦ Second moment method
Abstract Let $\textit{Hn}$ be the height of a random binary search tree on $\textit{n}$ nodes. We show that there exist constants α = 4.311… and β = 1.953… such that $E(\textit{Hn})$ = αln n ™ βln ln n + $\textit{O}(1),$ We also show that $Var(\textit{Hn})$ = $\textit{O}(1).$
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2003-05-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 50
Issue Number 3
Page Count 27
Starting Page 306
Ending Page 332


Open content in new tab

   Open content in new tab
Source: ACM Digital Library