Vertex Cover#265
You are given an unweighted, undirected tree. Find the smallest subset of vertices such that every edge has at least one endpoint in that subset.
The first line contains a single integer (0 < n \le 10^5) — the number of vertices in the tree.
Each of the next n - 1 lines contains two integers and (1 \le u, v \le n), representing an edge between vertices and .
Output the size of the smallest subset of vertices as described above.
Example 1