In the paper we explore distance constrained labelings of trees, namely the propeties and computational complexity