For each $Δ>0$, we prove that there exists some $C=C(Δ)$ for which the binomial random graph $G(n,C\log n/n)$ almost surely contains a copy of every tree with $n$ vertices and maximum degree at most $Δ$. In doing so, we confirm a conjecture by Kahn.