%0 Journal Article
%T SOME ENUMERATION CHARACTERISTICS OF RECURSIVE TREES<br>递归树的若干枚举特征
%A Wang Zhenyu
%A Ph Flajolet
%A <br>王振宇
%J 系统科学与数学
%D 1997
%I 
%X Recursive tree is defined by Meir and Moon as the variety of non-planarincreasing tree such that all node degrees are allowed. This paper provides a 1-1 correspondence between recursive trees, with size n and leaf number k, and permutations, with size n-l and run number k.Various enumeration characteristics of recursive tree, such as classifying enumeration of nodes (internal nodes and leaves, even and odd nodes, nodes with different out-degrees) and path lengths (according to different node classifications) are investigated, and the corresponding exact enumerating formulas and asymptotic behaviour are given.
%K Recursive tree
%K plane increasing tree
%K permutation
%K run
%K stirling number<br>递归树
%K 平面增长树
%K 排列
%K 路段，Stirling数
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=6E709DC38FA1D09A4B578DD0906875B5B44D4D294832BB8E&cid=37F46C35E03B4B86&jid=0CD45CC5E994895A7F41A783D4235EC2&aid=5D57B58C4DE680FD2C0F676AF897F122&yid=5370399DC954B911&vid=BCA2697F357F2001&iid=38B194292C032A66&sid=FEF02B4635FE8227&eid=38685BC770C663F2&journal_id=1000-0577&journal_name=系统科学与数学&referenced_num=1&reference_num=0