diff --git a/DataStructures/Queues/PriorityQueues.java b/DataStructures/Queues/PriorityQueues.java
index acb6b552..3eb74ecf 100644
--- a/DataStructures/Queues/PriorityQueues.java
+++ b/DataStructures/Queues/PriorityQueues.java
@@ -37,6 +37,10 @@ class PriorityQueue{
 	public void insert(int value){
 		if(nItems == 0){
 			queueArray[0] = value;
+			nItems++;
+		}
+		else if(isFull()){	//does not insert value when the queue is full
+			System.out.println("Queue is full");
 		}
 		else{
 			int j = nItems;
@@ -45,8 +49,8 @@ class PriorityQueue{
 				j--;
 			}
 			queueArray[j] = value; //Once the correct position is found the value is inserted
+			nItems++;
 		}
-		nItems++;
 	}
 
 	/**
@@ -120,4 +124,4 @@ public class PriorityQueues{
 
 		//As you can see, a Priority Queue can be used as a sorting algotithm
 	}
-}
\ No newline at end of file
+}