面试题7：重建二叉树

/*

 * 面试题7：重建二叉树

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

        思路：先找出根节点，然后利用递归方法构造二叉树

 */

 

class TreeNode {

    int val;

    TreeNode left;

    TreeNode right;

 

    TreeNode(int x) {

       val = x;

    }

}

 

public class ReConstructBinaryTree {

 

    public static void main(String[] args) {

      

       ReConstructBinaryTree  c = new ReConstructBinaryTree();

       int [] pre = {1,2,4,7,3,5,6,8};

       int [] in = {4,7,2,1,5,3,8,6};

       TreeNode t = c.reConstructBinaryTree(pre, in);

       System.out.print("后序遍历结果是： " );

       c.lastOrderTraverse(t);

      

    }

 

    public TreeNode reConstructBinaryTree(int[] pre, int[] in) {

       if (pre == null || in == null || pre.length == 0 || in.length == 0 || pre.length != in.length)

           return null;

       TreeNode root = new TreeNode(pre[0]);

       for (int i = 0; i < pre.length; i++) {

           if (pre[0] == in[i]) {

              //构建子树时可以直接利用Arrays.copyOfRange(preorder, from, to),这个方法是左闭右开的

              //copyOfRange(int []original,int from,int to),original为原始的int型数组，from为开始角标值，to为终止角标值。（其中包括from角标，不包括to角标。即处于[from,to)状态）

              root.left = reConstructBinaryTree(Arrays.copyOfRange(pre, 1, i + 1), Arrays.copyOfRange(in, 0, i));

              root.right = reConstructBinaryTree(Arrays.copyOfRange(pre, i + 1, pre.length),

                     Arrays.copyOfRange(in, i + 1, in.length));

 

           }

       }

       return root;

    }

    //将重建的二叉树后序遍历输出

    public void lastOrderTraverse(TreeNode T) {

       if (T != null) {

           lastOrderTraverse(T.left);

           lastOrderTraverse(T.right);

           System.out.print( T.val);

       }

    }

 

}