PAT 1004 Counting Leaves（层序遍历求树每层叶节点个数）

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.

题目分析：

给出N为数中节点总数，M为书中非叶节点的总数，下面M行，每行三类元素，分别为非叶节点的编号，改节点的孩子个数和孩子节点的编号。而要求我们求出每一层中叶子节点的个数。

本题的解决思路是使用层序遍历，而层序遍历的解决用到队列的思想。用二维数组或者向量（初值全部为零）保存每个非叶节点的所有孩子节点的编号，行标i为非也节点的编号，列标j为该节点第j个节点的编号。在队列中设置两个下标front和rear分别表示某一层第一个节点和最后一个节点在队列中的下标。层序遍历过程中存储节点的队列中在front和rear指针之间需要借助一个tag指针，用来标记从front指针到rear指针之间的节点处于同一层，然后开始计数。事实上，这个tag就是上一层父节点的所有孩子节点入队后rear指针的位置，这些孩子节点处于同一层。count记录该层中叶子节点的数目，初值为0。先将根节点入队，其第一个孩子节点的编号为1，从根节点开始遍历，将每一个非叶节点的孩子节点的编号全部入队，front为每一层第一个节点下标，中间变量tag为最后一个节点下标，rear作为队尾下标，每加入一个元素自动加1，在遍历到下一层前，将rear赋值给tag，即代表下一层中最后一个节点的位置。每遍历完一层，输出一次count值。代码如下：

#include<iostream>
#define maxsize 101
using namespace std;
int node[maxsize][maxsize]={0};   //节点数组
int queue[maxsize];               //队列数组
int main()
{
    int N,M,ID,K;
    cin>>N>>M;
    for(int i=0;i<M;i++){
        cin>>ID>>K;
        for(int j=0;j<K;j++){
            cin>>node[ID][j];
        }
    }
    queue[0]=1;                     //树中根节点编号为0根节点第一个孩子编号为1
    int front=0,rear=1;             //最开始队列中只有一个根节点
    bool flag=true;
    while(front<rear){
        int tag=rear;               //该层最后一节点所在下标
        int count =0;
        for(;front<tag;front++){
            int i=0;
            if(node[queue[front]][0]==0)
                count++;            //找到叶节点
            else{
                while(node[queue[front]][i]){
                    queue[rear++]=node[queue[front]][i++]; //加入队列
                }
            }
        }
        if(flag){
            flag=false;
            printf("%d",count);
        }  
        else
            printf(" %d",count);
    }
    return 0;
}

结果如下：