【重点】【二叉树】889. 根据前序和后序遍历构造二叉树

Allenlzcoder

于 2024-01-07 17:41:36 发布

阅读量475

点赞数 9

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

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

版权

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

77 篇文章 0 订阅

订阅专栏

题目

法1：递归

在这里插入图片描述

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

    public TreeNode build(int[] preorder, int preStart, int preEnd, int[] postorder, int postStart, int postEnd) {
        if (preStart > preEnd) {
            return null;
        }
        if (preStart == preEnd) {
            return new TreeNode(preorder[preStart]);
        }
        TreeNode root = new TreeNode(preorder[preStart]);
        int lastLeftInx = -1;
        for (int i = postStart; i <= postEnd; ++i) {
            if (postorder[i] == preorder[preStart + 1]) {
                lastLeftInx = i;
                break;
            }
        }
        int leftSize = lastLeftInx - postStart + 1;
        root.left = build(preorder, preStart + 1, preStart + leftSize, postorder, postStart, lastLeftInx);
        root.right = build(preorder, preStart + leftSize + 1, preEnd, postorder, lastLeftInx + 1, postEnd - 1);
        return root;
    }

}