TreeNode.java:
public class TreeNode {
int val;
TreeNode left;
TreeNode right;
TreeNode(int x) {
val = x;
}
}
实现类:
import java.util.Arrays;
public class Question3 {
public static void main(String[] args) {
int[] pre=new int[] {1,2,4,7,3,5,6,8};
int[] in=new int[] {4,7,2,1,5,3,8,6};
TreeNode tree=reConstructBinaryTree(pre,in);
PrePrint(tree);
}
public static TreeNode reConstructBinaryTree(int [] pre,int [] in) {
if(pre.length==0||in.length==0)
return null;
TreeNode root = new TreeNode(pre[0]);
// 在中序中找到前序的根
for(int i=0;i<in.length;i++){
if(in[i]==pre[0]){
// 左子树,注意 copyOfRange 函数,左闭右开
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));
break;
}
}
return root;
}
//前序遍历二叉树并输出节点的值
static void PrePrint(TreeNode root)
{
if (root != null)
{
System.out.print(root.val+"\t");
PrePrint(root.left);
PrePrint(root.right);
}
}
}
结果: