Implementation of Priority Queue using Heap

README.md

@@ -13,6 +13,7 @@ The repository provides the following key operations:
 - Insertion
 - Removal
 - Heap Sort
+- Priority Queue
 
 ## Contributing
 

src/main/java/com/artman/Heap.java

@@ -1,7 +1,7 @@
 package com.artman;
 
 public class Heap {
-    private int[] items = new int[100];
+    private int[] items = new int[10];
     private int size;
     public void insert(int value){
         if (isFull()) throw new IllegalStateException();

src/main/java/com/artman/Main.java

@@ -4,7 +4,7 @@
 
 public class Main {
     public static void main(String[] args) {
-        Heap heap = new Heap();
+//        Heap heap = new Heap();
 //        heap.insert(50);
 //        heap.insert(45);
 //        heap.insert(39);
@@ -15,8 +15,16 @@ public static void main(String[] args) {
 //        heap.remove();
 //        heap.remove();
 
-        int[] arrays = {5, 3, 10, 1, 4, 2};
-        heap.heapSort(arrays);
-        System.out.println(Arrays.toString(arrays));
+//        int[] arrays = {5, 3, 10, 1, 4, 2};
+//        heap.heapSort(arrays);
+//        System.out.println(Arrays.toString(arrays));
+        PriorityQueue queue = new PriorityQueue();
+        queue.enqueue(5);
+        queue.enqueue(3);
+        queue.enqueue(10);
+        queue.enqueue(1);
+        queue.enqueue(4);
+        queue.enqueue(2);
+        queue.dequeue();
     }
 }

src/main/java/com/artman/PriorityQueue.java

@@ -0,0 +1,14 @@
+package com.artman;
+
+public class PriorityQueue {
+    private Heap heap = new Heap();
+    public void enqueue(int item){
+        heap.insert(item);
+    }
+    public int dequeue(){
+       return heap.remove();
+    }
+    public boolean isEmpty(){
+        return heap.isEmpty();
+    }
+}