Branches in random recursive k-ary trees

Abstract

In this paper, using generalized {polya} urn <br />models we find the expected value of the size of a branch in <br />recursive $k$-ary trees. We also find the expectation of the <br />number of nodes of a given outdegree in a branch of such <br />trees.