An introduction to the analysis of algorithms
An introduction to the analysis of algorithms
Limit laws for embedded trees: Applications to the integrated superBrownian excursion
Random Structures & Algorithms
The left-right-imbalance of binary search trees
Theoretical Computer Science
Generating Functions of Embedded Trees and Lattice Paths
Fundamenta Informaticae - Lattice Path Combinatorics and Applications
| Hi-index | 0.00 |
The rotation correspondence is a map that sends the set of plane trees onto the set of binary trees. In this paper, we first show that when n goes to + ∞, the image by the rotation correspondence of a uniformly chosen random plane tree τ with n nodes is close to 2τ (in a sense to be defined). The second part of the paper is devoted to the right and left depth of nodes in binary trees. We show that the empiric measure (suitably normalized) associated with the difference of the right depth and the left depth processes converges to the integrated super Brownian excursion.