代码如下:
#include <iostream>
#include<cstdio>
#include<string.h>
#include<string>
using namespace std;
//先定义树的结构体
struct treenode{
char data;
treenode* left;
treenode* right;
treenode(char c){
data=c;
left=nullptr;
right=nullptr;
}
};
//建树
treenode * build(string preorder,string inorder){
if(preorder.size()==0){
return nullptr;
}
//先序的第一个结点为树的根节点
char c=preorder[0];
//treenode node1(c);//建立好了根节点
treenode *node=new treenode(c);//new创建对象需要指针接收,一处初始化,多处使用
//*node=node1;
int position=inorder.find(c);
node->left=build(preorder.substr(1,position),inorder.substr(0,position));
node->right=build(preorder.substr(position+1),inorder.substr(position+1));
return node;
}
void postorder(treenode *node){//后序遍历树
if(node==nullptr){
return;
}
postorder(node->left);
postorder(node->right);
printf("%c",node->data);
}
int main()
{string preorder;
string inorder;
//scanf("%s%s",&preorder,&inorder);//scanf("%s")可以用来输入字符数组的字符串,但是在c++中会出错,但是不会报错
cin>>preorder;
cin>>inorder;
//printf("%s %s",preorder,inorder);
//cout<<preorder<<" "<<inorder<<endl;
treenode *root=build(preorder,inorder);
postorder(root);
return 0;
}