diff --git a/src/main/java/ch/hepia/structure/BinaryHeap.java b/src/main/java/ch/hepia/structure/BinaryHeap.java
index 35ff6b7a87cb79b4675f69bfa6e044f9a8ba96d9..e05737af760c784fbe5c13e9815bcf025f85b5f0 100644
--- a/src/main/java/ch/hepia/structure/BinaryHeap.java
+++ b/src/main/java/ch/hepia/structure/BinaryHeap.java
@@ -23,6 +23,30 @@ final public class BinaryHeap
       this.sort();
     }
 
+    public boolean isEmpty()
+    {
+      if(this.size()==0)
+      {
+        return true;
+      }
+      else
+      {
+        return false;
+      }
+    }
+
+    public boolean exist(int k)
+    {
+      for(int val:this.lstBinaryHeap)
+      {
+        if(k==val)
+        {
+          return true;
+        }
+      }
+      return false;
+    }
+
     public static void populate(BinaryHeap heap, int size)
     {
       Random rand = new Random();
diff --git a/src/test/java/ch/hepia/structure/AppTest.java b/src/test/java/ch/hepia/structure/AppTest.java
index 86c864a4882d4edf482a7daceeba8d30f8243dd6..f0234d81195f5236bfc2d8a4c52dbc206af6d405 100644
--- a/src/test/java/ch/hepia/structure/AppTest.java
+++ b/src/test/java/ch/hepia/structure/AppTest.java
@@ -15,6 +15,7 @@ class BinaryHeapTest
   {
     BinaryHeap bHeap= new BinaryHeap();
     BinaryHeap bHeapRand= new BinaryHeap();
+    BinaryHeap bHeapEmpty= new BinaryHeap();
     BinaryHeap.populate(bHeapRand,20);
     bHeap.push(100);
     bHeap.push(19);
@@ -30,5 +31,9 @@ class BinaryHeapTest
     //bHeapRand.print();
     assertEquals(bHeap.size(),10);
     assertEquals(bHeapRand.size(),20);
+    assertEquals(bHeapEmpty.isEmpty(),true);
+    assertEquals(bHeapRand.isEmpty(),false);
+    assertEquals(bHeap.exist(7),true);
+    assertEquals(bHeap.exist(42),false);
   }
 }