  We give a simple characterisation of the distribution of the independence
number, and equivalently the matching number, of a random tree on $n$ labelled
vertices chosen uniformly among the $n^{n-2}$ such trees: Roll an $n$-sided die
repeatedly, and let $\alpha$ be the smallest number such that after $\alpha$
throws, at least $n-\alpha$ distinct numbers have occurred. Then $\alpha$ has
the same distribution as the independence number, and $n-\alpha$ has the same
distribution as the matching number. We obtain a similar characterisation of
the path cover number. The proofs are bijective and based on modifications of
the Pr\"ufer code.
