| 摘 要： | In this paper, an enumeration problem on t-ary trees with m interior nodes and n leaves is discussed. In the analysis of algorithms over tree structures, it is not sufficient to consider roughly the behavior of algorithms over trees with m nodes, because the difference between the structures of the two different trees with m nodes may be great. However, on the other hand, the difference between the structures of the trees with m interior nodes and n leaves may be relatively small. Thus, in such an analysis, it is needed to count the number of struc-
|
