  The lattice dimension of a graph G is the minimal dimension of a cubic
lattice in which G can be isometrically embedded. We prove that the lattice
dimension of a tree with n leaves is $\lceil n/2 \rceil$.
