C++11: std::map Iterators vs Unordered Map

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

The main differences are that std::map is ordered and uses a binary tree, while unordered_map is unordered and uses a hash table.

How do iterators work with std::map compared to unordered_map?

In std::map, iterators traverse elements in sorted order, while unordered_map iterators do not guarantee any specific order.

Which one should I use for better performance?

If you need fast lookups and don't care about order, use unordered_map. For ordered data, std::map is better.

Can you give an example of when to use each?

Use std::map for applications like a phone book where order matters, and unordered_map for caching where speed is crucial.