design dictionary using trie....having operations of inserting a word, updating and deleting (needed to write full running code)

Question

Accepted Answer

Design a dictionary using trie with insert, update and delete operations.

Implement a Trie data structure with nodes containing a character and a boolean flag to indicate end of word
For insert operation, traverse the trie and add nodes for each character in the word
For update operation, delete the existing word and insert the updated word
For delete operation, mark the end of word flag as false and delete the node if it has no children
Use recursion for traversal and deletion
Example: Inserting 'apple' and 'application' will result in a trie with nodes 'a', 'p', 'p', 'l', 'e' and 'i', 'c', 'a', 't', 'i', 'o', 'n'
Example: Updating 'apple' to 'apricot' will involve deleting 'apple' and inserting 'apricot'
Example: Deleting 'apple' will involve marking the end of word flag for 'e' as false and deleting the node

Top Paytm Software Developer interview questions & answers