Profile and height of random binary search trees

MaRDI QIDQ2834329zbMATH OpenFDO

Authors Michael Drmota

Publication date 28 November 2016

Published in Journal of the Iranian Statistical Society JIRSS (Search for Journal in Brave)

Full work available at URL http://jirss.irstat.ir/browse.php?a_id=107&slc_lang=en&sid=1&ftxt=1

zbMATH Keywords

profilegenerating functionsheightlimiting distributionbinary search tree

Mathematics Subject Classification ID

Trees (05C05) Combinatorial probability (60C05)

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)