Construct Binary Tree from Preorder and Inorder Traversal

Given preorder and inorder 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 *CBTPIT(vector<int> &inorder,int inBegin,int inEnd, vector<int> &preorder,int preBegin,int preEnd)
{
	TreeNode *root = NULL;
	if( (inEnd-inBegin)!=(preEnd-preBegin))
	{
		return root;
	}

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

	int rootValue = preorder[preBegin];
	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 = CBTPIT(inorder,inBegin,inRootIndex, preorder,preBegin+1,preBegin+1+leftTreeSize);
	root->right = CBTPIT(inorder,inRootIndex+1,inEnd, preorder,preBegin+1+leftTreeSize,preEnd);
}

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

	return root;
}


int main(void)
{

	system("pause");
	return 0;
}