SOME COMBINATORIAL PROBLEMS ON ORDERED TREES

摘要

＜正＞ Some formulas are established to calculate the number of leaves on all structurallydifferent ordered trees with n nodes,and the total leaf path length and the total node pathlength for those trees.Certainly,respective average numbers are obtained（the average pathlength 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 combinaorialproblems on ordered trees.