On the concentration of the height of binary search trees
From MaRDI portal
Recommendations
- Constant bounds on the moments of the height of binary search trees
- An analytic approach to the height of binary search trees
- Numerical studies of the expected height in randomly built binary search trees
- On the Variance of the Height of Random Binary Search Trees
- Branching processes in the analysis of the heights of trees
Cites work
Cited in
(14)- Constant bounds on the moments of the height of binary search trees
- The height of a binary search tree: the limiting distribution perspective.
- Smoothed analysis of binary search trees
- Limiting theorems for the nodes in binary search trees
- An Improved Bound for Random Binary Search Trees with Concurrent Insertions
- scientific article; zbMATH DE number 3847416 (Why is no real title available?)
- The Expected Distribution of Degrees in Random Binary Search Trees
- Retracted: Strong limiting behavior in binary search trees
- On the Average Size of the Intersection of Binary Trees
- A note on the height of binary search trees
- ON THE AVERAGE ALTITUDE OF HEAP-ORDERED TREES
- The variance of the height of binary search trees
- Node profiles of symmetric digital search trees: Concentration properties
- On Robson's convergence and boundedness conjectures concerning the height of binary search trees
This page was built for publication: On the concentration of the height of binary search trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4571975)
