Solution
= Solution
A \b[<tree>] is a connected <graph> with no <cycles>. Equivalently, between any two of its vertices there is exactly one <graph path>. A single vertex with no edges is also a tree.
= Solution
A \b[<tree>] is a connected <graph> with no <cycles>. Equivalently, between any two of its vertices there is exactly one <graph path>. A single vertex with no edges is also a tree.