C++11: std::set vs std::map

What are the main differences between std::set and std::map in C++11?

std::set is a collection of unique elements, while std::map is a collection of key-value pairs where keys are unique.

Can you explain how they store their elements?

Both std::set and std::map are typically implemented as balanced binary trees, which allows for efficient insertion, deletion, and lookup.

What are the time complexities for operations in std::set and std::map?

Both have O(log n) time complexity for insertions, deletions, and lookups due to their tree-based structure.

When should I use std::set over std::map?

Use std::set when you only need to store unique elements. Use std::map when you need to associate values with unique keys.