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

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

3. ► A good hash function will be collision free

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

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

6. ► Elements in hash_map are ordered

7. ► Hash map guarantees constant time value access

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

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

10. ► STL map is unordered

11. ► Quick sort always performs better than heapsort

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