时间限制:1秒
空间限制:32768K
热度指数:177198
题目描述
输入某二叉树的前序遍历和中序遍历的结果,请重建出该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。例如输入前序遍历序列{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 BuildTree(int [] pre,int pres,int prel,int [] in,int ins,int inl){
int valueR = pre[pres];
TreeNode root = new TreeNode(0);
root.val = valueR;
//if(pre)
if(inl==1){
return root;
}
int index =0;
while(index<inl&&valueR!=in[index+ins]){
index++;
}
if(index>0)
root.left = BuildTree(pre,pres+1,index,in,ins,index);
if(prel-index-1>0)
root.right = BuildTree(pre,pres+index+1,prel-index-1,in,ins+index+1,inl-index-1);
return root;
}
public TreeNode reConstructBinaryTree(int [] pre,int [] in) {
return BuildTree(pre,0,pre.length,in,0,in.length);
}
}