The STL ships with a sorted map template class that is commonly implemented as a balanced binary tree. The good thing on this is the fast search average time ( O(log2N) if implemented as a balanced binary tree, where N is the number of elements added into the map) and that when the map is […]![]()
