Content deleted Content added
m Task 18 (cosmetic): eval 4 templates: del empty params (4×); hyphenate params (1×); |
m →Binary trees: typo n nodes |
||
Line 111:
===Binary trees===
Consider the set <math>\mathcal{B}</math> of unlabelled [[binary tree]]s. An element of <math>\mathcal{B}</math> is either a leaf of size zero, or a root node with two subtrees. Denote by <math>B_n</math> the number of binary trees on
Removing the root splits a binary tree into two trees of smaller size. This yields the functional equation on the generating function <math>\textstyle B(z) = \sum_{n=0}^\infty B_n z^n\text{:}</math>
| |||