Binary trees having a given number of nodes with 0, 1, and 2 children

zbMath0886.05081MaRDI QIDQ1380714

Günter Rote

Publication date: 12 March 1998

Published in: Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)

Full work available at URL: http://www.emis.de/journals/SLC/wpapers/s38proding.html

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30)

Related Items (5)

Retracted: Strong limiting behavior in binary search trees ⋮ Ultra-succinct representation of ordered trees with applications ⋮ A Uniform Approach Towards Succinct Representation of Trees ⋮ A uniform paradigm to succinctly encode various families of trees ⋮ On the number of vertices with a given degree in a Galton-Watson tree

This page was built for publication: Binary trees having a given number of nodes with 0, 1, and 2 children