For a graph $G$, let $λ_2(G)$ denote the second largest eigenvalue of the adjacency matrix of $G$. We determine the extremal trees with maximum/minimum adjacency eigenvalue $λ_2$ in the class $\mathcal{T}(n,d)$ of $n$-vertex trees with diameter $d$. This contributes to the literature on $λ_2$-extremization over different graph families. We also revisit the notion of the spectral center of a tree and the proof of $λ_2$ maximization over trees.