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