During delete operation we delete the key in bottom up manner using recursion. The following are possible conditions when deleting key from trie,
- Key may not be there in trie. Delete operation should not modify trie.
- Key present as unique key (no part of key contains another key (prefix), nor the key itself is prefix of another key in trie). Delete all the nodes.
- Key is prefix key of another long key in trie. Unmark the leaf node.
- Key present in trie, having atleast one other key as prefix key. Delete nodes from end of key until first leaf node of longest prefix key.
The highlighted code presents algorithm to implement above conditions. (One may be in dilemma how a pointer passed to delete helper is reflecting changes from deleteHelper to deleteKey. Note that we are holding trie as an ADT in trie_t node, which is passed by reference or pointer).
— Venki. Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
- Boggle | Set 2 (Using Trie)
- Trie | (Display Content)
- Trie | (Insert and Search)
- Pattern Searching using a Trie of all Suffixes
- Advantages of Trie Data Structure
- Longest Common Prefix using Trie
- Program for assigning usernames using Trie
- Counting the number of words in a Trie
- Auto-complete feature using Trie
- Trie memory optimization using hash map
- Sorting array of strings (or words) using Trie
- Word Break Problem | (Trie solution)
- Count of distinct substrings of a string using Suffix Trie
- Find shortest unique prefix for every word in a given list | Set 1 (Using Trie)
- Longest prefix matching - A Trie based solution in Java