Add implementation of Trie Data Structure

[ksvijayan06]

A Trie is a tree data structure used to efficiently store and retrieve keys in a dataset of strings. There are various applications of this data structure, such as autocomplete and spellchecker.

Implement the Trie class:

Trie()Initializes the trie object. void insert(String word) Inserts the string word into the trie. boolean search(String word)Returns true if the string word is in the trie (i.e., was inserted before), and false otherwise. boolean startsWith(String prefix) Returns true if there is a previously inserted string word that has the prefix prefix, and false otherwise.

[ksvijayan06]

Hi @Pradeepsingh61 I would like to work on this issue can you please assign this to me

[aYusHSabane]

Hi @Pradeepsingh61 can you please assign this issue to me

[ksvijayan06]

@aYusHSabane I already push a PR for that