题目描述
输入某二叉树的前序遍历和中序遍历的结果,请重建出该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。例如输入前序遍历序列{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 root =get(pre, in, 0, pre.length-1,0, in.length-1);
return root;
}
public static TreeNode get(int [] pre,int [] in,int l1,int r1,int l2,int r2){
if(l1>r1 || l2>r2)
return null;
TreeNode node = new TreeNode(pre[l1]);
int t = l2;
while(in[t]!=pre[l1])
t++;
// dis 存放的是左子树的结点个数
int dis = t-l2;
node.left = get(pre, in, l1+1, l1+dis, l2, t-1);
node.right = get(pre, in, l1+dis+1, r1, t+1, r2);
return node;
}
}