### Question:
BinarySearchTree { List<T> getAsSortedList() { throw new UnsupportedOperationException("Delete this statement and write your own implementation."); }    }### Answer:
@Ignore("Remove to run test") @Test public void iteratesOverComplexTree() { BinarySearchTree<String> binarySearchTree = new BinarySearchTree<>(); List<String> expected = Collections.unmodifiableList( Arrays.asList("1", "2", "3", "5", "6", "7") ); List<String> treeData = Collections.unmodifiableList( Arrays.asList("2", "1", "3", "6", "7", "5") ); treeData.forEach(binarySearchTree::insert); List<String> actual = binarySearchTree.getAsSortedList(); assertEquals(expected, actual); }