1. ► STL map is unordered

2. ► Elements in hash_map are ordered

3. ► A pointer map ordering varies from one run to another

4. ► Quick sort always performs better than heapsort

5. ► Heapify operation just takes O(lg(n)) steps

6. ► Heapsort relies on heap to pick the minimum or maximum element

7. ► STL map provides access in lg(n) time

8. ► Hash map guarantees constant time value access

9. ► In a min-heap, value at a node is always less than that of its children

10. ► A good hash function will be collision free

11. ► Merging two heaps is a O(lg(n)) operation

12. ► hash_map is also part of the standard C++