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:
TreeNode *buildTree(vector<int> &inorder, vector<int> &postorder) {
return creatTree(inorder, 0, inorder.size() - 1, postorder, 0, postorder.size() - 1);
}
TreeNode *creatTree(vector<int> &inorder, int iL, int iR, vector<int> &postorder, int pL, int pR) {
if (pL > pR)
return NULL;
if (pL == pR)
return new TreeNode(postorder[pR]);
TreeNode *head = new TreeNode(postorder[pR]);
int mid = iL;
while (mid <= iR && inorder[mid] != postorder[pR])
mid++;
head->left = creatTree(inorder, iL, mid - 1, postorder, pL, pR - iR + mid- 1);
head->right = creatTree(inorder, mid + 1, iR, postorder, pR - iR + mid, pR - 1);
return head;
}
};