2021-10-18 递归法构造一棵二叉树

最新推荐文章于 2024-09-13 17:05:05 发布

hyy_0224

最新推荐文章于 2024-09-13 17:05:05 发布

阅读量89

点赞数

分类专栏：算法和数据结构

本文链接：https://blog.csdn.net/qq_36647920/article/details/120836573

版权

二叉树递归层次遍历树构造 C++

关键词由CSDN通过智能技术生成

算法和数据结构专栏收录该内容

10 篇文章 0 订阅

订阅专栏

递归法构造一棵二叉树
注意事项：
1、stoi(s)函数，使用时，s不可以为空
2、TreeNode结构体，构造函数成员初始化列表的写法:

TreeNode(int val, TreeNode* left, TreeNode* right)
 :val(val),left(left),right(right){
	}

下面是源代码，没有考虑节点为null的情况，考虑后面添加

#include<iostream>
#include<vector>
#include<string>
#include<deque>
using namespace std;

struct TreeNode {
	int val;
	TreeNode* left, * right;
	TreeNode(int val, TreeNode* left, TreeNode* right) :val(val),left(left),right(right){
	}
};
TreeNode* TreeBuild(vector<int> &v,int index) {
	//怎么建呢
	TreeNode* left, * right;
	int n = v.size();
	if (2 * index + 1 >= n) left = nullptr;
	else left = TreeBuild(v, 2 * index + 1);
	if (2 * index + 2 >= n) right = nullptr;
	else right = TreeBuild(v, 2 * index + 2);
	TreeNode* root=new TreeNode(v[index],left,right);
	return root;
}
int main() {
	string s;
	getline(cin,s);
	//cin >> s;
	vector<int> v;
	for (int i = 0; i < s.size(); ) {
		while(i<s.size()&&s[i]==' ') i++;
		string st;
		while (i < s.size() && s[i] != ' ') {
			st += s[i];
			i++;
		}
		if (!st.empty()) v.push_back(stoi(st));
	}
	//构造二叉树
	TreeNode* root = TreeBuild(v, 0);
	
	deque<TreeNode*> deq;
	deq.push_back(root);
	int j = 1;
	while (!deq.empty()) {
		cout << "第"<<j++<<"层";
		int N = deq.size();
		for (int i = 0; i < N; i++) {
			if (deq[0]->left) deq.push_back(deq[0]->left);
			if (deq[0]->right) deq.push_back(deq[0]->right);
			cout << deq[0]->val << " ";
			deq.pop_front();
		}
		cout << endl;
	}
	delete root;
	return 0;
}