利用二叉树中序及先序遍历确定该二叉树的后序序列 swustoj

思路：和中序和后序确定前序差不多
#include<iostream>
#include<stdlib.h>
#include<string.h>
using namespace std;
typedef struct node
{
char data;
struct node *l,*r;
}Tree;
Tree* built(char *first,char *mid,int n)
{
char *p;
Tree *T;
int k=0;
if(n==0) return NULL;
T=(Tree *)malloc(sizeof(Tree));
T->data=*first;
for(p=mid;p<mid+n;p++)
{
if(*p==T->data) break;
k++;
}
T->l=built(first+1,mid,k);
T->r=built(first+1+k,mid+k+1,n-1-k);
return T;
}
void print(Tree *&l)
{
if(l)
{
print(l->l);
print(l->r);
cout<<l->data;
}
}
int main()
{
Tree *l;
char first[1000],mid[1000];
cin>>mid>>first;
l=built(first,mid,strlen(mid));
print(l);
return 0;
}