- Full text PDF available (1)
- This year (0)
- Last five years (0)
This paper empirically compares five linear-time algorithms for generating unbiased random binary trees. More specifically, we compare the relative asymptotic performance of the algorithms in terms of the numbers of various basic operations executed on average per tree node. Based on these numbers a ranking of the algorithms, which depends on the operation… (More)
We derive the expected numbers of nodes with 0, 1, and 2 children in random binary trees by using only elementary methods and concepts.