edges of T:(ui,vi),1sisn-1 ui:smallest leaf in T n is never deleted Vn-1=n a tree has≥2 leaves }> lli≠n T: Only need to recover every ui from (v1,v1,...,vn-2). ui is the smallest number not in {u1,,u-1}U{v,.,vn-1} u:2,4,5,6,3,1 :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) edges of T : (ui,vi), 1≤i≤n-1 vn-1 = n a tree has ≥2 leaves ui : smallest leaf in Ti } ui ≠ n n is never deleted Only need to recover every ui from (v1, v1, ... , vn-2). {u1,...,ui￾1} ￾ {vi,...,vn￾1} ui is the smallest number not in