Tree has either one central vertex or two adjacent central vertices

Statement

Suppose $T$ is a tree that is also a graph of finite diameter, so that it has central vertices. Then, there are two possibilities:

1. $T$ has exactly one central vertex
2. $T$ has exactly two central vertices, and they are adjacent vertices