03-树2 List Leaves (过程讲解)

先看一下题目:

Given a tree, you are supposed to list all the leaves in the order of top down, and left to right.

Input Specification:

Each input file contains one test case. For each case, the first line gives a positive integer N (≤10) which is the total number of nodes in the tree -- and hence the nodes are numbered from 0 to N−1. Then N lines follow, each corresponds to a node, and gives the indices of the left and right children of the node. If the child does not exist, a "-" will be put at the position. Any pair of children are separated by a space.

Output Specification:

For each test case, print in one line all the leaves' indices in the order of top down, and left to right. There must be exactly one space between any adjacent numbers, and no extra space at the end of the line.

Sample Input:

8
1 -
- -
0 -
2 7
- -
- -
5 -
4 6

Sample Output:

4 1 5

 

题目如上，我们先来分析一下:

给一个树，我们需要把该树的所有叶子节点按照从上到下，从左到右的顺序输出。仔细一想，这不就是按照层序遍历的顺序输出吗。

然后接着看：

第一行输入是一个N 意思是: 给我们一个不超过N(10)个节点的树，而且树的节点按照0到N-1的顺序排列。

然后接下来的N行分别表示从0到N-1个节点的左孩子和右孩子的位置。

比如说第一项(sample input的第二行): " 1 - " 表示第0个节点的左孩子是第1个节点，也就是第三行的" - - "，右孩子是"-", "-"表示没有孩子。

所以说这些节点的输入是没有顺序的，我们需要把这个树保存起来，然后找到根节点，进行层序遍历，最后输出叶子节点。

我们先来看一下main函数，需要做的事情就是读入树，然后遍历并输出。

int head;//存放树的头节点
int intputNums;//存放输入的总节点数

int main() {