From f242e52460accf2924082cd15433567d131048f0 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?=CE=B1=E2=88=82?= <ashokdey100@gmail.com>
Date: Fri, 25 Oct 2019 11:36:47 +0530
Subject: [PATCH] Update total-words-in-trie.test.js

---
 .../Trie/total-words-in-trie/total-words-in-trie.test.js    | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/src/_DataStructures_/Trees/Trie/total-words-in-trie/total-words-in-trie.test.js b/src/_DataStructures_/Trees/Trie/total-words-in-trie/total-words-in-trie.test.js
index 26f51599..c0bf6fc5 100644
--- a/src/_DataStructures_/Trees/Trie/total-words-in-trie/total-words-in-trie.test.js
+++ b/src/_DataStructures_/Trees/Trie/total-words-in-trie/total-words-in-trie.test.js
@@ -14,13 +14,13 @@ describe('Data Structure : Trie', () => {
       let newTrie = new Trie();
       const words = ['bed', 'ball', 'apple', 'java', 'javascript', 'bed'];
       words.forEach(word => newTrie.insert(word));
-      result = totalWordsInTrie.totalWords(newTrie.root);
+      result = totalWordsInTrie(newTrie.root);
       assert.equal(result, 6);
     });
 
     it('Should return 0.', () => {
       let newTrie = new Trie();
-      result = totalWordsInTrie.totalWords(newTrie.root);
+      result = totalWordsInTrie(newTrie.root);
       assert.equal(result, 0);
     });
 
@@ -28,7 +28,7 @@ describe('Data Structure : Trie', () => {
       let newTrie = new Trie();
       const words = ['bed', 'ball','', 'apple', 'java', 'javascript', 'bed'];
       words.forEach(word => newTrie.insert(word));
-      result = totalWordsInTrie.totalWords(newTrie.root);
+      result = totalWordsInTrie(newTrie.root);
       assert.equal(result, 6);
     });
   });