public TreeNode buildTree(int[] inorder, int[] postorder) {
		if (inorder == null || postorder == null || inorder.length == 0)
			return null;
		int n = postorder.length;
		TreeNode root = buildTreeAux(inorder, postorder, 0, n - 1, 0, n - 1);
		return root;

	}