On the distance distribution of trees

Let GG be a tree and kk a non-negative integer. We determine best possible upper and lower bounds on the number of pairs of vertices at distance exactly kk in GG in terms of order alone, and in terms of order and radius or diameter.