Complying with JavaScript Standard Style (npx standard --fix).

Data-Structures/Heap/test/MinPriorityQueue.test.js

@@ -4,7 +4,7 @@ describe('MinPriorityQueue', () => {
   const values = [5, 2, 4, 1, 7, 6, 3, 8]
   const capacity = values.length
 
-  const Queue = new MinPriorityQueue(capacity);
+  const Queue = new MinPriorityQueue(capacity)
 
   values.forEach(v => Queue.insert(v))
 
@@ -12,7 +12,7 @@ describe('MinPriorityQueue', () => {
     const mockFn = jest.fn()
     Queue.print(mockFn)
 
-    expect(mockFn.mock.calls.length).toBe(1)    // Expect one call
+    expect(mockFn.mock.calls.length).toBe(1) // Expect one call
     expect(mockFn.mock.calls[0].length).toBe(1) // Expect one argument
 
     const heap = mockFn.mock.calls[0][0]

Data-Structures/Stack/Stack.js

@@ -54,5 +54,4 @@ const Stack = (function () {
   return Stack
 }())
 
-
 export { Stack }

Data-Structures/Tree/AVLTree.js

@@ -229,7 +229,7 @@ const AVLTree = (function () {
     return true
   }
   return _avl
-}());
+}())
 
 /**
  * A Code for Testing the AVLTree

Data-Structures/Tree/Trie.js

@@ -116,6 +116,6 @@ Trie.prototype.findOccurences = function (word) {
   // No such word exists
   if (node === null) return 0
   return node.count
-};
+}
 
 export { Trie }