Subtrees of a Given size in Schroeder Trees

Abstract

In this paper we find the generating function for the number of vertices which have $k$ elements in their subtree and use this generating function to calculate the probability that a vertex has a size $k$ subtree. We also show how this same technique can be applied to calculate the probabilities for other trees and specifically apply it to Motzkin trees.

arXiv comment6 pages

References in corpus (1)

• On the number of vertices of each rank in phylogenetic trees and their generalizations