In a short 1975 article J. Leech posed a problem where he asked for the existence of trees with N vertices and edges so labeled that the N(N−1)/2 paths in the tree all have different weights 1,2,3,…,N(N−1)/2. He gave five examples. (Leech identified edge labeling with "length" and not "weight", which is reflected in the drawings below.)