03-树2 List Leaves（25 分）

03-树2 List Leaves（25 分）

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$ ($\le 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

题目大意：从左到右，从上到下，输出其叶子节点。

解题思路：层序遍历，将层序遍历的输出改成判断是叶子节点之后存入容器之中，最后输出，因为输出有格式限制。

#include<iostream>
#include<queue>
#include<vector>
#include<cstring>
#include<string>
using namespace std;
typedef struct tree
{
	int Data;
	int Left;
	int Right;
}tree;
tree T[10];
queue<int>Q;
vector<int>vt;
int Build()
{
	int N;
	cin>>N;
	bool check[N];
	memset(check,false,sizeof(check));
	for(int i=0;i<N;i++)
	{
		char cl,cr;
		cin>>cl>>cr;
		T[i].Data=i;
		if(cl=='-')
		  T[i].Left=-1;
		else
		{
			T[i].Left=cl-'0';
			check[cl-'0']=true;
		}
		if(cr=='-')
		  T[i].Right=-1;
		else
		{
			T[i].Right=cr-'0';
			check[cr-'0']=true;
		}
	}
	int Root;
	int i;
	for(i=0;i<N;i++)
	{
		if(!check[i])
		  break;
	}
	Root=i;
	if(N==0)
	  Root=-1;
	return Root;
}
void Print(int Root)
{
	if(Root==-1)
	  return ;
	Q.push(Root);
	while(!Q.empty())
	{
		int t=Q.front();
		Q.pop();
		if(T[t].Left==-1&&T[t].Right==-1)
		  vt.push_back(T[t].Data);
		//cout<<T[t].Data<<" ";
		if(T[t].Left!=-1) Q.push(T[t].Left);
		if(T[t].Right!=-1) Q.push(T[t].Right);
	}
}
int main()
{
	int Root;
	Root=Build();
	Print(Root);
	vector<int>::iterator p;
	bool flag=false;
	for(p=vt.begin();p!=vt.end();p++)
	{
		if(!flag)
		  cout<<*p;
		else
		  cout<<" "<<*p;
		flag=true;
	}
	return 0;
}

注意，层序遍历的思想：根节点入队，只要队不空，取队首，输出队首对应的数据，队首的左子树，右子树分别入队。循环，这里只要把输出改成，判断叶子节点。

输出格式：最后一个不能有空格