Thumbnail
Access Restriction
Subscribed

Author Burge, William H.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1976
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Abstract The expected depth of each key in the set of binary search trees formed from all sequences composed from a multiset ${\textit{p}1$ · 1, $\textit{p}2$ · 2, $\textit{p}3$ · 3, ···, $\textit{p}n$ · $\textit{n}}$ is obtained, and hence the expected weight of such trees. The expected number of left-to-right local minima and the expected number of cycles in sequences composed from a multiset are then deduced from these results.
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 1976-07-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 23
Issue Number 3
Page Count 4
Starting Page 451
Ending Page 454


Open content in new tab

   Open content in new tab
Source: ACM Digital Library