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.

和上一篇一样，只不过用的是后序遍历。有一点在上一篇中忘记提出来了，vector.end()指针指向的并不是vector内的数。

/** * 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) {        int size = inorder.size();        if(size==0) return NULL;        return solve(inorder.begin(),inorder.end()-1,postorder.begin(),postorder.end()-1);    }        template <typename Iter>    TreeNode *solve(Iter iFirst,Iter iLast,Iter pFirst,Iter pLast)    {        if(iFirst==iLast) return NULL;        if(pFirst==pLast) return NULL;                pLast--;        Iter iRoot = find(iFirst,iLast,*pLast);        TreeNode *root = new TreeNode(*iRoot);        int size = iRoot - iFirst;        root->left = solve(iFirst,iRoot,pFirst,pFirst+size);        root->right = solve(iRoot+1,iLast,pFirst+size,pLast);                return root;    }};