In 1870 Schroeder posed four problems about enumerating certain types of rooted trees with n leaves: binary plane trees, binary leaf labeled trees, plane trees with no vertices of out-degree one and leaf labeled trees with no vertices of out degree one. In this talk we will discuss the asymptotic properties of a uniform pick from these types of trees as n goes to infinity. We will start with what...