LeetCode | 106. 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(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    TreeNode* backInPost(vector<int>& inorder, vector<int>& postorder, int i_start, int i_end, int p_start, int p_end) {
        TreeNode* root = new TreeNode(postorder[p_end - 1]);
        int i_mid, p_mid = p_end - 1;
        for(int i = i_end - 1; i >= i_start; i--, p_mid--)
        {
            if(postorder[p_end - 1] == inorder[i])
            {
                i_mid = i;
                break;
            }
        }
        if(i_mid != i_start)
            root->left = backInPost(inorder, postorder, i_start, i_mid, p_start, p_mid);
        if(i_mid != i_end - 1)
            root->right = backInPost(inorder, postorder, i_mid+1, i_end, p_mid, p_end-1);
        return root;
    }
    TreeNode* buildTree(vector<int>& inorder, vector<int>& postorder) {
        if(inorder.size() < 1 || postorder.size() < 1)
            return NULL;
        return backInPost(inorder, postorder, 0, inorder.size(), 0, postorder.size());
    }
};

一次AC again~^0^