Interpolation theorem for diameters of spanning trees

We give an algorithmic approach for transforming any spanning tree of a 2-connected graph into any other spanning tree of the graph. At each step of the transformation we obtain a spanning tree whose diameter differs from that of the previous tree by at most one. Thus if a 2-connected graph
G
has
a
as the minimum and
b
as the maximum diameter of a spanning tree, then for any integer
c
between
a
and
b
, graph
G
has a spanning tree of diameter
c
.