题目描述
输入某二叉树的前序遍历和中序遍历的结果,请重建出该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。例如输入前序遍历序列{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) {
return helper(pre,0,pre.length-1,in,0,in.length-1);
}
TreeNode helper(int[] pre, int pre1,int pre2,int[] in, int in1,int in2)
{
if(pre1>pre2||in1>in2)
{
return null;
}
TreeNode root = new TreeNode(pre[pre1]);
int index =0;
for(int i=in1;i<=in2;i++)
{
if(pre[pre1]==in[i])
{
index = i;
break;
}
}
root.left = helper(pre,pre1+1,pre1+index-in1,in,in1,index-1);
root.right = helper(pre,pre1+index+1-in1,pre2,in,index+1,in2);
return root;
}
}