Barclays interview question

Explain how a Map works

Interview Answer

Anonymous

31 Jul 2010

Although Map works much like a hashtable to its user, its actually implemented as a tree in the C++ Stl implementation. So lookup time is O(lg n)