zoukankan      html  css  js  c++  java
• # 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

### 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.

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

### Sample Output:

4 1 5

测试程序：
主要思想运用层次遍历的过程，判断是否为叶子结点，即可输出。关键点在对树的创建。
#include <iostream>
#include <queue>

using namespace std;

#define  MaxTree 10
#define  ElementType int
#define  Tree int
#define  Null -1

typedef struct TreeNode
{
ElementType Data;
Tree Left;
Tree Right;
}TreeNode;

TreeNode T[MaxTree];

Tree BuildTree(TreeNode T[])
{
int N = 0;
bool Check[MaxTree];
Tree ret_root = Null;
char cl, cr;
cin >> N;

if (N)
{
for (int i = 0; i < N;i++)
{
Check[i] = false;
}
for (int i = 0; i < N;i++)
{
T[i].Data = i;
cin >> cl >> cr;
if (cl!='-')
{
T[i].Left = cl - '0';
Check[T[i].Left] = true;
}
else
{
T[i].Left = Null;
}
if (cr!='-')
{
T[i].Right = cr - '0';
Check[T[i].Right] = true;
}
else
{
T[i].Right = Null;
}
}
for (int i = 0; i < N;i++)
{
if (!Check[i])
{
ret_root = i;
break;
}
}
}
return ret_root;
}

void PrintLeaves(Tree  root)
{
if (root==Null)
{
return;
}
queue<int> Q;
Q.push(root);
int flag = 1;//输出标志
Tree temp;
while (!Q.empty())
{
temp = Q.front();
Q.pop();
if (T[temp].Left==Null&&T[temp].Right==Null)
{
if (flag)
{
cout << T[temp].Data;
flag = 0;
}
else
{
cout << " " << T[temp].Data;
}

}
else
{
if (T[temp].Left!=Null)
{
Q.push(T[temp].Left);
}
if (T[temp].Right!=Null)
{
Q.push(T[temp].Right);
}
}
}
}

int main()
{
Tree root = Null;
root = BuildTree(T);
PrintLeaves(root);
cout << endl;
return 0;
}

• 相关阅读:
Leetcode题库——40.组合总和II
（课）阅读笔记3_1
（课）学习进度报告十
（课）赛题的需求分析
（课）阅读笔记2_3
（课）学习进度报告九
（课）学习进度报告八
(tensorflow计算)如何查看tensorflow计算用的是CPU还是GPU
（课）阅读笔记2_2
（课）温昱 第三部分Refined Architecture阶段 总结
• 原文地址：https://www.cnblogs.com/ranjiewen/p/6629589.html