search

edualgo / interview-corner

Many time, when an interview approaches, candidates start searching for different algorithms in different programming languages for practise. This project aims to build a website which will contain the codes along with the techniques and explanations so that it can be helpful for many
https://opensource.edualgoacademy.com/interview-corner/
MIT License
42 stars 41 forks source link

Using Trie to store Strings and search strings #113

Open vaishnavijha opened 3 years ago

vaishnavijha commented 3 years ago

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 commented 3 years ago

Can I be assigned this issue?