Sciweavers

ALGORITHMICA
2006
74views more  ALGORITHMICA 2006»
13 years 11 months ago
On the Number of t-Ary Trees with a Given Path Length
We show that the number of t-ary trees with path length equal to p is t h(t-1) tp log2 p(1+o(1)) , where h(x)=-x log2 x-(1-x) log2(1-x) is the binary entropy function. Besides its...
Gadiel Seroussi