输入某二叉树的前序遍历和中序遍历的结果,请重建出该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。例如输入前序遍历序列{1,2,4,7,3,5,6,8}和中序遍历序列{4,7,2,1,5,3,8,6},则重建二叉树并返回。
/**
* Definition for binary tree
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
//比较重要的一点就是 利用递归。先找到根节点,然后根据根节点,创建左右节点
//可以根据前序遍历和中序遍历确定一个节点
public class Solution {
public TreeNode reConstructBinaryTree(int [] pre,int [] in) {
TreeNode tree = conStructBinatyTree(pre,0,pre.length-1,in,0,in.length-1);
return tree;
}
public static TreeNode conStructBinatyTree(int[] pre,int preStartIndex,int preEndIndex,int[] in,int inStartIndex,int inEndIndex){
if(preStartIndex>preEndIndex||inStartIndex>inEndIndex){return null;}
TreeNode root= new TreeNode(pre[preStartIndex]);
for(int i=inStartIndex;i<=inEndIndex;i++){
if(in[i]==pre[preStartIndex]){
//左边节点
root.left=conStructBinatyTree(pre,preStartIndex+1,preStartIndex+i-inStartIndex,in,inStartIndex,i-1);
//右边节点 具体下标仔细观察
root.right=conStructBinatyTree(pre,preStartIndex+i-inStartIndex+1,preEndIndex,in,i+1,inEndIndex);
}
}
return root;
}
}