A note on the distribution of the three types of nodes in uniform binary trees
From MaRDI portal
Publication:1380713
zbMath0886.05007MaRDI QIDQ1380713
Publication date: 12 March 1998
Published in: Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/119295
Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Combinatorial probability (60C05)
Related Items (5)
Retracted: Strong limiting behavior in binary search trees ⋮ DEGREE-BASED GINI INDEX FOR GRAPHS ⋮ Limiting theorems for the nodes in binary search trees ⋮ On the number of vertices with a given degree in a Galton-Watson tree ⋮ On the internal structure of random recursive circuits
This page was built for publication: A note on the distribution of the three types of nodes in uniform binary trees