Relation between the number of leaves of a tree and its diameter

Let $L(n,d)$ denote the minimum possible number of leaves in a tree of order $n$ and diameter $d\mathrm{.}$ In 1975 Lesniak gave the lower bound $B(n,d)=\lceil 2(n-1)\mathrm{/}d\rceil$ for $L(n,d)\mathrm{.}$ When $d$ is even, $B(n,d)=L(n,d)\mathrm{.}$ But when $d$ is odd, $B(n,d)$ is smaller than $L(n,d)$ in general. For example, $B(21,3)=14$ while $L(21,3)=19.$ We prove that for $d\ge 2,$ $L(n,d)=\lceil \frac{2(n-1)}{d}\rceil$ if $d$ is even and $L(n,d)=\lceil \frac{2(n-2)}{d-1}\rceil$ if $d$ is odd. The converse problem is also considered. Let $D(n,f)$ be the minimum possible diameter of a tree of order $n$ with exactly $f$ leaves. We prove that $D(n,f)=2$ if $n=f+1,$ $D(n,f)=2k+1$ if $n=kf+2,$ and $D(n,f)=2k+2$ if $kf+3\le n\le (k+1)f+1.$