Construct Binary Tree from Inorder and Postorder Traversal

题目名称
106. Construct Binary Tree from Inorder and Postorder Traversal

描述
Given inorder and postorder traversal of a tree, construct the binary tree.
分析
  这题同样是见我的博客二叉树——根据二叉树遍历序列构造二叉树

C++代码

/**
 * 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) {
        return create(inorder,postorder,
        0,inorder.size()-1,0,postorder.size()-1);
    }
    TreeNode* create(vector<int>& inorder,vector<int>& postorder,int il,int ir,int pl,int pr) {
        if(pl>pr) return nullptr;
        TreeNode* node = new TreeNode(postorder[pr]);
        int pos=0;
        for(int i = il;i<=ir;i++) {
            if(inorder[i] == node->val){
                pos = i;
                break;
            }
        }
        node->left = create(inorder,postorder,il,pos-1,pl,pl+pos-il-1);
        node->right = create(inorder,postorder,pos+1,ir,pl+pos-il,pr-1);
        return node;
    }
};