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