Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit a83dd6f

Browse files
Merge pull request knaxus#141 from knaxus/trie-test-patch-1
Update total-words-in-trie.test.js
2 parents 325bc14 + f242e52 commit a83dd6f

File tree

1 file changed

+3
-3
lines changed

1 file changed

+3
-3
lines changed

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

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -14,21 +14,21 @@ describe('Data Structure : Trie', () => {
1414
let newTrie = new Trie();
1515
const words = ['bed', 'ball', 'apple', 'java', 'javascript', 'bed'];
1616
words.forEach(word => newTrie.insert(word));
17-
result = totalWordsInTrie.totalWords(newTrie.root);
17+
result = totalWordsInTrie(newTrie.root);
1818
assert.equal(result, 6);
1919
});
2020

2121
it('Should return 0.', () => {
2222
let newTrie = new Trie();
23-
result = totalWordsInTrie.totalWords(newTrie.root);
23+
result = totalWordsInTrie(newTrie.root);
2424
assert.equal(result, 0);
2525
});
2626

2727
it('Should return 6.', () => {
2828
let newTrie = new Trie();
2929
const words = ['bed', 'ball','', 'apple', 'java', 'javascript', 'bed'];
3030
words.forEach(word => newTrie.insert(word));
31-
result = totalWordsInTrie.totalWords(newTrie.root);
31+
result = totalWordsInTrie(newTrie.root);
3232
assert.equal(result, 6);
3333
});
3434
});

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /