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

最新推荐文章于 2024-09-06 00:45:00 发布

Allenlzcoder

最新推荐文章于 2024-09-06 00:45:00 发布

阅读量447

点赞数 9

分类专栏： labuladong的算法小抄笔记文章标签：二叉树

本文链接：https://blog.csdn.net/allenlzcoder/article/details/135442062

版权

labuladong的算法小抄笔记专栏收录该内容

77 篇文章 0 订阅

订阅专栏

题目

法1：递归构造

class Solution {
    public TreeNode buildTree(int[] inorder, int[] postorder) {
        return build(inorder, 0, inorder.length - 1, postorder, 0, postorder.length - 1);
    }

    public TreeNode build(int[] inorder, int inStart, int inEnd, int[] postorder, int postStart, int postEnd) {
        if (postStart > postEnd) {
            return null;
        }
        if (postStart == postEnd) {
            return new TreeNode(postorder[postEnd]);
        }

        TreeNode root = new TreeNode(postorder[postEnd]);
        int valInx = -1;
        for (int i = inStart; i <= inEnd; ++i) {
            if (inorder[i] == postorder[postEnd]) {
                valInx = i;
                break;
            }
        }
        int leftSize = valInx - inStart;
        root.left = build(inorder, inStart, valInx - 1, postorder, postStart, postStart + leftSize - 1);
        root.right = build(inorder, valInx + 1, inEnd, postorder, postStart + leftSize, postEnd - 1);
        return root;
    }
}