A vertex cover of a graph is a subset C of vertices such that for every edge e=(u,v) of the graph at least one of u, v is in C. Write a linear time algorithm that given an n-vertex (undirected) tree T, outputs the size of the smallest vertex cover of T.