Given inorder and postorder traversal of a tree, construct the binary tree.
Note:
You may assume that duplicates do not exist in the tree.
/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
int getIndex(vector<int>& inorder,int inBegin,int inEnd,int value){
for(int i=inBegin;i<=inEnd;i++){
if(inorder[i]==value){
return i;
}
}
return -1;
}
TreeNode *buildTree(vector<int> &inorder,int inBegin,int inEnd,
vector<int> &postorder,int postBegin,int postEnd) {
if(inBegin>inEnd){
return NULL;
}
int index=getIndex(inorder,inBegin,inEnd,postorder[postEnd]);
TreeNode * root=new TreeNode(postorder[postEnd]);
int tmp=index-inBegin+postBegin;
root->left=buildTree(inorder,inBegin,index-1,postorder,postBegin,tmp-1);
root->right=buildTree(inorder,index+1,inEnd,postorder,tmp,postEnd-1);
return root;
}
TreeNode *buildTree(vector<int> &inorder, vector<int> &postorder) {
return buildTree(inorder,0,inorder.size()-1,postorder,0,postorder.size()-1);
}
};