| 摘 要： | The present paper discusses more about additive enumeration problems over some tree families, especially, the trees with nodes and leaves of given numbers. It establishes a uniform solving scheme for additive enumeration problems over V(ery) simply generated tree families. Based on the uniform scheme, a series of additive enumeration problems over tree families, including leaf path length counting and node path length counting, are solved. The tree families related include: binary tree, t-ary tree and ordered tree.
|
