已知前序中序建立二叉树并以后序输出

最新推荐文章于 2022-09-12 08:52:15 发布

Lilacyang

最新推荐文章于 2022-09-12 08:52:15 发布

阅读量349

点赞数

本文链接：https://blog.csdn.net/weixin_44421679/article/details/93651257

版权

这篇博客介绍了如何根据已知的二叉树前序和中序遍历序列来构建二叉树，并进一步输出其后序遍历序列。

摘要由CSDN通过智能技术生成

已知前序中序建立二叉树并以后序输出

# include <iostream>
# include <cstdio>
# include <cmath>
# include <cctype>
# include <map>
# include <string>
# include <stack>

using namespace std;


typedef struct treenode
{
	char data;
	treenode* lchild;
	treenode* rchild;
}tn, * ptn;

int cnt=0;

ptn creatree(string s1, string s2);
void postorder(ptn t);
int findl(char key, string s);

int main()
{
	string s1, s2;
	cin >> s1 >> s2;
	ptn head = creatree(s1,s2);
	postorder(head);
	return 0;
}

ptn creatree(string s1,string s2)
{
	if (!s1.length())return NULL;
	ptn m = new tn;
	char key = s1[0];
	int len = s1.length();
	m->data =key ;//根节点
	int pos = findl(key, s2);
	string a = s1.substr(1, pos);
	string b = s2.substr(0, pos);
	m->lchild = creatree(a, b);
	a = s1.substr(pos+1, len-pos-1);
	b = s2.substr(pos+1, len-pos);
	m->