1004 Counting Leaves (30)（30 分）树的遍历

最新推荐文章于 2020-10-09 18:30:44 发布

大山喵

最新推荐文章于 2020-10-09 18:30:44 发布

阅读量3.8k

点赞数 15

分类专栏： PAT-Advanced Level 文章标签： PAT C++ 广度优先遍历深度优先遍历树

本文链接：https://blog.csdn.net/CV_Jason/article/details/80901866

版权

本文介绍了一道PAT题目，要求统计树结构中的叶子节点数量，分别使用深度优先和广度优先遍历算法进行解题，并提供了AC代码。通过此题，作者反思了数据结构学习中的动手实践问题。

摘要由CSDN通过智能技术生成

1 题目

A family hierarchy is usually presented by a pedigree tree. Your job is to count those family members who have no child.

Input

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.

Output

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

题目链接： https://pintia.cn/problem-sets/994805342720868352/problems/994805521431773184

2 解题思路

　　给你一个家谱，找到没有孩子的人。换言之，该题用来统计树结构中的叶子结点，可以采用深度优先遍历算法来进行统计。
　　我们采用vector数组作为树的存储结构，std提供了较为强大的函数方便使用。将树结点逐一输入到vector 中，每一个元素存储了该结点的子孩子信息，自动向下探索子孩子，直到vector[i].size()==0表明该结点的子孩子为零，即叶子结点。
　　可以采用循环结构来进行上述遍历，访问每一个结点，也可以使用递归结构。同时，每往下探测一层，需要一个变量来统计所在的层次数，以便统计每层的叶子结点个数。

3 AC代码

/*
** @Brief:No.1004 of PAT advanced level.
** @Author:Jason.Lee
** @Date:2018-7-3 
*/

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;

vector<int> v[100];
int book[100];
int maxDepth=-1; 

void dfs(int index,int depth){
   
	// 此时第index结点已经没有子结点了，则表明是叶子结点 
	if(v[index].