feat: 힙을 이용한 우선순위 큐의 구현 완료

Author: ksundong

yoonexample/src/main/java/priorityqueue/HeapPriorityQueue.java

@@ -0,0 +1,33 @@
+package priorityqueue;
+
+import exception.EmptyQueueException;
+import heap.ArrayUsefulHeap;
+import heap.UsefulHeap;
+import java.util.Comparator;
+
+public class HeapPriorityQueue<E> implements PriorityQueue<E> {
+
+  private final UsefulHeap<E> heap;
+
+  public HeapPriorityQueue(Comparator<E> comparator) {
+    this.heap = new ArrayUsefulHeap<>(comparator);
+  }
+
+  @Override
+  public boolean isEmpty() {
+    return this.heap.isEmpty();
+  }
+
+  @Override
+  public void enqueue(E data) {
+    this.heap.insert(data);
+  }
+
+  @Override
+  public E dequeue() {
+    if (isEmpty()) {
+      throw new EmptyQueueException();
+    }
+    return this.heap.delete();
+  }
+}