leetcode_115 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.

For example, given

inorder = [9,3,15,20,7]
postorder = [9,15,7,20,3]

Return the following binary tree:

    3
   / \
  9  20
    /  \
   15   7

中序遍历和后续遍历组建二叉树

中序遍历：开始索引，结束索引

后序遍历：结束索引

代码如下：

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    TreeNode* buildTREE(vector<int>& inorder,int istart,int iend,
                       vector<int>& postorder,int pend)
    {
        if(istart > iend || pend < 0)
            return NULL;
        TreeNode* root = new TreeNode(postorder[pend]);
        int index = istart;
        while(inorder[index] != postorder[pend])
        {    
            index++;
        }
        root->left = buildTREE(inorder,istart,index-1,postorder,pend-(iend-index)-1);
        root->right = buildTREE(inorder,index+1,iend,postorder,pend-1);
        return root;
    }
    TreeNode* buildTree(vector<int>& inorder, vector<int>& postorder) {
       return buildTREE(inorder,0,inorder.size()-1,postorder,postorder.size() - 1); 
    }
};