Problem:
Given inorder and postorder traversal of a tree, construct the binary tree.
Note:
You may assume that duplicates do not exist in the tree.
Solution:
/**
* Definition for binary tree
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
int[] ginorder,gpostorder;
public TreeNode buildTree(int[] inorder, int[] postorder) {
if(inorder==null||postorder==null)
return null;
ginorder = inorder;
gpostorder = postorder;
return subTree(0, inorder.length-1, 0, postorder.length-1);
}
private TreeNode subTree(int inbegin,int inend,int pbegin,int pend)
{
if(inend-inbegin<0||pend-pbegin<0||pend-pbegin!=inend-inbegin)
return null;
int p=inend+1;
while(--p>=inbegin&&ginorder[p]!=gpostorder[pend]);
if(p<inbegin)
return null;
TreeNode root = new TreeNode(gpostorder[pend]);
root.left = subTree(inbegin, p-1, pbegin, pbegin+p-inbegin-1);
root.right = subTree(p+1, inend, pbegin+p-inbegin, pend-1);
return root;
}
}
* Definition for binary tree
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
int[] ginorder,gpostorder;
public TreeNode buildTree(int[] inorder, int[] postorder) {
if(inorder==null||postorder==null)
return null;
ginorder = inorder;
gpostorder = postorder;
return subTree(0, inorder.length-1, 0, postorder.length-1);
}
private TreeNode subTree(int inbegin,int inend,int pbegin,int pend)
{
if(inend-inbegin<0||pend-pbegin<0||pend-pbegin!=inend-inbegin)
return null;
int p=inend+1;
while(--p>=inbegin&&ginorder[p]!=gpostorder[pend]);
if(p<inbegin)
return null;
TreeNode root = new TreeNode(gpostorder[pend]);
root.left = subTree(inbegin, p-1, pbegin, pbegin+p-inbegin-1);
root.right = subTree(p+1, inend, pbegin+p-inbegin, pend-1);
return root;
}
}