We prove that every tree of maximum degree $Δ$ with $\ell$ leaves contains paths between leaves of at least $\log_{Δ-1}((Δ-2)\ell)$ distinct lengths. This settles in a strong form a conjecture of Narins, Pokrovskiy and Szabó. We also make progress towards another conjecture of the same authors, by proving that every tree with no vertex of degree 2 and diameter at least $N$ contains $N^{2/3}/6$ distinct leaf-to-leaf path lengths between $0$ and $N$.