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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.