剑指offer_重建二叉数

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

TreeNode.java

public class TreeNode{
     int val;
    TreeNode left;
    TreeNode right;
    TreeNode(int x){
        val=x;
    }
}

Solution.java

import java.lang.reflect.Array;
import java.util.Arrays;

/**
 * Created by Administrator on 2017/2/26.
 */
public class Solution {
    public TreeNode  reConStructBinartTree(int[]  pre,int[] in){
        if(pre.length==0||in.length==0){
            return null;
        }
        TreeNode node=new TreeNode(pre[0]);
        for(int i=0;i<in.length;i++){
            if(pre[0]==in[i]){
                node.left=reConStructBinartTree(Arrays.copyOfRange(pre,1,i+1),Arrays.copyOfRange(in,0,i));
                node.right=reConStructBinartTree(Arrays.copyOfRange(pre, i+1, pre.length), Arrays.copyOfRange(in, i+1,in.length));
            }
        }
        return node;
    }

    public void preOrderTraverse(TreeNode  node ){
        if(node==null)
            return;
        System.out.print(node.val+" ");
        preOrderTraverse(node.left);
        preOrderTraverse(node.right);
    }

    public void midOrderTraverse(TreeNode  node ){
        if(node==null)
            return;

        midOrderTraverse(node.left);
        System.out.print(node.val+" ");
        midOrderTraverse(node.right);
    }

    public void postOrderTraverse(TreeNode  node ){
        if(node==null)
            return;

        postOrderTraverse(node.left);

        postOrderTraverse(node.right);
        System.out.print(node.val+" ");
    }


}

main.java

/**
 * Created by Administrator on 2017/2/26.
 */
public class maintest {
    public static void  main(String[] args){
        int [] pre={1,2,4,7,3,5,6,8};
        int[] mid={ 4,7,2,1,5,3,8,6};
        Solution myso=new Solution();
        TreeNode myhead=new TreeNode(0);
        myhead=myso.reConStructBinartTree(pre,mid);
        myso.preOrderTraverse(myhead);
        System.out.print("#####");
        myso.midOrderTraverse(myhead);
        System.out.print("#####");
        myso.postOrderTraverse(myhead);


    }


}