刷题记录-重建二叉树

public class Solution {
    public TreeNode reConstructBinaryTree(int [] pre,int [] in) {
        TreeNode root = reConstructBinaryTree(pre, 0, pre.length-1, in, 0, in.length-1);
        return root;
    }
    private TreeNode reConstructBinaryTree(int[] pre, int startPre, int endPre, int[] in, int startin, int endin){
        if(startPre>endPre||startin>endin)
            return null;
        TreeNode root = new TreeNode(pre[startPre]);
        
        for(int i = startin;i <= endin; i++){
            if(in[i] == pre[startPre]){
                root.left = reConstructBinaryTree(pre, startPre+1, startPre+i-startin, in, startin, i-1);
                root.right = reConstructBinaryTree(pre, startPre+i-startin+1, endPre, in, i+1, endin);
            
                break;
            }
        }
        return root;
    }
}

void traverse(TreeNode root) {
    // 前序遍历
    traverse(root.left)
    // 中序遍历
    traverse(root.right)
    // 后序遍历
}