This is my implementation of the Trie data structure in Python3. This program implements the following operations on the Trie data structure.
Please report any errors that you find.
The following operations are supported by the Trie
class.
Function | Description |
---|---|
insert |
Add a word into the Trie |
search |
Check if a word exists in the Trie |
print |
Prints the formed trie |
prefix_search |
Check if a word with given prefix exists in the Trie |
autocomplete |
Return a list of complete words for a given prefix |
delete |
Delete a word from the Trie |
This project is released under the terms of the MIT Licnese