Tree limits and limits of random trees

Abstract We explore the tree limits recently defined by Elek and Tardos. In particular, we find for many classes of random trees. give general theorems three conditional Galton–Watson trees simply generated trees, split generalized (as here), a continuous-time branching process. These results include, example, labelled ordered recursive preferential attachment binary search