举例:pred[]/先序:A、B、D、E、C、F、G;
inod[]/中序:D、B、E、A、C、G、F;
后序遍历序列是:D、E、B、G、F、C、A
代码如下:
#include<iostream>
#include<cstring>
using namespace std;
void pre_in_showtree(char pre[], char in[], int pre_s, int pre_e, int in_s, int in_e)
{
if(pre_s <= pre_e)
{
int k;
//找到先序序列最低位在中序序列中的位置
for(k=in_s; k<=in_e; ++k)
if(pre[pre_s] == in[k])
break;
//分治为先序序列和中序序列的左子树。
pre_in_showtree(pre, in, pre_s+1, pre_s+k-in_s, in_s, k-1);
//分治为先序序列和中序序列的右子树。
pre_in_showtree(pre, in, pre_s+k-in_s+1, pre_e, k+1, in_e);
//输出后序的结点
cout<<in[k]<<" ";
}
}
int main()
{
char pre[] = "ABDECFG";
char in[] = "DBEACGF";
pre_in_showtree(pre, in, 0, strlen(pre)-1, 0, strlen(in)-1);
return 0;
}
延伸可得到,根据二叉树S的前序遍历和中序遍历序列建立唯一的二叉树,代码如下:
#include<iostream>
#include<cstring>
using namespace std;
typedef struct BTNode
{
char c;
struct BTNode *lchild;
struct BTNode *rchild;
}BTNode;
BTNode* create_tree(char *pre, char *in, int pre_l, int pre_h, int in_l, int in_h)
{
if(pre_l > pre_h)
return NULL;
else
{
BTNode *root = (BTNode*)malloc(sizeof(BTNode));
root->c = pre[pre_l];
int k;
for(k=in_l; k<=in_h; ++k)
if(pre[pre_l] == in[k])
break;
root->lchild = create_tree(pre, in, pre_l+1, pre_l+k-in_l, in_l, k-1);
root->rchild = create_tree(pre, in, pre_l+k-in_l+1, pre_h, k+1, in_h);
return root;
}
}
//后序遍历
void show_tree_post(BTNode *root)
{
if(root != NULL)
{
show_tree_post(root->lchild);
show_tree_post(root->rchild);
printf("%c ", root->c);
}
}
void main()
{
char pre[] = "ABDECFG";
char in[] = "DBEACGF";
BTNode *root = create_tree(pre, in, 0, strlen(pre)-1, 0, strlen(in)-1);
show_tree_post(root);
}