Abstract
The level numbers of a t-ary tree are the distances from the root to the exterior nodes of the tree. Ruskey and Hu [SIAM J. Comput., 6 (1977), pp. 745–758] have considered certain problems involving these level numbers. Alternate derivations and generalizations of some of their results are given here.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
