How can we modify the trie so that reads become super efficient?


#1

Search Typeahead Q: How can we modify the trie so that reads become super efficient?


#2

This design doesn't look correct to me.


#3

How is it different from storing <key,value> pair for each prefixes (with prefix as key and value as a list of top 5 most frequent search terms)?


#4

I think the only place where trie is better than a <k, v> pair for each prefix and storing top 5 words along with their frequencies is in memory usage.


#5

can we estimate how much memory we need to represent the trie?