greedy.cpp

int dfs(int x, int p){
	vector<int> e;
	for(auto &i : tr[x]){
		if(i == p) continue;
		e.push_back(dfs(i, x));
	}
	if(e.empty()) return 1;
	sort(e.begin(), e.end());
	for(int i=0; i<e.size()-1; i++){
		v.push_back(e[i]);
	}
	return e.back() + 1;
}