We sometimes need to consider well-labeled trees, that is, trees whose vertices carry integer labels, varying from -1, 0, or 1 along any edge. All the vertices are embedded in the space with the same coordinate equal to the integer label they carry. See also this page for another kind of embedding.