Construct Binary Tree from Inorder and Postorder Traversal

Given inorder and postorder traversal of a tree, construct the binary tree.

Note:
You may assume that duplicates do not exist in the tree.

题目的基本思想：递归解决。

#include <iostream>
#include <vector>

using namespace std;

struct TreeNode {
    int val;
    TreeNode *left;
    TreeNode *right;
    TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};

int searchTheRoot(vector<int> &inorder,int inBegin,int inEnd,int rootValue)
{
	int len = inorder.size();

	for(int i=inBegin;i<inEnd;i++)
	{
		if(inorder[i] == rootValue)
			return i;
	}
}

TreeNode *CBTIPT(vector<int> &inorder,int inBegin,int inEnd, vector<int> &postorder,int postBegin,int postEnd)
{
	TreeNode *root = NULL;
	if( (inEnd-inBegin)!=(postEnd-postBegin))
	{
		return root;
	}

	if(inEnd == inBegin)
	{
		return root;
	}

	int rootValue = postorder[postEnd-1];
	root = (TreeNode *)malloc(sizeof(TreeNode));
	root->val = rootValue;
	int inRootIndex = searchTheRoot(inorder,inBegin,inEnd,rootValue);
	int leftTreeSize = inRootIndex-inBegin;
	int rightTreeSize = inEnd-inRootIndex-1;

	root->left = CBTIPT(inorder,inBegin,inRootIndex, postorder,postBegin,postBegin+leftTreeSize);
	root->right = CBTIPT(inorder,inRootIndex+1,inEnd, postorder,postBegin+leftTreeSize,postEnd-1);
}

TreeNode *buildTree(vector<int> &inorder, vector<int> &postorder) {
	int inlen = inorder.size();
	int postlen = postorder.size();
	TreeNode *root = NULL;
	if(inlen != postlen || postlen == 0)
	{
		return root;
	}
	root = CBTIPT(inorder,0,inlen, postorder,0,postlen);

	return root;
}


int main(void)
{

	system("pause");
	return 0;
}