2.10 Trees

Graphs 2 and 4 are trees, since they are both connected and acyclic. In contrast, graphs 1 and 3 are not trees: graph 1 is disconnected, while graph 3 contains a cycle.