Prufer code is reversible 1-1 every(1,2,,n-2)∈{1,2，.…，n}n-2 is decodable to a tree > onto T T=empty graph; Vn-1 =n; for i=1 to n-1 ui:smallest number not in ul,...ui-1vis...Vn-1} u:2,4,5,6,3,1 add edge (ui,vi)to T; :4,3,1,3,1,7 (V1,V2,.,Vn-2) 4 3 6 2 5 1 7 T : ui : vi : 4, 3, 1, 3, 1, 7 2, 4, 5, 6, 3, 1 (v1, v2, ... , vn-2) T = empty graph; ui : smallest number not in add edge (ui,vi) to T ; for i = 1 to n-1 {u1,...,ui-1}∪{vi,...,vn-1} vn-1 = n ; Prüfer code is reversible 1-1 every (v1, v2,...,vn￾2) ￾ {1, 2,...,n}n￾2 is decodable to a tree onto