Thumbnail
Access Restriction
Subscribed

Author Sprugnoli, Renzo
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1992
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Binary trees ♦ Generation of binary trees
Abstract The problem of generating random, uniformly distributed, binarytrees is considered. A closed formula that counts the number of treeshaving a left subtee with k-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 1992-04-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 39
Issue Number 2
Page Count 11
Starting Page 317
Ending Page 327


Open content in new tab

   Open content in new tab
Source: ACM Digital Library