  In the present paper, we determine the full spectrum of the simple random
walk on finite, complete $d$-ary trees. We also find an eigenbasis for the
transition matrix. As an application, we apply our results to get a lower bound
for the interchange process on complete, finite d-ary trees, which we
conjecture to be sharp.
