Bloomberg LP Interview Question
Financial Software Developers@funny bone: there's no right answer for this question because it totally depends on the problem. min heap, splay trees, skip lists etc.. all of them can give O(logn) performance but if the frequency of numbers changes uniformly then that would affect the performance depending on the data structure.
Splay tree would do...
- Veeru January 30, 2011