leetcode106/105.从中序与后序(/前序)遍历构造二叉树(java)：分治

最新推荐文章于 2022-03-25 22:44:03 发布

wmtmw

最新推荐文章于 2022-03-25 22:44:03 发布

阅读量95

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/yinianxx/article/details/106492439

版权

leetcode 专栏收录该内容

87 篇文章 0 订阅

订阅专栏

题目
在这里插入图片描述
代码

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
   public TreeNode buildTree(int[] inorder, int[] postorder) {
        TreeNode root = helper(inorder,0,inorder.length-1,postorder,0,inorder.length-1);
        return root;
    }
    public TreeNode helper(int[] inorder, int inLeft,int inRight, int[] postorder,int postLeft,int postRight){
        if(inLeft > inRight || postLeft > postRight){
            return null;
        }
        int pivot = postorder[postRight];
        TreeNode root = new TreeNode(pivot);
        int pivotIndex = inLeft;
        while(inorder[pivotIndex] != pivot){
            pivotIndex++;
        }
        root.left = helper(inorder,inLeft,pivotIndex-1,postorder,postLeft,postLeft+(pivotIndex-1-inLeft));
        root.right = helper(inorder,pivotIndex+1,inRight,postorder,postLeft+(pivotIndex-inLeft),postRight-1);
        return root;
    }

}

从中序和前序遍历构造二叉树

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public TreeNode buildTree(int[] preorder, int[] inorder) {
        return helper(preorder,0,preorder.length-1,inorder,0,inorder.length-1);
    }
    public TreeNode helper(int[] preorder,int preLeft,int preRight,int[] inorder,int inLeft, int inRight){
        if(preLeft > preRight || inLeft > inRight){
            return null;
        }
        int pivot = preorder[preLeft];
        TreeNode root = new TreeNode(pivot);
        int pivotIndex = inLeft;
        while(inorder[pivotIndex] != pivot){
            pivotIndex++;
        }
        root.left = helper(preorder,preLeft+1,preLeft+(pivotIndex-inLeft),inorder,inLeft,pivotIndex-1);
        root.right = helper(preorder,preLeft+(pivotIndex-inLeft)+1,preRight,inorder,pivotIndex+1,inRight);
        return root;
    }
}