Profile and height of random binary search trees

zbMATH Open1499.60018MaRDI QIDQ2834329FDOQ2834329

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
• Title not available (Why is that?)
• A Greedy Algorithm Estimating the Height of Random Trees
• Branching random walks on binary search trees: convergence of the occupation measure
• Smoothed Analysis of Binary Search Trees and Quicksort under Additive Noise
• Profile of random exponential binary trees
• The height of random binary unlabelled trees

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)