|
|
| |
| Some Combinatorial Problems on Ordered Trees |
| |
Citation： |
Wang Zhengyu.Some Combinatorial Problems on Ordered Trees[J].Chinese Annals of Mathematics B,1983,4(4):501~504 |
| Page view： 794
Net amount： 663 |
Authors： |
Wang Zhengyu; |
|
|
| Abstract： |
Some formulas are established to calculate the number of leaves on all structurally different ordered trees with n nodes, and the total leaf path length and the total node path length for those trees. Certainly, respective average numbers are obtained (the average path length may be considered as the average height of random ordered trees with n nodes), Actually, this paper presents a general method dealing with some classes of combinaorial problems on ordered trees. |
Keywords： |
|
Classification： |
|
|
|
Download PDF Full-Text
|
|
|
|
