程序是替人工作的,首先自己要知道怎么还原树,才能交给计算机处理。所以可以先手动还原一下。
#include<iostream>
#include<string>
using namespace std;
class BTree
{
public:
char value;
BTree *lchild;
BTree *rchild;
};
BTree * Created(string in,string post)
{
if(in.length()==0)
return NULL;
BTree * root=new BTree;
int index;
int size;
char value;
size = in.length();
value = post[size-1];
index = in.find(value);
string l_in = in.substr(0,index);
string r_in = in.substr(index+1);
string l_post = post.substr(0,index);
string r_post = post.substr(index,size-1-index);
root->value = value;
root->lchild = Created(l_in,l_post);
root->rchild = Created(r_in,r_post);
return root;
}
void print(BTree *root,int h)
{
if(root!=NULL)
{
print(root->rchild,h+1);
for(int i=0;i<h;i++)
cout<<" ";
cout<<root->value;
print(root->lchild,h+1);
}
cout<<endl;
}
void pre_print(BTree *root)
{
if(root==NULL)
return ;
cout<<root->value;
pre_print(root->lchild);
pre_print(root->rchild);
}
int main()
{
string in,post;
cin>>in>>post;
BTree *root = NULL;
root = Created(in,post);
pre_print(root); //还原结束,前序输出
return 0;
}
运行结果