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 below code presents algorithm to implement above conditions.
Yes No Yes
— 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)
- Search in a trie Recursively
- Insertion in a Trie recursively
- Bottom-up traversal of a Trie
- Implement a Dictionary using Trie
- Trie | (Insert and Search)
- Trie | (Display Content)
- Persistent Trie | Set 1 (Introduction)
- Trie memory optimization using hash map
- Count inversions in an array | Set 4 ( Using Trie )
- Counting the number of words in a Trie
- Pattern Searching using a Trie of all Suffixes
- Auto-complete feature using Trie
- Program for assigning usernames using Trie
- Advantages of Trie Data Structure
- Longest Common Prefix using Trie
- Sorting array of strings (or words) using Trie
- Count the number of words with given prefix using Trie
- Word Break Problem | (Trie solution)
- Print all possible combinations of words from Dictionary using Trie