More tests.

.gitignore

@@ -1,2 +1,3 @@
 node_modules
 .idea
+coverage

jest.config.js

@@ -0,0 +1,5 @@
+module.exports = {
+  verbose: false,
+  collectCoverage: true,
+  coverageDirectory: './coverage/',
+};

src/data-structures/priority-queue/__test__/PriorityQueue.test.js

@@ -26,8 +26,10 @@ describe('PriorityQueue', () => {
     priorityQueue.add(10, 1);
     priorityQueue.add(5, 2);
     priorityQueue.add(100, 0);
+    priorityQueue.add(200, 0);
 
     expect(priorityQueue.poll()).toBe(100);
+    expect(priorityQueue.poll()).toBe(200);
     expect(priorityQueue.poll()).toBe(10);
     expect(priorityQueue.poll()).toBe(5);
   });

src/data-structures/queue/__test__/Queue.test.js

@@ -46,6 +46,7 @@ describe('Queue', () => {
 
     expect(queue.dequeue()).toBe(1);
     expect(queue.dequeue()).toBe(2);
+    expect(queue.dequeue()).toBeNull();
     expect(queue.isEmpty()).toBeTruthy();
   });
 });

src/data-structures/stack/__test__/Stack.test.js

@@ -46,6 +46,7 @@ describe('Stack', () => {
 
     expect(stack.pop()).toBe(2);
     expect(stack.pop()).toBe(1);
+    expect(stack.pop()).toBeNull();
     expect(stack.isEmpty()).toBeTruthy();
   });
 });

src/data-structures/tree/__test__/BinaryTreeNode.test.js

@@ -99,5 +99,7 @@ describe('BinaryTreeNode', () => {
 
     expect(rootNode.replaceChild(rootNode.right, replacementNode)).toBeTruthy();
     expect(rootNode.traverseInOrder()).toEqual([1, 2, 5]);
+
+    expect(rootNode.replaceChild(new BinaryTreeNode(), new BinaryTreeNode())).toBeFalsy();
   });
 });