update: counting word ocurences

Author: ashokdey

src/_DataStructures_/Trees/Trie/Node.js

@@ -3,6 +3,7 @@ class TrieNode {
     this.char = char;
     this.children = [];
     this.isEndOfWord = false;
+    this.wordCount = 0;
 
     // mark all the alphabets as null
     for (let i = 0; i < 26; i += 1) this.children[i] = null;
@@ -15,6 +16,10 @@ class TrieNode {
   unmarkAsLeaf() {
     this.isEndOfWord = false;
   }
+
+  increaseCount() {
+    this.wordCount += 1;
+  }
 }
 
 module.exports = TrieNode;

src/_DataStructures_/Trees/Trie/index.js

@@ -32,6 +32,7 @@ class Trie {
     // when we are done with inserting all the character of the word,
     // mark the node as end leaf
     currentNode.markAsLeaf();
+    currentNode.increaseCount();
     return true;
   }