Class representing a Trie (Prefix Tree) data structure. Provides efficient insert, search, delete, and prefix search functionalities.
Creates a new Trie.
Deletes a word from the Trie.
The word to delete.
True if the word was successfully deleted, false if the word was not found.
Inserts a word into the Trie.
The word to insert.
Searches for a word in the Trie.
The word to search for.
True if the word exists in the Trie, false otherwise.
Checks if there is any word in the Trie that starts with the given prefix.
The prefix to search for.
True if there is any word with the prefix, false otherwise.
Class representing a Trie (Prefix Tree) data structure. Provides efficient insert, search, delete, and prefix search functionalities.