Building some complex trees

Define a tree which contains all positive integers as labels; each integer must appear only once in the tree.
Prove that your solution is correct.

Resources

You must load the solution of that exercise.

Solution

Follow this link


Going home
Pierre Castéran