题目
输入某二叉树的前序遍历和中序遍历的结果,请重建出该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。例如输入前序遍历序列{1,2,4,7,3,5,6,8}和中序遍历序列{4,7,2,1,5,3,8,6},则重建二叉树并返回。
思想
递归
https://blog.nowcoder.net/n/c56eeb5b1845432a903db1c3c0cbc80a
代码
/**
* 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) {
if(pre == null || in == null || pre.length == 0 || in.length == 0 || pre.length != in.length)
return null;
return getRootNode(pre,0,pre.length-1,in,0,in.length-1);
}
private TreeNode getRootNode(int pre[],int preFrom,int preEnd,int in[],int inFrom,int inEnd)
{
if(preEnd < preFrom || inFrom > inEnd)
{
return null;
}
TreeNode root = new TreeNode(pre[preFrom]);
int inIndex = inFrom;
for(int i = inFrom;i <= inEnd;i++)
{
if(in[i] == pre[preFrom])
{
inIndex = i;
root.left = getRootNode(pre,preFrom+1,preFrom+inIndex-inFrom,in,inFrom,inIndex-1);
root.right = getRootNode(pre,preFrom+inIndex-inFrom+1,preEnd,in,inIndex+1,inEnd);
}
}
return root;
}
}