I think best data structure would be "Optimal BST" On Fri, Aug 10, 2012 at 11:47 PM, Kumar Vishal <kumar...@gmail.com> wrote:
> Huffman tree ??? > > > On Fri, Aug 10, 2012 at 11:38 PM, Varma Selvaraj <varm...@gmail.com>wrote: > >> A data cache needs to be implemented for the top 100 data items selected >> based on their frequency of access. >> The most frequent data member must be accessed fastest. And the access >> time/iterations of each data member from the cache should correspond to the >> frequncy of its access. >> >> Please choose the right data structure and find the right algorithm for >> the scenario? Can anyone help on this question? >> >> >> Thanks and Regards, >> Varma >> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> To post to this group, send email to algogeeks@googlegroups.com. >> To unsubscribe from this group, send email to >> algogeeks+unsubscr...@googlegroups.com. >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> > > > > -- > Regards > Kumar Vishal > _________________________________________ > *http://wethecommonpeople.wordpress.com/ * > *h**ttp://kumartechnicalarticles.wordpress.com/<http://kumartechnicalarticles.wordpress.com/> > * > _________________________________________ > > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
