03-树2. List Leaves

最新推荐文章于 2024-06-05 23:00:03 发布

lulu901130

最新推荐文章于 2024-06-05 23:00:03 发布

阅读量385

点赞数

分类专栏： pat-mooc

本文链接：https://blog.csdn.net/lulu901130/article/details/44701317

版权

pat-mooc 专栏收录该内容

6 篇文章 0 订阅

订阅专栏

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

/**************************************************
思路： 首先需要找到树的根节点，遍历每个节点的孩子，
因为根节点不作为其他任何节点的孩子，因此没有在孩子
域中找到的节点下标即使根节点下标
*************************************************/
#include<cstdio>
#include<cctype>
#include<cstring>
#include<cstdlib>
#include<queue>
using namespace std;

typedef struct Node
{
	int left;
	int right;
	Node():left(-1),right(-1){}
}Node;

void find_leaves(int k, Node a[], int n)
{
	int temp = k;
	queue<int> Q;
	int flag = 0;
	Q.push(temp);
	while(!Q.empty())
	{
		if(a[Q.front()].left == -1 && a[Q.front()].right == -1)
		{
			if(!flag)
			{
				printf("%d", Q.front());
				flag = 1;
			}
			else
				printf(" %d", Q.front());
		}
		else
		{
			if(a[Q.front()].left != -1)
				Q.push(a[Q.front()].left);
			if(a[Q.front()].right != -1)
				Q.push(a[Q.front()].right);
		}
		Q.pop();
	}
	printf("\n");
}

int main()
{
	int n;
	scanf("%d", &n);
	getchar();

	Node *a = new Node[n];
	int *root = new int[n];
	memset(root, 0, n*sizeof(int));
	
	int i;
	for(i=0; i<n; i++)
	{
		char l, r;
		scanf("%c %c", &l, &r);
		getchar();
		if(isdigit(l))
		{
			a[i].left = l - 48;
			root[a[i].left] = 1;
		}
		if(isdigit(r))
		{
			a[i].right = r - 48;
			root[a[i].right] = 1;
		}
	}

	for(i=0; i<n; i++)
	{
		if(root[i] != 1)
		{
			find_leaves(i, a, n);
			break;
		}
	}

	system("pause");
	return 0;
}