Editing Trie (section)

== Operations ==
Trie supports the following operations:

* '''Insertion''': To insert a key, start at the root node and follow the path of characters in the key. If a character in the key is not present as a child of the current node, create a new node for that character and add it as a child. Mark the final node in the path as the end of the key.

* '''Search''': To search for a key, start at the root node and follow the path of characters in the key. If the final node in the path is marked as the end of the key, the key is present in the trie.

* '''Deletion''': To delete a key, search for the key in the trie. If found, unmark the end of the key node and remove any nodes with no children from the path in reverse order.

* '''Prefix search''': To search for all keys with a given prefix, start at the root node and follow the path of characters in the prefix. Perform a depth-first search from the final node in the path, concatenating characters along the path and returning all keys marked as end nodes.