4 ms·
The STL's complexity requirements pretty much dictate a balanced binary search tree as the underlying representation for map and set. The choice then is essenti
by tom_mellior 6y ago
The STL's complexity requirements pretty much dictate a balanced binary search tree as the underlying representation for map and set. The choice then is essentially between red-black trees and AVL trees.