Leetcode-105. Construct Binary Tree from Preorder and Inorder Traversal-CSDN博客

本文介绍了一种通过给定的先序遍历和中序遍历序列来构建二叉树的方法。作者分享了一个Java实现的解决方案，并附带了完整的代码示例。

前言：为了后续的实习面试，开始疯狂刷题，非常欢迎志同道合的朋友一起交流。因为时间比较紧张，目前的规划是先过一遍，写出能想到的最优算法，第二遍再考虑最优或者较优的方法。如有错误欢迎指正。博主首发CSDN，mcf171专栏。

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

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

这个题目忘记了中序遍历和先序遍历的方式。。捣鼓了半天。。 Your runtime beats 41.62% of java submissions.

public class Solution {
    public TreeNode buildTree(int[] preorder, int[] inorder) {

        return generateBT(inorder,preorder,0,inorder.length-1,0,preorder.length-1);
    }


    public TreeNode generateBT(int[] inorder,int[] preorder, int inStart,int inEnd,int preStart,int preEnd){

        if(inStart > inorder.length - 1 || inEnd < 0 || preStart > preorder.length -1 || preEnd < 0) return null;
        if(inStart > inEnd || preStart > preEnd) return  null;
        TreeNode root = new TreeNode(preorder[preStart]);
        int rootIndex = inStart;
        for(int i = inStart; i <= inEnd; i ++){
            if(inorder[i] == root.val){rootIndex = i;break;}
        }

        TreeNode leftNode = generateBT(inorder,preorder,inStart,rootIndex-1,preStart + 1,preStart + rootIndex - inStart );
        TreeNode rightNode = generateBT(inorder,preorder,rootIndex+1,inEnd,preStart + rootIndex - inStart + 1,preEnd);

        root.left = leftNode;
        root.right = rightNode;
        return root;

    }
}