what are some other possible use cases of a Trie data structure other than T9/Spell checker dictionaries? -


i trying understand trie data structure & i've understood used in spell checkers/auto suggest or correct spellings etc. i.e. used in context of language dictionaries. wonder if there other possible use cases trie data structure (as or in augmented form).

thanks advance.

ps: not homework problem & here trying better understand possible usecases trie data structure , that's it.

tries integral in routing systems.

most routers stores ip address in form of trie (patricia trees) suited lookups etc.

tries useful lookup structure dealing strings (of bytes/bits etc).

suffix trees tries , have wide string related applications, substring checks, finding repeated substrings, palindrome finding etc.

here couple of algorithm puzzles try out.

  • given nxn binary matrix (of zeroes , ones), eliminate duplicate rows.

  • given n numbers, find 2 numbers x,y among such x xor y (the exclusive or) maximum among n^2 possibilities.


Comments

Popular posts from this blog

java - Spring Data JPA: Why findOne(id) executing delete query internally? -

python - Mongodb How to add addtional information when aggregating? -

java - Incorrect order of records in M-M relationship in hibernate -