“…To encode a tree as its corresponding Prüfer string, we iteratively delete the leaf vertex with the smallest label and write down its unique neighbour, until just a single edge remains. For example, the unique Prüfer string corresponding to the tree T ∈ T 15 shown in Figure 1 below is P = (12,6,15,15,6,6,3,11,1,11,1,3,15) ∈ P 15 . (In this example, the vertex deletions occur in the following order: 2, 4, 5, 7, 8, 9, 6, 10, 12, 13, 11, 1, 3.)…”