LeetCode 106. Construct Binary Tree from Inorder and Postorder Traversal

描述

给出中序与后序遍历顺序，重建二叉树

解决

利用后序遍历找根节点，把中序遍历分成两部分，递归

---

/**
* 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) {
        int ed_in = inorder.size(), ed_po = postorder.size();
        return help(inorder, 0, ed_in - 1, postorder, 0, ed_po - 1);
    }
    TreeNode* help(vector<int> &inorder, int st_in, int ed_in, vector<int> &postorder, int st_po, int ed_po)
    {
        if (st_in > ed_in || st_po > ed_po)
            return NULL;
        int pos = -1;
        for (int i = st_in; i <= ed_in; ++i)
        {
            if (inorder[i] == postorder[ed_po])
            {
                pos = i;
                break;
            }
        }
        TreeNode *root = new TreeNode(postorder[ed_po]);
        root -> left = help(inorder, st_in, pos - 1, postorder, st_po, ed_po - (ed_in - pos) - 1);
        root -> right = help(inorder,pos + 1 , ed_in, postorder, ed_po - (ed_in - pos), ed_po - 1);
        return root;
    }
};