Implementation of dictionary

Revision en1, by anuj.charm, 2017-05-19 14:51:50

In the case of implemenataion of dictionary we can use any one among two of important DATA STRUCTURE and they are TRIE and hash table. Implementation of Dictionary using Hash table and TRIE:-------------------- If you want to store wrods and only check whether any word exists in Dictionary then we must use hash table for that purpose. This will provide best space usage and performance. BUT if you want to be able to check prefix existence and count of words or some missing character from word then you have to use trie for this requirement. *Space complexity of TRIE is higher than that of HASH TABLE.

Tags dictionary, trie

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English anuj.charm 2017-05-19 14:51:50 639 Initial revision (published)