Git-Mirrors/master-algorithms-py
1
0
Fork 0
mirror of https://github.com/autistic-symposium/master-algorithms-py.git synced 2025-04-29 20:26:07 -04:00
Code Issues Packages Projects Releases Wiki Activity

Update README.md

Browse Source
This commit is contained in:
bt3gl 2023-08-08 17:03:08 -07:00 committed by GitHub
parent a0d31643e4
commit 044afb8d21
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 5 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
tries/README.md
View File

@ -26,7 +26,7 @@ class Trie:
def __init__(self): def __init__(self):
self.root = {} self.root = {}
def insert(self, word: str) -> None: def insert(self, word: str)L
node = self.root node = self.root
for c in word: for c in word:
if c not in node: if c not in node:
@ -58,6 +58,7 @@ class Trie:
<br> <br>
* similar to a bst, when we insert a value to a trie, we need to decide which path to go depending on the target value we insert. * similar to a bst, when we insert a value to a trie, we need to decide which path to go depending on the target value we insert.
* the root node needs to be initialized before you insert strings. * the root node needs to be initialized before you insert strings.
@ -71,10 +72,13 @@ class Trie:
<br> <br>
* all the descendants of a node have a common prefix of the string associated with that node, so it should be easy to search if there are any words in the trie that starts with the given prefix. * all the descendants of a node have a common prefix of the string associated with that node, so it should be easy to search if there are any words in the trie that starts with the given prefix.
* we go down the tree depending on the given prefix, once we cannot find the child node, the search fails. * we go down the tree depending on the given prefix, once we cannot find the child node, the search fails.
* we can also search for a specific word rather than a prefix, treating this word as a prefix and searching in the same way as above. * we can also search for a specific word rather than a prefix, treating this word as a prefix and searching in the same way as above.
* if the search succeeds, we need to check if the target word is only a prefix of words in the trie or if it's exactly a word (for example, by adding a boolean flag). * if the search succeeds, we need to check if the target word is only a prefix of words in the trie or if it's exactly a word (for example, by adding a boolean flag).