C++ 二叉树的建立以及中序遍历

最新推荐文章于 2024-09-29 17:52:02 发布

wwxy261

最新推荐文章于 2024-09-29 17:52:02 发布

阅读量753

点赞数

分类专栏：算法

本文链接：https://blog.csdn.net/wwxy1995/article/details/88584899

版权

算法专栏收录该内容

3633 篇文章 122 订阅

订阅专栏

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

Author: 陈越

Organization: 浙江大学

Time Limit: 400 ms

Memory Limit: 64 MB

Code Size Limit: 16 KB

题解

#define N 20
#include <iostream>
#include <queue>
#include <vector>

struct TreeNode {
	int val;
	TreeNode *left;
	TreeNode *right;
	TreeNode() :val(0), left(NULL), right(NULL){}
	TreeNode(int x) : val(x), left(NULL), right(NULL) {}
	
};



TreeNode* BuildTree(TreeNode tree[]) {
	//TreeNode* root = NULL;
	int flag[N] = { 0 };
	int n;
	std::cin >> n;
	for (int i = 0; i < n; i++) {
		tree[i].val = i;
		char tempLeft, tempRight;
		std::cin >> tempLeft >> tempRight;
		if (tempLeft == '-')
			tree[i].left = NULL;
		else {
			tree[i].left = &tree[tempLeft - '0'];
			flag[tempLeft - '0'] = 1;
		}

		if (tempRight == '-')
			tree[i].right = NULL;
		else {
			tree[i].right = &tree[tempRight - '0'];
			flag[tempRight - '0'] = 1;
		}
	}

	// 找根节点
	for (int i = 0; i < n; i++) {
		if (!flag[i])
			return &tree[i];
			//root = &tree[i];
	}


	return NULL;
}

std::vector<int>  levelOrder(TreeNode* root) {
	std::vector<int> res;
	std::queue<TreeNode*> q;
	q.push(root);
	while (!q.empty()) {
		TreeNode* temp = q.front();
		if (temp->left == NULL && temp->right == NULL) {
			res.push_back(temp->val);
		}
		q.pop();
		if (temp->left)
			q.push(temp->left);
		if (temp->right)
			q.push(temp->right);
	}
	return res;
}


int main() {
	TreeNode tree[N];
	TreeNode* root = NULL;
	root = BuildTree(tree);
	std::vector<int> res;
	res = levelOrder(root);
	std::cout << res[0];
	for (int i = 1; i < res.size(); i++)
		std::cout << " " << res[i];
	return 0;

}