Using Trie to store Strings and search strings

[vaishnavijha]

Trie is an efficient information reTrieval data structure. Using Trie, search complexities can be brought to optimal limit (key length). If we store keys in binary search tree, a well balanced BST will need time proportional to M * log N, where M is maximum string length and N is number of keys in tree. Using Trie, we can search the key in O(M) time.

I want to demonstrate how can we use trie data structure to search for a given string.

problem link: https://practice.geeksforgeeks.org/problems/trie-insert-and-search0651/1

[vaishnavijha]

Can I be assigned this issue?