题目描述
输入某二叉树的前序遍历和中序遍历的结果,请重建出该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。例如输入前序遍历序列{1,2,4,7,3,5,6,8}和中序遍历序列{4,7,2,1,5,3,8,6},则重建二叉树并返回。
解题思路
根据前序序列和中序序列逐步分割出左右节点
{1}根节点
{2,4,7},{3,5,6,8}前序
{4,7,2},{5,3,8,6}中序
根据分割出的前序和中序再次循环分解,递归调用方法即可。
import java.util.Arrays;
public class test06 {
public static void main(String[] args) {
int[] pre = { 1, 2, 4, 7, 3, 5, 6, 8 };// 前序(先根)
int[] left = { 4, 7, 2, 1, 5, 3, 8, 6 };// 中序(先左)
TreeNode treeNode = solution(pre, left);
}
public static TreeNode solution(int[] pre, int[] left) {
if (pre.length == 0 || left.length == 0) {
return null;
}
TreeNode root = new TreeNode(pre[0]);
for (int i = 0; i < left.length; i++) {// 注意Arrays.copyOfRange()函数左闭右开!
if (left[i] == pre[0]) {
root.left = solution(Arrays.copyOfRange(pre, 1, i + 1), Arrays.copyOfRange(left, 0, i));
root.right = solution(Arrays.copyOfRange(pre, i + 1, pre.length),
Arrays.copyOfRange(left, i + 1, left.length));
break;
}
}
return root;
}
}
class TreeNode {
int val;
TreeNode left;
TreeNode right;
TreeNode(int val) {
this.val = val;
}
}