## Center and Centroid

We denote $C(T)$ and $D(T)$ to be the center set and centroid set respectively of a tree $T$. For each $n \geq 2$, construct a tree $T$ in which $\text{dist}_T(C(T), D(T)) \geq n$. I don't see how to construct these trees.