A family hierarchy is usually presented by a pedigree tree. Your job is to count those family members who have no child.
Input Specification:
Each input file contains one test case. Each case starts with a line containing 0<N<100, the number of nodes in a tree, and M (<N), the number of non-leaf nodes. Then M lines follow, each in the format:
ID K ID[1] ID[2] … ID[K]
where ID is a two-digit number representing a given non-leaf node, K is the number of its children, followed by a sequence of two-digit ID’s of its children. For the sake of simplicity, let us fix the root ID to be 01.
The input ends with N being 0. That case must NOT be processed.
Output Specification:
For each test case, you are supposed to count those family members who have no child for every seniority level starting from the root. The numbers must be printed in a line, separated by a space, and there must be no extra space at the end of each line.
The sample case represents a tree with only 2 nodes, where 01 is the root and 02 is its only child. Hence on the root 01 level, there is 0 leaf node; and on the next level, there is 1 leaf node. Then we should output 0 1 in a line.
Sample Input:
2 1
01 1 02
Sample Output:
0 1
题意:
输入一棵树;输出这棵树每层的叶子结点数.
思路:
(1)开数组layerNum[],layerNum[i]记录i层的叶子结点个数;
(2)先根遍历树(DFS)的同时记录最大层数和每层的叶子结点数.
代码:
#include <cstdio>
#include <vector>
using namespace std;
const int maxn = 110;
vector<int> node[maxn];//树的静态结构
int layerNum[maxn] = {0};//layerNum[i]记录i层的叶子结点个数
int maxlayer = -1;//最大层树
void PreOrder(int root,int layer){//先根遍历树(DFS),记录最大层数和每层的叶子结点数
if(node[root].size()==0){
if(layer>maxlayer) maxlayer = layer; //记录最大层数
layerNum[layer]++;//记录该层的叶子结点数
return;
}
for(int i=0;i<node[root].size();i++){
PreOrder(node[root][i],layer+1);
}
}
int main(){
int n,m;
scanf("%d",&n);
if(n==0) return 0;//N==0则退出
scanf("%d",&m);
int id,k,child;
for(int i=0;i<m;i++){//建树
scanf("%d %d",&id,&k);
for(int j=0;j<k;j++){
scanf("%d",&child);
node[id].push_back(child);
}
}
PreOrder(1,1);
for(int i=1;i<=maxlayer;i++){
printf("%d",layerNum[i]);
if(i!=maxlayer) printf(" ");
}
return 0;
}