diff --git a/DataStructures/Heaps/EmptyHeapException.java b/DataStructures/Heaps/EmptyHeapException.java
index 01668e2c849a..38b4b756f3df 100644
--- a/DataStructures/Heaps/EmptyHeapException.java
+++ b/DataStructures/Heaps/EmptyHeapException.java
@@ -1,7 +1,7 @@
 /**
  *
  */
-package Heaps;
+package DataStructures.Heaps;
 
 /**
  * @author Nicolas Renard
diff --git a/DataStructures/Heaps/Heap.java b/DataStructures/Heaps/Heap.java
index fe87d72a1db2..0b7da3436581 100644
--- a/DataStructures/Heaps/Heap.java
+++ b/DataStructures/Heaps/Heap.java
@@ -1,4 +1,4 @@
-package Heaps;
+package DataStructures.Heaps;
 
 /**
  * Interface common to heap data structures.<br>
diff --git a/DataStructures/Heaps/HeapElement.java b/DataStructures/Heaps/HeapElement.java
index 60640346b3cc..6799f973f466 100644
--- a/DataStructures/Heaps/HeapElement.java
+++ b/DataStructures/Heaps/HeapElement.java
@@ -1,7 +1,7 @@
 /**
  *
  */
-package Heaps;
+package DataStructures.Heaps;
 
 import java.lang.Double;
 import java.lang.Object;
diff --git a/DataStructures/Heaps/MaxHeap.java b/DataStructures/Heaps/MaxHeap.java
index 302840c14d05..fed09bcba045 100644
--- a/DataStructures/Heaps/MaxHeap.java
+++ b/DataStructures/Heaps/MaxHeap.java
@@ -1,4 +1,4 @@
-package Heaps;
+package DataStructures.Heaps;
 
 import java.util.ArrayList;
 import java.util.List;
diff --git a/DataStructures/Heaps/MinHeap.java b/DataStructures/Heaps/MinHeap.java
index 5fca978f6549..7b49b7512bac 100644
--- a/DataStructures/Heaps/MinHeap.java
+++ b/DataStructures/Heaps/MinHeap.java
@@ -1,7 +1,7 @@
 /**
  *
  */
-package Heaps;
+package DataStructures.Heaps;
 
 import java.util.ArrayList;
 import java.util.List;
diff --git a/DataStructures/Heaps/MinPriorityQueue.java b/DataStructures/Heaps/MinPriorityQueue.java
index f117b932800b..6da21ab5b03f 100644
--- a/DataStructures/Heaps/MinPriorityQueue.java
+++ b/DataStructures/Heaps/MinPriorityQueue.java
@@ -1,4 +1,4 @@
-package Heaps;
+package DataStructures.Heaps;
 /* Minimum Priority Queue
  * It is a part of heap data structure
  * A heap is a specific tree based data structure