125.统计节点个数

#include <bits/stdc++.h>

using namespace std;
const int maxn = 1001;
struct node
{
	int du;
	int fa;
	vector<int>son;
	node()
	{
		du = 0;
		fa = -1;
		son.clear();
	}
};
int main()
{
  int t;
  cin>>t;
  while(t--)
  {
	int n;
	cin>>n;
	int a, b;
	node s[maxn];
	for(int i = 1; i < n; i++)
	{
		cin>>a>>b;
		s[a].du++;
		s[b].du++;
		s[b].fa = a;
		s[a].son.push_back(b);
	}
	int cnt = 0;
	for(int i = 0; i < n; i++)
	{
		int father = s[i].fa;
		int flag = 0;
		int du = s[i].du;
		
		for(int j = 0; j < s[i].son.size(); j++)
		{
			int son = s[i].son[j];
			if(du < s[son].du)
			{
				flag = 1;break;
			}
		}
		
		if(father == -1 && !flag)
		{
			cnt++;continue;
		}
		else if(s[father].du <= du && !flag )
			cnt++;
	}
	cout<<cnt<<endl;
  }
  return 0;	
} 
/*
2
5
0 1
1 2
2 3
3 4
3
0 2
0 1

*/