update link

Author: rudrakshi99

Trie/readme.md

@@ -3,3 +3,6 @@
 A trie is a tree and each node in it contains the number of pointers equal to the number of
 characters of the alphabet. For example, if we assume that all the strings are formed with English
 alphabet characters “a” to “z” then each node of the trie contains 26 pointers.
+
+## Questions :
+* Searching a word in trie ----> [C++](/Code/C++/searching_a_word_in_trie.cpp)