(2)二叉树由后序(LRD)和中序(LDR)得到前序(DLR)

二叉树由后序(LRD)和中序(LDR)得到前序(DLR)

具体代码

/*
DCBHKGFEA 后序
BDCAEHGkF 中序
ABCDEFGHK 前序

思路:根据后序找根节点->分割中序->在分割出来的中序里继续找根节点.............

*/

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

void MidSplitToTwoArray(const int mid, const string zhongxv, string &midleft, string &midright)//分割中序字符串
{
	for (int i = 0; i < zhongxv.size(); i++)
	{
		if (i < mid)
			midleft = midleft + zhongxv[i];
		if (i > mid)
			midright = midright + zhongxv[i];
	}//切割中序
}

void HouSplitToTwoArray(const int houxvleftsize, const string houxv, string &houleft, string &houright)//切割后序字符串
{
	for (int i = 0; i <= houxv.size() - 2; i++)//因为最后一位是已经求出来了的根节点
	{
		if (i < houxvleftsize)
			houleft = houleft + houxv[i];
		if (i >= houxvleftsize)
			houright = houright + houxv[i];
	}//切割后序
}

void findRoot(string houxv,string zhongxv)//每次都找出根节点,一批一批的找,好像一不小心写成了得到前序的代码(本来还不知道中序后序得到前序是怎么写的...)
{
	//后序找根节点,中序分割出两个数组
	//cout << "当前后序:" << houxv<< endl;
	//cout << "当前中序:" << zhongxv<< endl;
	int num = houxv.size();
	cout<< houxv[num - 1];//输出根节点
	//cout << "			根节点" << houxv[num - 1]<< endl;//输出根节点
	if (num>1)//还可以继续分割,没结束
	{
		int mid=-1;
		for (int i = 0; i < num; i++)
		{
			if (zhongxv[i] == houxv[num - 1])//找到中序里面的分割点
			{
				mid = i;
				break;
			}
		}
		string midleft="";//左子树中序
		string midright="";//右子树中序
		string houleft="";//左子树后序
		string houright="";//右子树后序
		MidSplitToTwoArray(mid,zhongxv,midleft,midright);//切割中序
		int houxvleftsize = midleft.size();
		HouSplitToTwoArray(houxvleftsize,houxv,houleft,houright);//切割后序

		//cout << "houleft:" << houleft << "		midleft:" << midleft << endl;
		//cout << "houright:" << houright << "		midright:" << midright << endl;
		
		
		//cout << endl;

		if(midleft.size()!=0 && houleft.size()!=0)
		//在剩余的节点中重新找根节点
			findRoot(houleft, midleft);
		if (midright.size() != 0 && houright.size() != 0)
			findRoot(houright, midright);
	}
	
	
}




int main()
{
	string houxv;
	string zhongxv;
	cout << "请输入二叉树的后序遍历:";
	getline(cin, houxv);
	cout << "请输入二叉树的中序遍历:";
	getline(cin, zhongxv);

	cout << "得到的先序遍历:";
	findRoot(houxv,zhongxv);//感觉不知不觉写出了 由 后序 中序 得到前序...
	return 0;
}

程序运行