The interpolation theorem for diameters of spanning trees given by Harary et al. has been extended by finding the upper bound of cut-vertices of a graph in which that theorem holds. New interpolating properties of spanning trees are also presented. The interpolating properties of spanning trees are applied to obtain results on the number of spanning trees for a given diameter.