### Question:
TreeDifference { public TreeDifference inverse() { return new TreeDifference(rightTree, leftTree); } TreeDifference(MutableTree leftTree, MutableTree rightTree); static TreeDifference create(MutableTree leftTree, MutableTree rightTree); MutableTree getLeftTree(); MutableTree getRightTree(); TreeDifference inverse(); SortedMap<NodeRef, NodeRef> findRenames(); SortedSet<NodeRef> findNewTrees(); SortedSet<NodeRef> findDeletes(); SortedMap<NodeRef, NodeRef> findChanges(); Map<NodeRef, NodeRef> findPureMetadataChanges(); boolean areEqual();  }### Answer:
@Test public void testInverse() { TreeDifference inverse = treeDifference.inverse(); assertNotNull(inverse); assertNotSame(treeDifference, inverse); assertSame(leftTree, inverse.getRightTree()); assertSame(rightTree, inverse.getLeftTree()); }