Consider a family of random ordered graph trees (T n ) n≥1 , where T n has n vertices. It has previously been established that if the associated search-depth processes converge to the normalised ...