### Question:
HeapPriorityQueue extends AbstractPriorityQueue<K,V> { @Override public int size() { return heap.size(); } HeapPriorityQueue();  HeapPriorityQueue(Comparator<K> comp); @Override int size(); @Override Entry<K,V> min(); @Override Entry<K,V> insert(K key, V value); @Override Entry<K,V> removeMin();  }### Answer:
@Test void testSize() { HeapPriorityQueue<Integer, String> pq = new HeapPriorityQueue<>(); int n = 10; for(int i = 0; i < n; ++i) { pq.insert(i, Integer.toString(i)); } assertEquals(n, pq.size()); }