  Motivated by the work of Lov\'asz and Szegedy on the convergence and limits
of dense graph sequences, we investigate the convergence and limits of finite
trees with respect to sampling in normalized distance. Based on separable real
trees, we introduce the notion of a dendron and show that the limits of finite
trees are exactly the dendrons. We also prove that the limit dendron is unique.
