trie

What would you do if your professor ask you to come up with a solution for a symbol table that is targeted only for string-based keys which are Faster than Hashing and more Flexible than BSTs? Trie Data Structure is the solution that you will be looking for. Trie is a fast search and miss data structure when it comes to storing key-value pairs where key is a string. This … [Read more...] about Trie Data Structure Implementation | (PUT, GET, DELETE)