1. Construct a few random trees on n=10,11,12, nodes. For each such tree, draw it, compute its Prfer code and then convert the code back into a tree. Do you get your old tree back?

2. For a few randomly chosen Prfer codes, construct the corresponding tree, draw it if you want, and convert it back into a Prfer code. Do you get your old code back?

3. Which tree on n nodes corresponds to the Prfer code consisting of n2 entries 0?