Answer
Devising an algorithm for constructing a rooted tree from
the universal addresses of its leaves
Work Step by Step
-Build the tree by inserting a root for the address 0, and then inserting a subtree for each vertex labeled i,
- for i a positive integer,
-built up from subtrees for each vertex labeled i.j
-for j a positive integer, and so on.
