03-树2-List-Leaves

最新推荐文章于 2024-10-01 22:43:34 发布

「已注销」

最新推荐文章于 2024-10-01 22:43:34 发布

阅读量95

点赞数

分类专栏：浙大数据结构 C/C++ 文章标签：数据结构树结构

本文链接：https://blog.csdn.net/optimjie/article/details/103602890

版权

C/C++ 同时被 2 个专栏收录

7 篇文章 1 订阅

订阅专栏

浙大数据结构

4 篇文章 0 订阅

订阅专栏

这道题花费了我四个小时，但是很开心一次AC，记录一下。花这么长时间的主要原因是，在第一次想的时候在构造树的结点的时候，没有加入结点的下标，导致后面越做越麻烦，好在及时修改，只花了4个小时😁😁。

题目描述

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

AC代码

#include<iostream>
#include<vector>
using namespace std;
#define Null    -1
#define MAXSIZE 10
typedef struct BiTNode
{
	int lchild;
	int rchild;
	int index;
}BiTNode;
typedef BiTNode QElemType;
typedef struct SqQueue
{
	QElemType Data[MAXSIZE];
	int front;
	int rear;
}SqQueue;
int CreateBiTree(vector<BiTNode> &v, int n, int &leaves);
void InitQueue(SqQueue &Q);
void AddQueue(SqQueue &Q, BiTNode e);
void DeleteQueue(SqQueue &Q);
bool QueueEmpty(SqQueue Q);
bool QueueFull(SqQueue Q);
int main()
{
	int n;
	cin >> n;
	int root;
	vector<BiTNode> v;
	int leaves = 0;
	root = CreateBiTree(v, n, leaves);
	SqQueue Q;
	InitQueue(Q);
	AddQueue(Q, v[root]);
	int cnt = 0;
	while (!QueueEmpty(Q))
	{
		if (Q.Data[Q.front].lchild == Null && Q.Data[Q.front].rchild == Null)
		{
			cnt++;
			if (cnt == leaves)
				cout << Q.Data[Q.front].index;
			else
				cout << Q.Data[Q.front].index << " ";
		}
		int t = Q.Data[Q.front].index;
		DeleteQueue(Q);
		if (v[t].lchild != Null)
			AddQueue(Q, v[v[t].lchild]);
		if (v[t].rchild != Null)
			AddQueue(Q, v[v[t].rchild]);
	}

	return 0;
}
int CreateBiTree(vector<BiTNode> &v, int n, int &leaves)
{
	char l, r;
	BiTNode tmp;
	vector<int> arr(n, 1);
	for (int i = 0; i < n; i++)
	{
		tmp.index = i;
		cin >> l >> r;
		if (l == '-')
			tmp.lchild = Null;
		else
		{
			tmp.lchild = l - '0';
			arr[tmp.lchild] = 0;
		}
		if (r == '-')
			tmp.rchild = Null;
		else
		{
			tmp.rchild = r - '0';
			arr[tmp.rchild] = 0;
		}
		if (tmp.lchild == Null && tmp.rchild == Null)
			leaves++;
		v.push_back(tmp);
	}
	int i = 0;
	for (; i < n; i++)
	{
		if (arr[i] != 0)
			break;
	}
	return i;
}
void InitQueue(SqQueue &Q)
{
	Q.front = 0;
	Q.rear = 0;
}
void AddQueue(SqQueue &Q, BiTNode e)
{
	if (!QueueFull(Q))
	{
		Q.Data[Q.rear] = e;
		Q.rear = (Q.rear + 1) % MAXSIZE;
	}
}
void DeleteQueue(SqQueue &Q)
{
	if (!QueueEmpty(Q))
	{
		Q.front = (Q.front + 1) % MAXSIZE;
	}
}
bool QueueEmpty(SqQueue Q)
{
	if (Q.front == Q.rear)
		return true;
	return false;
}
bool QueueFull(SqQueue Q)
{
	if ((Q.front + MAXSIZE - Q.rear) % MAXSIZE == 1)
		return true;
	return false;
}