Adding Tests to totalWords in trie algorithm this closes knaxus#136

Author:    Junior Pereira <pereirajr@lielsonjr@gmail.com>
Date:      Thu Oct 24 18:04:38 2019 -0300

Author: Junior Pereira

package-lock.json

@@ -1,6 +1,4 @@
 // eslint-disable-next-line no-unused-vars
-const Trie = require('../index');
-
 function totalWords(root) {
   let result = 0;
   if (root.isEndOfWord) {
@@ -14,10 +12,4 @@ function totalWords(root) {
   return result;
 }
 
-// const words = ['bed', 'ball', 'apple', 'java', 'javascript', 'bed'];
-// const trie = new Trie();
-
-// words.forEach(word => trie.insert(word));
-// console.log(totalWords(trie.root));
-
-module.exports = totalWords;
+module.exports.totalWords = totalWords;

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

@@ -0,0 +1,20 @@
+const totalWordsInTrie = require('./index')
+const Trie = require('../index');
+
+describe('Trees Total words in trie', () => {
+
+  it('should return 6 when counting from trie object', () => {
+    const words = ['bed', 'ball', 'apple', 'java', 'javascript', 'bed'];
+    const trie = new Trie();
+
+    words.forEach(word => trie.insert(word));
+
+    expect(totalWordsInTrie.totalWords(trie.root)).toEqual(words.length)
+  })
+
+  it('should return 0 when a empty Trie with no words inserted is created', () => {
+    const trie = new Trie();
+
+    expect(totalWordsInTrie.totalWords(trie.root)).toEqual(0)
+  })
+})