leetcode: 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.

题目解析：

 

//题目：construct-binary-tree-from-inorder-and-postorder-traversal
//使用中序和后序遍历重建二叉树
/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */

//有空间的消耗：O(2n)
//开辟vector空间，在vector中进行递归
class Solution {
public:
    TreeNode *buildTree(vector<int> &inorder, vector<int> &postorder) {
        if(inorder.empty())
            return NULL;
        vector<int> left_in,right_in,left_post,right_post;
        //后序遍历的最后一个节点是根节点
        int len = postorder.size();
        TreeNode* head = new TreeNode(postorder[len-1]);
        //在中序序列中找根节点
        int root = 0;
        for(int i = 0;i < len;++i)
        {
            if(inorder[i] == postorder[len-1])
            {
                root = i;
                break;
            }
        }
		//将中序和后序的左子树放到vector中
        for(int i = 0;i < root;++i)
        {
            left_in.push_back(inorder[i]);
            left_post.push_back(postorder[i]);
        }
		//将中序和后序的右子树放到vector中
        for(int i = root+1;i < len;++i)
        {
            right_in.push_back(inorder[i]);
            right_post.push_back(postorder[i-1]);
        }
         head->left = buildTree(left_in,left_post);
         head->right = buildTree(right_in,right_post);
         return head;
    }
};

//方法二：
//直接在原区间上进行递归。
/**
 * Definition for binary tree
 * 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) {
        int len_in = inorder.size();
        int len_post = postorder.size();
        return _build(inorder,0,len_in-1,postorder,0,len_post-1);
    }
    
    TreeNode* _build(vector<int>& inorder,int istart,int iend,vector<int>& postorder,int pstart,int pend)
    {
        if(istart > iend)
            return NULL;
        TreeNode* head = new TreeNode(postorder[pend]);
        int root = 0;
        for(root = istart;root <= iend;++root)
        {
            if(inorder[root] == head->val)
                break;
        }
        int left_len = root-istart;
        head->left = _build(inorder,istart,root-1,postorder,pstart,pstart+left_len-1);
        head->right = _build(inorder,root+1,iend,postorder,pstart+left_len,pend-1);
        return head;
    }
};

(*^▽^*)

还有一道使用前序和中序序列重建二叉树，思路类似：https://blog.csdn.net/Qiana_/article/details/81639227