-
Notifications
You must be signed in to change notification settings - Fork 0
A Python Class to implement a Trie data structure for a list of words.
License
ahmednooor/triepy
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
# A Python Class to implement a Trie data structure for a list of words. # USAGE: # Import Class from Trie import Trie # Initialize DICTIONARY = Trie([ an, app ]) # Find a word DICTIONARY.find('app') # will return True DICTIONARY.find('apple') # will return False # Add new word/s DICTIONARY.add([ apple, apricot ]) # Remove word/s DICTIONARY.remove([ app, apricot ]) # Get implemented Trie in the form of Python Dictionary DICTIONARY.trie() # will return a python dictionary
About
A Python Class to implement a Trie data structure for a list of words.
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published