On the number of descendants and ascendants in random search trees

zbMATH Open0892.05004MaRDI QIDQ1384587FDOQ1384587

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

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

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

zbMATH Keywords

statisticsprobability distributionsbinary search treesdescendantsascendants

Mathematics Subject Classification ID

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

Cited In (8)

• Emerging behavior as binary search trees are symmetrically updated.
• Ascents and descents in random trees
• An analytic approach for the analysis of rotations in fringe-balanced binary search trees
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)

Uses Software

• gfun
• Maple

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)