A combinatorial approach to the analysis of bucket recursive trees

In this work we provide a combinatorial analysis of bucket recursive trees, which have been introduced previously as a natural generalization of the growth model of recursive trees. Our analysis is based on the description of bucket recursive trees as a special instance of so called bucket increasing trees, which is a family of combinatorial objects introduced in this paper. Using this combinatorial description we obtain exact and limiting distribution results for the parameters depth of a specified element, descendants of a specified element and degree of a specified element.

• Type: Journal
• Year: 2010
• Where: TCS
• Authors: Markus Kuba, Alois Panholzer
• Keywords: Bucket Recursive Trees, Combinatorial, Recursive Trees, TCS 2010, Theoretical Computer Science