What is a good algorithm for getting the minimum vertex cover of a tree?
The node's neighbours.
The minimum number of vertices.