The following pages link to (Q3317124):
Displaying 6 items.
- The asymptotic contour process of a binary tree is a Brownian excursion (Q1198554) (← links)
- The asymptotic distribution of leaf heights in binary trees (Q1199121) (← links)
- Moments of level numbers of leaves in binary trees (Q1347985) (← links)
- Average-case analysis of quicksort and binary insertion tree height using incompressibility (Q2379940) (← links)
- A note on the height of binary search trees (Q3990603) (← links)
- ON THE AVERAGE ALTITUDE OF HEAP-ORDERED TREES (Q4304617) (← links)