  The distinguishing number $D(G)$ of a graph $G$ is the least integer $d$ such
that $G$ has a vertex labeling with $d$ labels that is preserved only by a
trivial automorphism. In this paper we characterize all trees with radius at
most three and distinguishing number two. Also we present a necessary condition
for trees with distinguishing number two and radius more than three.
