Added Unit Test

Author: niyonx

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

@@ -14,10 +14,10 @@ function totalWords(root) {
   return result;
 }
 
-// const words = ['bed', 'ball', 'apple', 'java', 'javascript', 'bed'];
-// const trie = new Trie();
+const words = ['bed', 'ball', 'apple', 'java', 'javascript', 'bed'];
+const trie = new Trie();
 
-// words.forEach(word => trie.insert(word));
-// console.log(totalWords(trie.root));
+words.forEach(word => trie.insert(word));
+console.log(totalWords(trie.root));
 
 module.exports = totalWords;

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

@@ -0,0 +1,35 @@
+const totalWordsInTrie = require('./index')
+const Trie = require('../index');
+var assert = require('assert');
+
+describe('Data Structure : Trie', () => {
+  it('Should be class of type Trie', () => {
+    assert.equal(typeof Trie.prototype.constructor, 'function');
+    // expect(typeof Trie.prototype.constructor).toEqual('function');
+  });
+
+  describe('Trie', () => {
+
+    it('Should return 6.', () => {
+      let newTrie = new Trie();
+      const words = ['bed', 'ball', 'apple', 'java', 'javascript', 'bed'];
+      words.forEach(word => newTrie.insert(word));
+      result = totalWordsInTrie.totalWords(newTrie.root);
+      assert.equal(result, 6);
+    });
+
+    it('Should return 0.', () => {
+      let newTrie = new Trie();
+      result = totalWordsInTrie.totalWords(newTrie.root);
+      assert.equal(result, 0);
+    });
+
+    it('Should return 6.', () => {
+      let newTrie = new Trie();
+      const words = ['bed', 'ball','', 'apple', 'java', 'javascript', 'bed'];
+      words.forEach(word => newTrie.insert(word));
+      result = totalWordsInTrie.totalWords(newTrie.root);
+      assert.equal(result, 6);
+    });
+  });
+});