(用指针造出这棵树，层序遍历)1004 Counting Leaves (30分)

1004 Counting Leaves (30分)

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

 

#include<iostream>
#include<queue>
using namespace std;
struct node
{
    int child_num;
    int level;
    node *child[101];
};

node member[101];
int main(){
    int m, n;
    cin >> m >> n;
    
    int id, child_num, child_id;
    for (int i = 0; i < n;++i){
        cin >> id >> child_num;
        member[id].child_num = child_num;
        for (int j = 0; j < child_num;++j){
            cin >> child_id;
            member[id].child[j] = &member[child_id];
        }
    }

    member[1].level = 0;
    queue<node*> q;
    int res[100] = {0};
    int maxlevel=0;


    q.push(&member[1]);   //root 01

     while(!q.empty()){

        node* first = q.front();
        int n = first->child_num;
        maxlevel = max(first->level, maxlevel);

        if(n==0)
            res[first->level]++; //无后代该层叶子节点数加一

        q.pop();

        for (int i = 0; i < n;++i){
            q.push(first->child[i]);
       first->child[i]->level= first->level + 1;   //把所有子节点的level换为当前节level+1
        }      
    }

    for (int i = 0; i < maxlevel;++i){
        cout << res[i] << " ";
    }
    cout << res[maxlevel];
}