Freaks City

Tree to Prufer Sequence Find the leaf node with the smallest label, and add its parent to the sequence. Delete that leaf node. Repeat the above operations until a sequence of length (n-2) is obtained. The reverse process reconstructs the tree. A Prufer sequence establishes a bijection between the spanning trees of a complete graph with (n) ve ...