I was asked the following question in the Google Onsite Interview :

Find the solution to the Vertex Cover problem given that the graph is undirected and no cycles exists (basically a tree).