Rosalind - Completing a Tree

Sep 1, 2019 rosalind

Problem:

Please find the problem here.

Solution:

By iteratively eliminating leaves, it is easy to see that a tree of \( n \) nodes has \( n - 1 \) edges. Therefore the solution is simply computing \( (n - 1) \) - number of edges, which is also equal to \( n \) - number of lines. Remember the first line is the number of nodes :)

Code: