leetcode 889. Construct Binary Tree from Preorder and Postorder Traversal（前序和后序遍历数组复原二叉树）

最新推荐文章于 2022-06-28 20:08:49 发布

蓝羽飞鸟

最新推荐文章于 2022-06-28 20:08:49 发布

阅读量85

点赞数

分类专栏： leetcode 文章标签： leetcode 算法

本文链接：https://blog.csdn.net/level_code/article/details/111659159

版权

leetcode 专栏收录该内容

490 篇文章 4 订阅

订阅专栏

Return any binary tree that matches the given preorder and postorder traversals.

Values in the traversals pre and post are distinct positive integers.

Example 1:

Input: pre = [1,2,4,5,3,6,7], post = [4,5,2,6,7,3,1]
Output: [1,2,3,4,5,6,7]

Note:
1 <= pre.length == post.length <= 30
pre[] and post[] are both permutations of 1, 2, …, pre.length.
It is guaranteed an answer exists. If there exists multiple answers, you can return any of them.

从前序遍历和后序遍历数组复原二叉树

思路：
前序遍历数组第一个元素是root，后序遍历数组最后一个元素是root
剩下的只需要知道左右子树的范围就可以递归构造二叉树了

前序遍历数组：[root, root.left, root.right],
后序遍历数组：[root.left, root.right, root]

而可以知道前序遍历数组的第二个元素是左子树的root，只需要在后序遍历数组中找到这个对应的root，就可确定左子树的长度了

	public TreeNode constructFromPrePost(int[] pre, int[] post) {
        int n = pre.length;
        return helper(pre, post, 0, n-1, 0, n-1);
    }
    
    TreeNode helper(int[] pre, int[] post, int preS, int preE,
                   int postS, int postE) {
        if(preS > preE || postS > postE) return null;
        TreeNode root = new TreeNode(pre[preS]);
        if(preS + 1 > preE) return root;
        
        int leftRoot = pre[preS+1];
        int leftLen = 0;
        
        for(int i = postS; i <= postE; i++) {
            if(post[i] == leftRoot) {
                leftLen = i - postS + 1;
                break;
            }
        }
        
        root.left = helper(pre, post, preS+1, preS+leftLen, postS, postS+leftLen-1);
        root.right = helper(pre, post, preS+leftLen+1, preE, postS+leftLen, 
                            postE-1);
        return root;
    }