Iterator < Key > function ( ) { return new HeapIterator ( ) ; }
returns an iterator that iterates over the keys on the priority queue in ascending order . the iterator does n't implement remove since it 's optional . concode_field_sep Key[] pq concode_elem_sep Comparator<Key> comparator concode_elem_sep MinPQ<Key> copy concode_elem_sep int N concode_field_sep Key next concode_elem_sep Key delMin concode_elem_sep boolean isMinHeap concode_elem_sep boolean isMinHeap concode_elem_sep void sink concode_elem_sep boolean isEmpty concode_elem_sep void insert concode_elem_sep boolean hasNext concode_elem_sep void main concode_elem_sep void remove concode_elem_sep Key min concode_elem_sep int size concode_elem_sep void exch concode_elem_sep void resize concode_elem_sep boolean greater concode_elem_sep void swim