Browse by author
Lookup NU author(s): Emeritus Professor Isi Mitrani
Binary trees occur frequently in the ananlysis of computer algorithms and in such cases are usually only interested in the number of nodes at each level. We call a sequence of numbers which denotes the number of nodes at each level a ""level number sequence"". In this paper we derive upper and lower bounds for the enumeration of such level number sequences for binary trees with n nodes, and we also examine the properties of some restricted level number sequences.
Author(s): Clowes JS, Mitrani I, Wilson LB
Publication type: Report
Publication status: Published
Series Title: Computing Laboratory Technical Report Series
Year: 1977
Pages: 28
Report Number: 112
Institution: Computing Laboratory, University of Newcastle upon Tyne
Place Published: Newcastle upon Tyne
URL: http://www.cs.ncl.ac.uk/publications/trs/papers/112.pdf
