Profile and height of random binary search trees
From MaRDI portal
Publication:2834329
Cited in
(7)- On the Variance of the Height of Random Binary Search Trees
- Smoothed Analysis of Binary Search Trees and Quicksort under Additive Noise
- scientific article; zbMATH DE number 6145140 (Why is no real title available?)
- The height of random binary unlabelled trees
- A Greedy Algorithm Estimating the Height of Random Trees
- Profile of random exponential binary trees
- Branching random walks on binary search trees: convergence of the occupation measure
This page was built for publication: Profile and height of random binary search trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2834329)