We show that for every $Δ\in\mathbb N$, there exists a constant $C$ such that if $G$ is an $(n,d,λ)$-graph with $d/λ\ge C$ and $d$ is large enough, then $G^2$ contains every $n$-vertex tree with maximum degree bounded by $Δ$. This answers a question of Krivelevich.