[LeetCode] Construct Binary Tree from Inorder and Postorder Traversal

[Problem]

Given inorder and postorder traversal of a tree, construct the binary tree.

Note:
You may assume that duplicates do not exist in the tree.

[Solution]

class Solution {
public:
    // find element in an array
    int find(vector<int> &array, int start, int end, int element){
        for(int i = start; i <= end; ++i){
            if(array[i] == element){
                return i;
            }
        }
        return -1;
    }
   
    // build tree
    TreeNode *buildTree(vector<int> &inorder, int s1, int e1, vector<int> &postorder, int s2, int e2){
        if(s1 > e1 || s2 > e2)    return NULL;
   
        // check invalid
        int rootIndex = find(inorder, s1, e1, postorder[e2]);
        if(-1 == rootIndex){
            return NULL;
        }
   
        // set root node
        TreeNode *root = new TreeNode(postorder[e2]);
   
        // build left brunch and right brunch
        int rightLen = e1 - rootIndex;
        TreeNode *left = buildTree(inorder, s1, rootIndex - 1, postorder, s2, e2 - rightLen - 1);
        TreeNode *right = buildTree(inorder, rootIndex + 1, e1, postorder, e2 - rightLen, e2 - 1);
   
        // set left brunch and right brunch
        root->left = left;
        root->right = right;
       
        return root;
    }
   
    // build tree
    TreeNode *buildTree(vector<int> &inorder, vector<int> &postorder) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        TreeNode *root = buildTree(inorder, 0, inorder.size()-1, postorder, 0, postorder.size()-1);
        return root;
    }
};

说明：版权所有，转载请注明出处。 Coder007的博客