leetcode 106

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]

/**
 * 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) {
        TreeNode* root = NULL;
        if (inorder.size())
            root = BuildTree(inorder, postorder, 0, inorder.size() - 1, 0, inorder.size() - 1);
        return root;
    }
    
    TreeNode* BuildTree(vector<int>& inorder, vector<int>& postorder, int il, int ir, int pl, int pr) {
        int index = 0;
        int lenl = 0;
        int lenr = 0;
        TreeNode* root = new TreeNode(postorder[pr]);
        for (index  = 0; inorder[index] != postorder[pr]; index++);
        lenl = index - il;
        lenr = ir - index;
        
        if (lenl) {
            root -> left = BuildTree(inorder, postorder, il, il + lenl -1, pl, pl + lenl - 1);
        } else {
            root -> left = NULL;
        }
        
        if (lenr) {
            root -> right = BuildTree(inorder, postorder, ir - lenr + 1, ir, pr - lenr, pr -1);
        } else {
            root -> right  = NULL;
        }
        return root; 
    }
};