On the Average Shape of Binary Trees

DOI10.1137/0601007MaRDI QIDQ3960130zbMATH OpenOpenAlexFDO

Authors Frank Ruskey

Publication date 1980

Published in SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0601007

zbMATH Keywords

asymptotic behavioraverage level numbers of the leaves of a binary tree

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• Evaluation of a class of binomial coefficient summations
• Generating Binary Trees Lexicographically
• scientific article; zbMATH DE number 3503242 (Why is no real title available?)
• scientific article; zbMATH DE number 3271692 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• scientific article; zbMATH DE number 3390782 (Why is no real title available?)

Cited in

(12)

• On growing random binary trees
• The asymptotic contour process of a binary tree is a Brownian excursion
• The asymptotic distribution of leaf heights in binary trees
• Riordan arrays and combinatorial sums
• An efficient upper bound of the rotation distance of binary trees
• On the Most Probable Shape of a Search Tree Grown from a Random Permutation
• On Level Numbers of t-Ary Trees
• The limiting common distribution of two leaf heights in a random binary tree
• The shape of random pattern-avoiding permutations
• On the average hyperoscillations of planted plane trees
• On the average shape of monotonically labelled tree structures
• Topological self-similarity on the random binary-tree model

This page was built for publication: On the Average Shape of Binary Trees

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