LeetCode 106. 从中序与后序遍历序列构造二叉树

题目描述

106. 从中序与后序遍历序列构造二叉树

解法：

具体从后序结果和中序结果构造二叉树的流程就不再介绍，我们这里给出一幅图说一下关于索引的确定

int leftSize = index - inStart;

root.left = build(inorder, inStart, index - 1,
                  postorder, postStart, postStart + leftSize - 1);

root.right = build(inorder, index + 1, inEnd,
                   postorder, postStart + leftSize, postEnd - 1);

完整的递归构造代码如下所示

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    TreeNode* buildTree(vector<int>& inorder, vector<int>& postorder) {
        return helper(inorder, 0, inorder.size() - 1, postorder, 0, postorder.size() - 1);
    }
    TreeNode* helper(vector<int>& inorder, int inStart, int inEnd, vector<int>& postorder, int postStart, int postEnd){
        if (inStart > inEnd) return nullptr;

        int root_val = postorder[postEnd];
        TreeNode* root = new TreeNode(root_val);

        int index = -1;
        for (int i = inStart; i <= inEnd; i++)
        {
            if (inorder[i] == root_val) 
            {
                index = i;
                break;
            }
        }

        int leftSize = index - inStart;

        root->left = helper(inorder, inStart, index - 1,
                            postorder, postStart, postStart + leftSize - 1);

        root->right = helper(inorder, index + 1, inEnd,
                             postorder, postStart + leftSize, postEnd - 1);

        return root;
    }
};