题目:Construct Binary Tree from Inorder and Postorder Traversal
难度:medium
问题描述:
Given inorder and postorder traversal of a tree, construct the binary tree.
Note:
You may assume that duplicates do not exist in the tree.
解题思路:
已知中序遍历和后序遍历IN和Post,求还原二叉树。
后序遍历的最后一个数post[len-1]就是root节点。
搜索IN,如果IN[I]=post[len-1],那么 IN[I+1]-IN[len-1]就是root的右子树,IN[0]-IN[I-1]就是root的左子树。
通过递归求解。
代码如下:
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public TreeNode buildTree(int[] inorder, int[] postorder) {
return build(postorder.length-1,0,inorder.length-1,inorder,postorder);
}
private TreeNode build(int poststart,int instart,int inend,int[] inorder, int[] postorder){
if(poststart<0||instart>inend){
return null;
}
TreeNode root=new TreeNode(postorder[poststart]);
int inindex=0;
for(int i=instart;i<=inend;i++){
if(inorder[i]==root.val){
inindex=i;
break;
}
}
root.right=build(poststart-1,inindex+1,inend,inorder,postorder);
root.left=build(poststart-(inend-inindex)-1,instart,inindex-1,inorder,postorder);
return root;
}
}