题目:从中序与后序遍历序列构造二叉树 middle
根据一棵树的中序遍历与后序遍历构造二叉树。
注意:
你可以假设树中没有重复的元素。
例如,给出
中序遍历 inorder = [9,3,15,20,7]
后序遍历 postorder = [9,15,7,20,3]
返回如下的二叉树:
3
/ \
9 20
/ \
15 7
package leetCode.Recursion_Tacktrace;
import java.util.Arrays;
public class lc_rt_106_buildTree {
/*
思路:
和105类似的思路。
对于任意一颗树而言,后序遍历的形式总是:
[ [左子树的前序遍历结果], [右子树的前序遍历结果], 根节点]
即根节点总是前序遍历中的最后一个节点。而中序遍历的形式总是:
[ [左子树的中序遍历结果], 根节点, [右子树的中序遍历结果] ]
*/
public static void main(String[] args) {
lc_rt_106_buildTree m = new lc_rt_106_buildTree();
int[] postorder = {9, 15, 7, 20, 3};
int[] inorder = {9, 3, 15, 20, 7};
TreeNode root = m.buildTree(inorder, postorder);
root.inOrder();
}
public TreeNode buildTree(int[] inorder, int[] postorder) {
if (inorder.length == 0)
return null;
if (inorder.length == 1)
return new TreeNode(inorder[0]);
int rootIndex = -1;
for (int i = 0; i < inorder.length; i++) {
if (inorder[i] == postorder[postorder.length - 1]) {
rootIndex = i;
break;
}
}
int[] leftInorder = Arrays.copyOfRange(inorder, 0, rootIndex);
int[] rightInorder = Arrays.copyOfRange(inorder, rootIndex + 1, inorder.length);
int[] leftPostorder = Arrays.copyOfRange(postorder, 0, leftInorder.length);
int[] rightPostorder = Arrays.copyOfRange(postorder, leftInorder.length, leftInorder.length + rightInorder.length);
TreeNode root = new TreeNode(postorder[postorder.length - 1]);
root.left = buildTree(leftInorder, leftPostorder);
root.right = buildTree(rightInorder, rightPostorder);
return root;
}
class TreeNode {
int val;
TreeNode left;
TreeNode right;
TreeNode(int x) {
val = x;
}
public void inOrder() {
if (this.left != null)
this.left.inOrder();
System.out.println(this.val);
if (this.right != null)
this.right.inOrder();
}
}
}