Trie (Search Tree) Coding in Java
Budget: ₹600 – ₹1,500 INR
“In computer science, a trie, also called digital tree or prefix tree, is a type of search tree, a tree data structure used for locating specific keys from within a set. These keys are most often strings, with links between nodes defined not by the entire key, but by individual characters”
The task is to create a trie system that is hosted online with a global state that supports multiple concurrent clients and the following operations:
Add keyword to trie
Delete a keyword from trie
Search for a keyword in trie [True/False]
Return list of autocomplete suggestion based on an input prefix
Display the trie
The task is to create a trie system that is hosted online with a global state that supports multiple concurrent clients and the following operations:
Add keyword to trie
Delete a keyword from trie
Search for a keyword in trie [True/False]
Return list of autocomplete suggestion based on an input prefix
Display the trie