refactor: added destroy(), used beforeEach()

Author: ashokdey

src/_DataStructures_/Heaps/MaxHeap/MaxHeap.test.js

@@ -5,33 +5,34 @@ describe('MaxHeap', () => {
     expect(typeof MaxHeap.prototype.constructor).toEqual('function');
   });
 
+  const mh = new MaxHeap();
+
+  beforeEach(() => {
+    mh.destroy();
+  });
+
   it('Should create an instance of MaxHeap', () => {
-    const mh = new MaxHeap();
     expect(mh instanceof MaxHeap).toEqual(true);
   });
 
   it('Should add an element to the MaxHeap', () => {
-    const mh = new MaxHeap();
     mh.add(10);
     expect(mh.getMax()).toEqual(10);
   });
 
   it('Should keep the largest element at the root', () => {
-    const mh = new MaxHeap();
     [12, 5, 34].forEach(el => mh.add(el));
     expect(mh.getMax()).toEqual(34);
   });
 
   it('Should retain Heap properties after removal of an element', () => {
-    const mh = new MaxHeap();
     [12, 45, 1, 34].forEach(el => mh.add(el));
     expect(mh.getMax()).toEqual(45);
     mh.remove();
     expect(mh.getMax()).toEqual(34);
   });
 
   it('Should return `null` when heap is empty', () => {
-    const mh = new MaxHeap();
     [1, 34].forEach(el => mh.add(el));
     expect(mh.getMax()).toEqual(34);
     mh.remove();
@@ -40,7 +41,6 @@ describe('MaxHeap', () => {
   });
 
   it('Should return the elelment value on `remove()`', () => {
-    const mh = new MaxHeap();
     [1, 34].forEach(el => mh.add(el));
     expect(mh.getMax()).toEqual(34);
     expect(mh.remove()).toEqual(34);

src/_DataStructures_/Heaps/MaxHeap/index.js

@@ -69,6 +69,10 @@ class MaxHeap {
       this.__traverseUpAndSwap(parent);
     }
   }
+
+  destroy() {
+    this.heap = [];
+  }
 }
 
 module.exports = MaxHeap;