重建二叉树
已知前序和中序遍历结果,重建二叉树
public Map<Integer,Integer> map=new HashMap<>();
public TreeNode buildTree(int[] preorder, int[] inorder) {
if(preorder.length==0) return null;
int size=preorder.length;
for(int i=0;i<inorder.length;i++){
map.put(inorder[i],i);
}
return build(0,0,size-1,preorder,inorder);
}
public TreeNode build(int root,int left,int right,int[] preorder, int[] inorder){
if(left>right) return null;
TreeNode node=new TreeNode(preorder[root]);
int i=map.get(preorder[root]);
node.left=build(root+1,left,i-1,preorder,inorder);
node.right=build(root+i-left+1,i+1,right,preorder,inorder);
return node;
}
递归参数,前序数组索引root,中序左边界left,中序有边界right
求左节点时 [root+1,left,i-1]好理解
求右节点时’root‘的取值
根据中序i-left代表了递归左树的个数,故从root算起 root+1+i-left为递归右树起点