Leetcode 题目解析之 Construct Binary Tree from Inorder and Postorder Traversal

原创

ruochen

发布于 2022-01-08 14:51:33

1.2K0

文章被收录于专栏：若尘的技术专栏若尘的技术专栏

Given inorder and postorder traversal of a tree, construct the binary tree.

Note:

You may assume that duplicates do not exist in the tree.

    int p;
    int[] postorder;
    int[] inorder;
    public TreeNode buildTree(int[] inorder, int[] postorder) {
        this.p = postorder.length - 1;
        this.inorder = inorder;
        this.postorder = postorder;
        return buildTree(0, postorder.length);
    }
    TreeNode buildTree(int start, int end) {
        if (start >= end) {
            return null;
        }
        TreeNode root = new TreeNode(postorder[p]);
        int i;
        for (i = start; i < end && postorder[p] != inorder[i]; i++)
            ;
        p--;
        root.right = buildTree(i + 1, end);
        root.left = buildTree(start, i);
        return root;
    }

原创声明：本文系作者授权腾讯云开发者社区发表，未经许可，不得转载。

如有侵权，请联系 cloudcommunity@tencent.com 删除。

binary