根据一棵树的中序遍历与后序遍历构造二叉树。
注意:
你可以假设树中没有重复的元素。
例如,给出
中序遍历 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 {
int post_idx = 0;
HashMap<Integer, Integer> idx_map = new HashMap<Integer, Integer>();
public TreeNode helper(int[] postorder, int start, int end){
if(start > end) return null;
TreeNode root = new TreeNode(postorder[post_idx--]);
int index = idx_map.get(root.val);
root.right = helper(postorder, index + 1, end);
root.left = helper(postorder, start, index - 1);
return root;
}
public TreeNode buildTree(int[] inorder, int[] postorder) {
post_idx = postorder.length - 1;
for(int i = 0; i < inorder.length; i++){
idx_map.put(inorder[i], i);
}
return helper(postorder,0, inorder.length - 1);
}
}