Leetcode 889: Construct Binary Tree from Preorder and Postorder Traversal (二叉树构建好题)

最新推荐文章于 2024-10-01 05:04:32 发布

纸上得来终觉浅绝知此事要躬行

最新推荐文章于 2024-10-01 05:04:32 发布

阅读量364

点赞数 6

分类专栏： algorithm-design 文章标签： leetcode 算法职场和发展

本文链接：https://blog.csdn.net/roufoo/article/details/135653651

版权

algorithm-design 专栏收录该内容

817 篇文章 4 订阅

订阅专栏

Construct Binary Tree from Preorder and Postorder Traversal
Medium

Given two integer arrays, preorder and postorder where preorder is the preorder traversal of a binary tree of distinct values and postorder is the postorder traversal of the same tree, reconstruct and return the binary tree.

If there exist multiple answers, you can return any of them.

Example 1:

Input: preorder = [1,2,4,5,3,6,7], postorder = [4,5,2,6,7,3,1]
Output: [1,2,3,4,5,6,7]
Example 2:

Input: preorder = [1], postorder = [1]
Output: [1]

Constraints:

1 <= preorder.length <= 30
1 <= preorder[i] <= preorder.length
All the values of preorder are unique.
postorder.length == preorder.length
1 <= postorder[i] <= postorder.length
All the values of postorder are unique.
It is guaranteed that preorder and postorder are the preorder traversal and postorder traversal of the same binary tree.

解法1：注意构建的二叉树不唯一。如果root只有一个子节点，有可能左子树为空，也有可能右子树为空。这里我们假定这种情况左子树存在，右子树为空。

/**
 * 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* constructFromPrePost(vector<int>& preorder, vector<int>& postorder) {
        int n = preorder.size(), n2 = postorder.size();
        if (n == 0 || n != n2) return NULL;
        for (int i = 0; i < n; i++) {
            um[postorder[i]] = i;
        }
        return helper(preorder, 0, n - 1, postorder, 0, n - 1);
    }
private:
    unordered_map<int, int> um; //<value, index in postorder>
    TreeNode *helper(vector<int>& preorder, int start1, int end1, vector<int>& postorder, int start2, int end2) {
        if (start1 > end1) return NULL;
        TreeNode *root = new TreeNode(preorder[start1]);
        if (start1 == end1) return root;
        int leftIndex = um[preorder[start1 + 1]]; //这里是start1!
        int leftSize = leftIndex - start2 + 1; //注意是start2，不是start1!!!
        root->left = helper(preorder, start1 + 1, start1 + leftSize, postorder, start2, leftIndex - 1);
        root->right = helper(preorder, start1 + leftSize + 1, end1, postorder, leftIndex + 1, end2 - 1);
        return root;
    }
};