AutoComplete

1 Articles 0 Followers


Trie Data Structure and implementation to insert,search, count, delete words from trie

14 Jan 2022 1 minute read 0 comments The Glitcher

Trie is a tree data structure which is used widely in google autocomplete, spell checker and prefix matching for ip routing in IP tables.  It is also a very efficient data structure compared to hashtable in terms of storing and searching the strings...