--fix: code coverage 100%

Author: TheSTL

src/_DataStructures_/Trees/BinaryTree/bottom-view-binary-tree/BottomViewBinaryTree.test.js

@@ -1,8 +1,8 @@
-const BinaryTree = require("../index");
+const BinaryTree = require('../index');
 const bottomView = require('.');
 
 describe('Bottom View Binary Tree', () => {
-  let btree
+  let btree;
 
   beforeEach(() => {
     btree = new BinaryTree([1, 2, 3, 4, 5, 6]);

src/_DataStructures_/Trees/BinaryTree/btree-traversals.test.js

@@ -1,15 +1,20 @@
-const BinaryTree = require("./index");
+const BinaryTree = require('./index');
 
-describe("Binary Tree Preorder Traversal", () => {
+describe('Binary Tree Preorder Traversal', () => {
   let btree;
   let preOrderTraversal;
 
-  describe("Creates BTree", () => {
+  describe('Creates BTree', () => {
+    it('Should throw error if argument is not array', () => {
+      expect(() => {
+        btree = new BinaryTree('Hello tree');
+      }).toThrow('Invalid argument to create a Binary Tree');
+    });
     btree = new BinaryTree([1, 2, 3, 4, 5, 6]);
   });
 
-  describe("BTree Traversals", () => {
-    it("should compute the Preorder traversal for the above created binary tree", () => {
+  describe('BTree Traversals', () => {
+    it('Should compute the Preorder traversal for the above created binary tree', () => {
       preOrderTraversal = btree.preOrder();
       expect(preOrderTraversal).toEqual([1, 2, 4, 5, 3, 6]);
     });

src/_DataStructures_/Trees/Trie/Node.js

@@ -13,10 +13,6 @@ class TrieNode {
     this.isEndOfWord = true;
   }
 
-  unmarkAsLeaf() {
-    this.isEndOfWord = false;
-  }
-
   increaseCount() {
     this.wordCount += 1;
   }

src/_DataStructures_/Trees/Trie/all-words-in-trie/all-words-in-trie.test.js

@@ -2,6 +2,12 @@ const allWordsInTrie = require('./index');
 const Trie = require('../index');
 
 describe('Data Structure : Trie : All Words In Tree', () => {
+  it('Should return empty array', () => {
+    const trie = new Trie();
+    const result = allWordsInTrie(trie.root);
+    expect(result.length).toEqual(0);
+  });
+
   it('Should return all words sorted alphabetically', () => {
     const words = ['bed', 'ball', 'apple', 'java', 'javascript', 'bed'];
     const trie = new Trie();

src/_DataStructures_/Trees/Trie/all-words-in-trie/index.js

@@ -5,8 +5,6 @@ const TrieNode = require('../Node');
 function getAllWords(root, level, word) {
   let result = [];
 
-  if (!root) return result;
-
   if (root.isEndOfWord) {
     let temp = '';
     for (let i = 0; i < level; i += 1) {

src/_DataStructures_/Trees/Trie/get-unique-words/index.js

@@ -4,8 +4,6 @@ const TrieNode = require('../Node');
 function getAllUniqueWords(root, level, word) {
   let result = [];
 
-  if (!root) return result;
-
   if (root.isEndOfWord) {
     let temp = '';
     for (let i = 0; i < level; i += 1) {
@@ -25,7 +23,7 @@ function getAllUniqueWords(root, level, word) {
 }
 
 function allUniqueWordsFromTrie(root) {
-   if (!(root instanceof TrieNode)) {
+  if (!(root instanceof TrieNode)) {
     throw new Error('Invalid argument: Root of Trie is required');
   }
   const word = []; // char arr to store a word

src/_DataStructures_/Trees/Trie/search.test.js

@@ -0,0 +1,31 @@
+const Trie = require('./index');
+
+describe('Data Structure : Trie', () => {
+  describe('Trie Instance', () => {
+    it('Should be a class', () => {
+      expect(typeof Trie.prototype.constructor).toEqual('function');
+    });
+  });
+
+  describe('Trie API', () => {
+    const words = ['bed', 'ball', 'apple', 'java', 'javascript'];
+    let trie;
+    it('Should insert string', () => {
+      trie = new Trie();
+      words.forEach(word => trie.insert(word));
+    });
+
+    it('Should return `True` if string present', () => {
+      expect(trie.search(words[0])).toEqual(true);
+    });
+
+    it('Should return `False` if string present', () => {
+      expect(trie.search('Ashu')).toEqual(false);
+      expect(trie.search('be')).toEqual(false);
+    });
+
+    it('Should return `False` if argument is not pass', () => {
+      expect(trie.search()).toEqual(false);
+    });
+  });
+});