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