Level number sequences for trees

@article{Flajolet1987LevelNS,
  title={Level number sequences for trees},
  author={Philippe Flajolet and Helmut Prodinger},
  journal={Discrete Mathematics},
  year={1987},
  volume={65},
  pages={149-156}
}
This paper concerns some statistical properties of a parameter related to the profiles of binary trees. Define the level of a node v in a rooted tree t as the number of nodes on the branch connecting v to the root of t (counting both end nodes). The level number sequence of a tree t is the infinite sequence of integers (nl, n2, • • .) such that nj is the number of nodes at level j in tree t. With our previous definitions, a level number sequence starts with a 1 and consists of eventually null… CONTINUE READING
25 Citations
11 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 11 references

The Theory of Partitions, Encyclopedia of Mathematics and its Applications, Vol 2 (Addison Wesley

  • G. Andrews
  • 1976
Highly Influential
3 Excerpts

Flajolet and A . Odlyzko : The average height of binary trees and other simple trees

  • P.
  • INRIA Res . Rep . 400 ( May
  • 1985

Mathematical methods in the analysis of algorithmg and data structures, INRIA Res. Rep. 400 (May 1985), 72p.; to appear in A Graduate Course on Computation

  • P. Flajolet
  • 1985
1 Excerpt

Will: Bandwidths and profiles of trees

  • H. A. Odlyzko
  • 1984
2 Excerpts

Applied and Computational Complex Analysis (Wiley, New York, 1974-1977)

  • P. Henrici
  • 1977
1 Excerpt

Flajolet : Mathematical methods in the analysis of algorithmg and data structures ,

  • P.
  • Res . Rep .
  • 1977

Level number sequences for binarj trees, University of Newcastle Computing La

  • J. Clowes, I. Mitrani, L. Wilson
  • Res. Rep
  • 1977
2 Excerpts

Moon : On the Altitude of Nodes in Random Trees

  • A. Meir, J.
  • The Art of Computer Progrannning : Fundamental…
  • 1968

Similar Papers

Loading similar papers…