An analytic approach to the height of binary search trees II

DOI10.1145/765568.765572zbMath1325.68074OpenAlexW2011233451MaRDI QIDQ3452495

Michael Drmota

Publication date: 12 November 2015

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/765568.765572

zbMATH Keywords

generating functionsheightbinary search treeaverage case analysissaturation level

Mathematics Subject Classification ID

Searching and sorting (68P10) Data structures (68P05)

Related Items (17)

Longest Path Distance in Random Circuits ⋮ Smoothed analysis of binary search trees ⋮ Quenched invariance principles for the maximal particle in branching random walk in random environment and the parabolic Anderson model ⋮ Retracted: Strong limiting behavior in binary search trees ⋮ Compaction for two models of logarithmic‐depth trees: Analysis and experiments ⋮ The height of record‐biased trees ⋮ DEGREE-BASED GINI INDEX FOR GRAPHS ⋮ Erasure-Resilient Property Testing ⋮ The height of increasing trees ⋮ Limiting theorems for the nodes in binary search trees ⋮ On Robson's convergence and boundedness conjectures concerning the height of binary search trees ⋮ Minima in branching random walks ⋮ Smoothed Analysis of Binary Search Trees and Quicksort under Additive Noise ⋮ Tightness for a family of recursion equations ⋮ The height of Mallows trees ⋮ Tightness for the minimal displacement of branching random walk ⋮ Correction terms for the height of weighted recursive trees

This page was built for publication: An analytic approach to the height of binary search trees II