On the number of descendants and ascendants in random search trees
From MaRDI portal
Publication:1384587
zbMath0892.05004MaRDI QIDQ1384587
Conrado Martínez, Alois Panholzer, Prodinger, Helmut
Publication date: 16 April 1998
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.emis.de/journals/EJC/Volume_5/Abstracts/v5i1r20.html
Trees (05C05) Searching and sorting (68P10) Exact enumeration problems, generating functions (05A15)
Related Items (5)
One-sided variations on binary search trees ⋮ Emerging behavior as binary search trees are symmetrically updated. ⋮ The analysis of range quickselect and related problems ⋮ The mean, variance and limiting distribution of two statistics sensitive to phylogenetic tree balance ⋮ An analytic approach for the analysis of rotations in fringe-balanced binary search trees
Uses Software
This page was built for publication: On the number of descendants and ascendants in random search trees
