[二叉树]面试题2

题目描述

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

前序遍历：DLR

中序遍历：LDR

重建过程用递归算法比较简单

public static TreeNode reConstructBinaryTree(int[] pre, int[] in) {
		
		if(pre==null||in==null||pre.length==0||in.length==0){
			return null;
		}
		int i=0;
		TreeNode root = new TreeNode(pre[0]);
		int rootPos = -1;
		for(int k=0;k<in.length;k++){
			if(pre[0]==in[k]){
				rootPos = k;
			    break;
			}				
		}
		if(rootPos==-1)
			return null;
		int[] preLeftTemp = new int[rootPos];
		int[] inLeftTemp = new int[rootPos];
		System.arraycopy(pre, 1, preLeftTemp, 0, rootPos);
		System.arraycopy(in, 0, inLeftTemp, 0, rootPos);
		root.left = reConstructBinaryTree(preLeftTemp,inLeftTemp);
		int[] preRightTemp = new int[pre.length-rootPos-1];
		int[] inRightTemp = new int[pre.length-rootPos-1];
		System.arraycopy(pre, rootPos+1, preRightTemp, 0, preRightTemp.length);
		System.arraycopy(in, rootPos+1, inRightTemp, 0, inRightTemp.length);
		root.right = reConstructBinaryTree(preRightTemp,inRightTemp);
		return root;