I\'m beginner and learning C++
Having hard times to understand std::map concepts, because the code I\'m playing with implies that the map is a search tree, i.e.
I would say that if you think of a map as a pair you can't go wrong. Map can be implemented as a tree or a hash map, but the way it is implemented is not as important since you can be sure any implementation is STL is an efficient one.