The asymptotic contour process of a binary tree is a Brownian excursion

Abstract

The contour process of a random binary tree t with n internal nodes is defined as the polygonal function constructed from the heights of the leaves of t (normalized by n). We show that, as n → ∞, the limiting contour process is identical in distribution to a Brownian excursion. © 1992.