Freaks City

Prüfer sequences are defined only for trees with \(n>1\) vertices. For the case \(n=1\), special handling is required. A Prüfer sequence establishes a bijection between labeled rooted trees on \(n\) vertices and sequences of length \(n-2\) drawn from \([1,n]\cap\Z\). This encoding transforms tree structures into arrays, which proves invaluab ...