Priority Queue <E> - java 생성자

//기본생성자 E가 기본 자료형일 경우 natural ordering (내림차순)
PriorityQueue<E> q = new PriorityQueue<E>();

//
PriorityQueue<E> q = new PriorityQueue<E>(initial capacity);

PriorityQueue<E> q = new PriorityQueue<E>(initial capacity, comparator);
//eX) Comparator 만들어서 전달
Comparator<E> myComparator = new Comparator<E>(){public int compare(E e1,E e2){return e1.x-e2.x;}};
//== 
Comparator<E> myCompartor2 = (e1,e2)->{return e1.x-e2.x;}; 

PriorityQueue<E> q = new PriorityQueue<E>(100, myCompartor2);

//using lambda
PriorityQueue<E> q = new PriorityQueue<E>(100, (e1, e2) -> Integer.compare(e1.x,e2.x) );

사용

Iterator<E> iter = q.iterator();
while(iter.hasNext())
{
System.out.println(iter.next());
}

poll(); //제거하면서 꺼내기
peek(); //제거하지 않고 head읽기