poj 2255 给前序中序写后序 [ 也是经典的面试题 ]

#include <iostream>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <vector>
#include <stack>
#include <deque>
#include <queue>
#include <bitset>
#include <list>
#include <map>
#include <set>
#include <iterator>
#include <algorithm>
#include <functional>
#include <utility>
#include <sstream>
#include <climits>
#include <cassert>
#define MID(x,y) ( ( x + y ) >> 1 )
#define L(x) ( x << 1 )
#define R(x) ( x << 1 | 1 )
#define BUG puts("here!!!");
#define STOP system("pause");

using namespace std;
const int N = 1005;
char pre[N], ino[N];
struct Node {
	char value;
	Node* lchild;
	Node* rchild;
};
Node* res(char* sPre, char* ePre, char* sIno, char* eIno) {
	char rv = *sPre;
	Node* root = new Node();
	root->value = rv;
	if(sPre == ePre) { //出口
		return root;
	}
	char *pr = sIno;
	while(pr <= eIno && *pr != rv) pr++;
	int leftLen = pr - sIno;
	if(leftLen > 0) {
		root->lchild = res(sPre+1, sPre+leftLen, sIno, pr-1);
	}
	if(pr < eIno) {
		root->rchild = res(sPre+leftLen+1, ePre, pr+1, eIno);
	}
	return root;
}
Node* solve(char* pre, char* ino, int len) {
	if(pre == NULL || ino == NULL || len <= 0) return NULL;
	return res(pre, pre + len-1, ino, ino + len-1);
}
void hou(Node* root) {
	if(root == NULL) return;
	if(root->lchild) hou(root->lchild);
	if(root->rchild) hou(root->rchild);
	printf("%c", root->value);
}
int main() {
	while(scanf("%s%s", pre, ino) == 2) {
		int len = strlen(pre);
		Node* root = solve(pre, ino, len);
		hou(root);
		printf("\n");
	}
	return 0;
}