树的前序中序后序遍历

给出两个字符串分别代表树的前序和中序，给出后序遍历。

#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
#define MAXSIZE 26


char preOrder[MAXSIZE];
char inOrder[MAXSIZE];
char postOrder[MAXSIZE];
void calPostOrder(int preStart, int preEnd, int inStart, int inEnd, int postStart, int postEnd ){
if( preStart-preEnd != inStart-inEnd )
throw new exception();
if( preStart==preEnd ){
if( preOrder[preStart] == inOrder[inStart] )
postOrder[postStart] = preOrder[preStart];
else
throw new exception();
return;
}


int root=-1;
for(int i=inStart; i<=inEnd; i++ ){
if( inOrder[i]==preOrder[preStart] )
root=i;
}
if( root==-1 )
throw new exception();

int leftLength = root - inStart;
if( root>inStart )//有左子树
calPostOrder(preStart+1, preStart+leftLength, inStart, root-1, postStart, postStart+leftLength-1);


if( root<inEnd ){//有右子树
calPostOrder(preStart+leftLength+1, preEnd, root+1, inEnd, postStart+leftLength, postEnd-1 );
}
//根
postOrder[postEnd] = preOrder[preStart];
}


int main(){
scanf("%s%s",preOrder,inOrder);
int size1 = strlen(preOrder);
int size2 = strlen(inOrder);
if( size1!= size2 )
throw new exception();
calPostOrder(0, size1-1, 0, size1-1, 0, size1-1);
postOrder[size1] = '\0';
printf( "%s\n",postOrder );
return 0;
}