On the number of descendants and ascendants in random search trees

MaRDI QIDQ1384587zbMATH OpenFDO

Authors Conrado Martínez, Alois Panholzer, Helmut Prodinger

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

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

statisticsprobability distributionsbinary search treesdescendantsascendants

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) Searching and sorting (68P10)

Recommendations

• Limit laws for local counters in random binary search trees
• On the subtrees of random binary search trees
• Height balance distribution of search trees
• scientific article; zbMATH DE number 1375573

Cited in

(8)

• scientific article; zbMATH DE number 1375573 (Why is no real title available?)
• Emerging behavior as binary search trees are symmetrically updated.
• An analytic approach for the analysis of rotations in fringe-balanced binary search trees
• Ascents and descents in random trees
• scientific article; zbMATH DE number 1552326 (Why is no real title available?)
• The mean, variance and limiting distribution of two statistics sensitive to phylogenetic tree balance
• One-sided variations on binary search trees
• The analysis of range quickselect and related problems

Describes a project that uses

Uses Software

• Maple
• gfun

This page was built for publication: On the number of descendants and ascendants in random search trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1384587)