update: unique count

Author: ashokdey

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

@@ -4,7 +4,7 @@ const Trie = require('../index');
 function totalWords(root) {
   let result = 0;
   if (root.isEndOfWord) {
-    result += 1;
+    result += root.wordCount;
   }
   for (let i = 0; i < 26; i += 1) {
     if (root.children[i] !== null) {
@@ -14,7 +14,7 @@ function totalWords(root) {
   return result;
 }
 
-// const words = ['bed', 'ball', 'apple', 'java', 'javascript'];
+// const words = ['bed', 'ball', 'apple', 'java', 'javascript', 'bed'];
 // const trie = new Trie();
 
 // words.forEach(word => trie.insert(word));

src/_DataStructures_/Trees/Trie/unique-word-count/index.js

@@ -0,0 +1,23 @@
+/* eslint-disable no-unused-vars */
+const Trie = require('../index');
+
+function uniqueWordCount(root) {
+  let result = 0;
+  if (root.isEndOfWord) {
+    result += 1;
+  }
+  for (let i = 0; i < 26; i += 1) {
+    if (root.children[i]) {
+      result += uniqueWordCount(root.children[i]);
+    }
+  }
+  return result;
+}
+
+// const words = ['bed', 'ball', 'apple', 'java', 'javascript', 'bed'];
+// const trie = new Trie();
+
+// words.forEach(word => trie.insert(word));
+// console.log(uniqueWordCount(trie.root));
+
+module.exports = uniqueWordCount;