二叉树的建立（后序+中序）

106. Construct Binary Tree from Inorder and Postorder Traversal

/**
 * Definition for a binary tree node.
 * 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) 
    {
        if(postorder.empty())
            return 0;
        return createChild(inorder.begin(), inorder.end()-1, postorder.begin(), postorder.end()-1);
    }

    TreeNode* createChild(vector<int>::iterator obegin, vector<int>::iterator oend, vector<int>::iterator pbegin, vector<int>::iterator pend)
    {
        if(pbegin > pend)
            return 0;
        TreeNode* root = new TreeNode(*pend);
        if(pbegin == pend)
            return root;

        vector<int>::iterator it = find(obegin, oend+1, *pend);
        int l = distance(obegin, it)-1;

        root->left = createChild(obegin, it-1, pbegin, pbegin+l);
        root->right = createChild(it+1, oend, pbegin+l+1, pend-1);
        return root;
    }
};