Tripadvisor interview question
When balanced-tree is better than hashtable?
Interview Answers
Anonymous
11 Feb 2011
When you need the items in a sorted order, a tree is better than a hash table.
6
When balanced-tree is better than hashtable?
Anonymous
When you need the items in a sorted order, a tree is better than a hash table.
Check out your Company Bowl for anonymous work chats.