On the Average Shape of Binary Trees
From MaRDI portal
Publication:3960130
DOI10.1137/0601007zbMath0496.68044OpenAlexW2593982002MaRDI QIDQ3960130
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
Related Items
On growing random binary trees, Riordan arrays and combinatorial sums, The limiting common distribution of two leaf heights in a random binary tree, On the average hyperoscillations of planted plane trees, The shape of random pattern-avoiding permutations, On the Most Probable Shape of a Search Tree Grown from a Random Permutation, The asymptotic contour process of a binary tree is a Brownian excursion, The asymptotic distribution of leaf heights in binary trees, Topological self-similarity on the random binary-tree model, On Level Numbers of t-Ary Trees, On the average shape of monotonically labelled tree structures, An efficient upper bound of the rotation distance of binary trees
Cites Work
