This is certainly no proof. I can give you a method of finding the center (bicenter) of a tree.

Suppose that .

First, remove all vertices of degree one along with any incident edges.

We still have a tree remaining. If the number of remaining vertices is more than two, then repeat the process.

If the number of remaining vertices is two you have a bicenter; if it is one you have the center.