We study the spectral Turán problem for trees. To avoid limiting our perspective to specific families of trees, we parametrize trees in terms of their unique bipartition. We say $T \in \mathcal{T}_{m,l+1}^δ$ if $T$ is a tree of order $m$, where the order of the smaller partite set $A$ of $T$ is $l+1$, and $δ$ is the minimum degree of the vertices in $A$. The motivation for this parametrization comes from the recent proof of the spectral Erdős-Sós conjecture. For a given fixed tree $T$, we describe $\mathrm{SPEX}(n,T)$ and consequently, bound $\mathrm{spex}(n,T)$ in terms of $m,l,δ$ for that tree. Our approach combines spectral arguments with new results and constructions on embedding a tree $T \in \mathcal{T}_{m,l+1}^δ$ into graphs of the form $\overline{K}_l \vee m S_δ$. We give bounds on $\mathrm{spex}(n,T)$ within an error of $Θ(n^{-1/2})$ and $Θ(n^{-1})$ that are based on our embedding results for the given $T$.