leetcode: 889. 根据前序和后序遍历构造二叉树

最新推荐文章于 2024-02-22 20:02:10 发布

QIANYIFAN010203

最新推荐文章于 2024-02-22 20:02:10 发布

阅读量150

点赞数

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

本文链接：https://blog.csdn.net/Gomamon/article/details/106491109

版权

leetcode 专栏收录该内容

144 篇文章 1 订阅

订阅专栏

链接：https://leetcode-cn.com/problems/construct-binary-tree-from-preorder-and-postorder-traversal/
分别在前序遍历和后序遍历的数组里找到左右子树的分界点，递归求解即可。
java代码：

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public TreeNode constructFromPrePost(int[] pre, int[] post) {
        return help(pre,0, pre.length-1, post, 0, pre.length-1);
    }
    private TreeNode help(int [] pre, int prebegin,int preend, int [] post, int postbegin, int postend)
    {
        if(prebegin>preend)
            return null;
        TreeNode head = new TreeNode(pre[prebegin]);
        if(prebegin == preend)
            return head;

        int index = postbegin;
        while(post[index]!=pre[prebegin+1])
            index++;
        int lengthOfLeft = index-postbegin;
        head.left = help(pre, prebegin+1,prebegin+lengthOfLeft+1,post,postbegin,index);
        head.right = help(pre, prebegin+lengthOfLeft+2, preend, post, index+1, postend-1);
        return head;
    }
}