Günter Rote:

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

Séminaire Lotharingien de Combinatoire B38b, (1997), 6 pages, (Zbl 980.13720). Comment on a paper by Helmut Prodinger in the same issue.

Abstract

We give three combinatorial proofs for the number of binary trees having a given number of nodes with 0, 1, and 2 children. We extend these results to ordered trees with given distribution of nodes according to their numbers of children.

  PostScript file (gzipped)   pdf file (gzipped)   TeX .dvi file (gzipped)
other papers about this subject
Last update: July 11, 2007.