Fig. B.12.

The steps of the construction of a tree with $\mathcal{S}=\left(\mathrm{2,0,0,0,1,0,3,0,2}\right)$ [a cyclic permutation of the previous $\mathcal{S}$]. Each frame shows next step in building a tree on a ring. The resulting tree is not rooted at the top. The names of the nodes in the tree are a cyclic permutation of the original.