Construct Binary Tree from Inorder and Postorder Traversal (Java)

Given inorder and postorder traversal of a tree, construct the binary tree.

Note:
You may assume that duplicates do not exist in the tree.

做法参考先序、中序遍历那道题

Source

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public TreeNode buildTree(int[] inorder, int[] postorder) {
        if(postorder.length == 0 || postorder.length != inorder.length) return null;
        
        return buildT(inorder, 0, inorder.length - 1, postorder, 0, postorder.length - 1);
    }
    
    public TreeNode buildT(int[] inorder, int istart, int iend, int[] postorder, int pstart, int pend){
    	if(istart > iend) return null;  
    	TreeNode root = new TreeNode(postorder[pend]);  
    	if(pstart == pend) return root;
    	
    	int i = 0;
    	while(postorder[pend] != inorder[i]){  
    		i++;
    	}
    	int leftsize = i - istart;  
    	
    	
    	root.left = buildT(inorder, istart, i - 1, postorder, pstart, pstart + leftsize - 1);	
    	root.right = buildT(inorder, i + 1, iend , postorder, pstart + leftsize, pend - 1);	  //注意是pend - 1
    	return root;
    }
}

Test

    public static void main(String[] args){
    	int[] postorder = {1,3,2,5,7,6,4};
    	int[] inorder = {1,2,3,4,5,6,7};
    	
    	TreeNode root = new Solution().buildTree(inorder, postorder);
    
    	new Solution().print(root);

    }
    public void print(TreeNode root){
    	
    	if(root != null) System.out.println(root.val);
    	if(root.left != null) print(root.left);
    	if(root.right != null) print(root.right);
    	
    }