### Question:
DocumentRevisionTree { public List<String> getPath(long sequence) { List<InternalDocumentRevision> objects = getPathForNode(sequence); List<String> res = new ArrayList<String>(); for(InternalDocumentRevision object : objects) { res.add(object.getRevision()); } return res; } DocumentRevisionTree();  DocumentRevisionTree(InternalDocumentRevision documentRevision); DocumentRevisionTree add(InternalDocumentRevision documentRevision); InternalDocumentRevision lookup(String id, String rev); int depth(long sequence); InternalDocumentRevision lookupChildByRevId(InternalDocumentRevision parentNode, String childRevision); InternalDocumentRevision bySequence(long sequence); boolean hasConflicts(); Map<Long, DocumentRevisionNode> roots(); DocumentRevisionNode root(long sequence); List<DocumentRevisionNode> leafs(); Set<String> leafRevisionIds(); List<InternalDocumentRevision> leafRevisions(); List<InternalDocumentRevision> leafRevisions(boolean excludeDeleted); InternalDocumentRevision getCurrentRevision(); List<InternalDocumentRevision> getPathForNode(long sequence); List<String> getPath(long sequence); String getDocId();  }### Answer:
@Test public void getPath_treeWithOneRevision_correctTreeIsReturned() { DocumentRevisionTree t = new DocumentRevisionTree(c1); List<String> p = t.getPath(c1.getSequence()); Assert.assertThat(p, hasSize(1)); Assert.assertThat(p, equalTo(Arrays.asList(c1.getRevision()))); }