Pages that link to "Item:Q1853551"
From MaRDI portal
The following pages link to The height of a binary search tree: the limiting distribution perspective. (Q1853551):
Displaying 9 items.
- Uniform distribution modulo one and binary search trees (Q558117) (← links)
- Some new results for McKean's graphs with applications to Kac's equation (Q867698) (← links)
- A note on the asymptotic behavior of the heights in \(b\)-trees for \(b\) large (Q1578478) (← links)
- Constant bounds on the moments of the height of binary search trees (Q1605322) (← links)
- Reductions in binary search trees (Q2369002) (← links)
- On the Average Size of the Intersection of Binary Trees (Q3990096) (← links)
- On Finding the Height of a Binary Search Tree (Q4039037) (← links)
- On the distribution of binary search trees under the random permutation model (Q4868264) (← links)
- The height of record‐biased trees (Q6074878) (← links)