diff --git a/src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/BinaryHeap.java b/src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/BinaryHeap.java
index 9d6789d1b..fca566fe2 100644
--- a/src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/BinaryHeap.java
+++ b/src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/BinaryHeap.java
@@ -21,7 +21,7 @@ public BinaryHeap() {
 
   // Construct a priority queue with an initial capacity
   public BinaryHeap(int sz) {
-    heap = new ArrayList<>(sz);
+    heap = new ArrayList<T>(sz);
   }
 
   // Construct a priority queue using heapify in O(n) time, a great explanation can be found at: