03-树2 List Leaves (25 分) --------C语言

最新推荐文章于 2023-02-07 00:15:00 发布

秋包

最新推荐文章于 2023-02-07 00:15:00 发布

阅读量125

点赞数

分类专栏：数据结构文章标签： c语言

本文链接：https://blog.csdn.net/weixin_60245632/article/details/119295466

版权

数据结构专栏收录该内容

24 篇文章 1 订阅

订阅专栏

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

这题中树的构造与根节点的寻找其实在上一题《03-树1 树的同构》中已经做过了，详细可参考mooc陈越老师的数据结构课，这题关键在于树构造完成并且找到根节点之后，如何输出叶节点，而且是按照题目中的格式。哎，是不是很眼熟，就是层次遍历。

层次遍历的过程其实mooc上那个课说的很清楚，我就不解释了，上代码！

//03-树2 List Leaves
#include<stdio.h>
#define Maxtree 10
#define Null -1
#define Tree int
#include<queue>
using namespace std;

struct Tree_Node{
   int number;
   Tree left;
   Tree right;
} T[Maxtree];

Tree BuildTree(struct Tree_Node T[], int length);

int main()
{
   Tree R;
   int i=0, N=0;
   scanf("%d", &N);
   R=BuildTree(T, N);
   queue <int> qu;
   qu.push(R);
   for(i=0;i<N;i++){
       if(T[R].left!=Null) qu.push(T[R].left);
       if(T[R].right!=Null) qu.push(T[R].right);
       qu.pop();
       R=qu.front();
       if(T[R].left==Null && T[R].right==Null){
           printf("%d", R);
           if(qu.size()>1) printf(" ");
       }
   }

   return 0;
}

Tree BuildTree(struct Tree_Node T[], int length)
{
   int i=0;
   Tree root=Null;
   char cl, cr;
   int check[length];
   for( i = 0; i < length; i++ ) check[i] = 0;
   for(i=0;i<length;i++){
       scanf("%c %c %c", &T[i].number, &cl, &cr);
       if(cl!='-'){
           T[i].left=cl-'0';
           check[T[i].left]=1;
       }
       else T[i].left=Null;
       if(cr!='-'){
           T[i].right=cr-'0';
           check[T[i].right]=1;
       }
       else T[i].right=Null;
   }
   for(i=0;i<length;i++){
       if(!check[i]) {
           root=i;
           break;
       }
   }
   return root;
}