Highly Influenced

# Applied Tree Enumerations

@inproceedings{Dershowitz1981AppliedTE, title={Applied Tree Enumerations}, author={Nachum Dershowitz and Shmuel Zaks}, booktitle={CAAP}, year={1981} }

- Published 1981 in CAAP
DOI:10.1007/3-540-10828-9_62

In this paper we consider the class T of ordered trees with n edges and give n combinntorial proofs to several enumeration formulae concerning T. In particular, n closed-form expressions are given for (1) the number of trees in T with n leaves, n 0 n1 unary nodes,. .. , nd nodes with d children, and no restrictions on nodes with more than d children, and for (2) the number of nodes in T on level R with d chil-n dren. Several statistical results are derived from these. The combinatorial tools we… CONTINUE READING