algorithm/JavaScript
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/JavaScript.git synced 2025-07-06 01:18:23 +08:00
Code Issues Packages Projects Releases Wiki Activity

fixed some spellings

Browse Source
This commit is contained in:
Keshav Bohra
2021-10-05 12:49:23 +05:30
parent 199d2637cc
commit 1589263947
41 changed files with 80 additions and 80 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
Data-Structures/Tree/Trie.js
View File

@ -14,7 +14,7 @@ function Trie () {
this.root = new TrieNode(null, null)
}
// Recursively finds the occurence of all words in a given node
// Recursively finds the occurrence of all words in a given node
Trie.findAllWords = function (root, word, output) {
if (root === null) return
if (root.count > 0) {
@ -79,11 +79,11 @@ Trie.prototype.remove = function (word, count) {
child = child.children[key]
}
// Delete no of occurences specified
// Delete no of occurrences specified
if (child.count >= count) child.count -= count
else child.count = 0
// If some occurences are left we dont delete it or else
// If some occurrences are left we dont delete it or else
// if the object forms some other objects prefix we dont delete it
// For checking an empty object
// https://stackoverflow.com/questions/679915/how-do-i-test-for-an-empty-javascript-object