Trie | (Delete)
In the previous post on trie we have described how to insert and search a node in trie. Here is an algorithm how to delete a node from trie.
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
Time Complexity: The time complexity of the deletion operation is O(n) where n is the key length.
Auxiliary Space: O(n*m), where n is the key length of the longest word and m is the total no of words.
— Venki. Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.