Linear time algorithms on trees

Let $T(V,E)$ be a tree. Design linear time (i.e., $O(|V|)$ time) algorithms for the following problems : - Find an optimal [vertex cover](http://en.wikipedia.org/wiki/Vertex_cover) in $T$. - Find a maximum matching in $T$. - Find a maximum independent set in $T$.