LeetCode 106. Construct Binary Tree from Inorder and Postorder Traversal

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.

---

题目大意:

给出一个二叉树的中序遍历和后续遍历，建立二叉树。
根据后续遍历找出根节点，在中序遍历中找出该节点的位置，所有左边的节点属于左子树，所有右边的节点属于右子树，可通过递归建树。

---

题目代码:

/**
 * 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 build(inorder, postorder, 0, inorder.size()-1, 0, postorder.size()-1);
    }
    TreeNode* build(vector<int>& inorder, vector<int>& postorder, int is, int ie, int ps, int pe){
        if(is > ie || ps > pe)
            return nullptr;
        
        TreeNode* root = new TreeNode(postorder[pe]);
        
        int i = 0;
        while(inorder[i] != root->val) i++;
        
        root->right  = build(inorder, postorder, i+1, ie, ps+i-is, pe-1);
        root->left = build(inorder, postorder, is, i-1, ps, ps+i-is-1);
        
        return root;
    }
};