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

最新推荐文章于 2024-07-24 20:44:05 发布

overdosed_

最新推荐文章于 2024-07-24 20:44:05 发布

阅读量38

点赞数

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

本文链接：https://blog.csdn.net/weixin_45904682/article/details/129848876

版权

leetcode 专栏收录该内容

82 篇文章 0 订阅

订阅专栏

class Solution {
    Map<Integer,Integer> map;
    public TreeNode buildTree(int[] inorder, int[] postorder) {
        map = new HashMap();
        int n = postorder.length;
        for (int i = 0; i < n; i++) {
            map.put(inorder[i],i);
        }
        return buildMyTree(postorder,inorder,0,n-1,0,n-1);
    }

    private TreeNode buildMyTree(int[] postorder, int[] inorder, int postorder_left, int postorder_right, int inorder_left, int inorder_right) {
        if(inorder_left > inorder_right){
            return null;
        }
        TreeNode root = new TreeNode(postorder[postorder_right]);
        int inorder_root = map.get(postorder[postorder_right]);
        int size_postorder_right = inorder_root - inorder_left;
        root.left = buildMyTree(postorder,inorder,postorder_left,postorder_left + size_postorder_right - 1,inorder_left,inorder_root - 1);
        root.right = buildMyTree(postorder,inorder,postorder_left + size_postorder_right,postorder_right - 1,inorder_root + 1,inorder_right);
        return root;
    }
}