Leetcode 106. Construct Binary Tree from Inorder and Postorder Traversal

最新推荐文章于 2023-11-14 11:05:42 发布

zhangwj0101

最新推荐文章于 2023-11-14 11:05:42 发布

阅读量231

点赞数

分类专栏： Leetcode

本文链接：https://blog.csdn.net/zhangwj0101/article/details/51005798

版权

Leetcode 专栏收录该内容

51 篇文章 0 订阅

订阅专栏

Queston

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

Code

 public TreeNode get(int[] inorder, int[] postorder, int i, int ileft, int iright) {
        if (ileft > iright) {
            return null;
        }
        int t = ileft;
        for (t = ileft; t <= iright && inorder[t] != postorder[i]; t++) ;
        TreeNode root = new TreeNode(postorder[i]);
        root.left = get(inorder, postorder, i - 1 + t - iright, ileft, t - 1);
        root.right = get(inorder, postorder, i - 1, t + 1, iright);
        return root;

    }

    public TreeNode buildTree(int[] inorder, int[] postorder) {
        if (postorder.length != inorder.length || postorder.length < 1) {
            return null;
        }
        return get(inorder, postorder, postorder.length - 1, 0, postorder.length - 1);
    }