重建二叉树

题目描述

输入某二叉树的前序遍历和中序遍历的结果，请重建出该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。例如输入前序遍历序列{1,2,4,7,3,5,6,8}和中序遍历序列{4,7,2,1,5,3,8,6}，则重建二叉树并返回。

代码

  public static class TreeNode {
      int val;
      TreeNode left;
      TreeNode right;
      TreeNode(int x) { val = x; }
    }
    public static TreeNode reConstructBinaryTree(int [] pre,int [] in) {
        TreeNode root=reConstructTree(pre,0,pre.length-1,in,0,in.length-1);
        return root;
    }
    public static TreeNode  reConstructTree(int [] pre,int preStart,int preEnd,int [] in,int inStar,int inEnd){
        if(inStar>inEnd) return null;
        TreeNode root=new TreeNode(pre[preStart]);
        for(int i=inStar;i<=inEnd;i++){
            if(pre[preStart]==in[i]){
                root.left=reConstructTree(pre,preStart+1,preStart+i-inStar, in, inStar,i-1);
                root.right=reConstructTree(pre,preStart+i-inStar+1,preEnd,in,i+1,inEnd);
                break;
            }
        }
        return root;
    }