On the Generation of Random Binary Search Trees
DOI10.1137/S0097539792224954zbMATH Open0841.68061OpenAlexW2038309235MaRDI QIDQ4862789FDOQ4862789
Authors: Luc Devroye, John Michael Robson 
Publication date: 25 February 1996
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539792224954
Recommendations
Monte Carlo methods (65C05) Random number generation in numerical analysis (65C10) Random graphs (graph-theoretic aspects) (05C80) Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Searching and sorting (68P10) Combinatorial probability (60C05) Pseudo-random numbers; Monte Carlo methods (11K45)
Cited In (18)
- Average depth in a binary search tree with repeated keys
- A note on Rémy's algorithm for generating random binary trees
- Generating random binary trees -- a survey
- Constant bounds on the moments of the height of binary search trees
- Title not available (Why is that?)
- Randomness Preserving Deletions on Special Binary Search Trees
- Optimal binary search trees
- Generating binary trees at random
- Analysis of the space of search trees under the random insertion algorithm
- Title not available (Why is that?)
- An Improved Bound for Random Binary Search Trees with Concurrent Insertions
- A Comparison of Random Binary Tree Generators
- On the probability distribution of the values of binary trees
- Title not available (Why is that?)
- Binarization Trees and Random Number Generation
- Numerical studies of the expected height in randomly built binary search trees
- On the concentration of the height of binary search trees
- Title not available (Why is that?)
This page was built for publication: On the Generation of Random Binary Search Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4862789)
