根据一棵树的中序遍历与后序遍历构造二叉树。
注意:
你可以假设树中没有重复的元素。
例如,给出
中序遍历 inorder = [9,3,15,20,7]
后序遍历 postorder = [9,15,7,20,3]
返回如下的二叉树:
3
/
9 20
/
15 7
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public TreeNode buildTree(int[] inorder, int[] postorder) {
int length=postorder.length;
if(length==0) return null;
TreeNode root=new TreeNode(postorder[length-1]);
int index=find(inorder,postorder[length-1]);
root.left=buildTree(Arrays.copyOfRange(inorder,0,index),Arrays.copyOfRange(postorder,0,index));
root.right=buildTree(Arrays.copyOfRange(inorder,index+1,length),Arrays.copyOfRange(postorder,index,length-1));
return root;
}
private int find(int[] arr,int target){
for(int i=0;i<arr.length;i++){
if(arr[i]==target) return i;
}
return -1;
}
}