1. ► Hash map guarantees constant time value access

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

3. ► A good hash function will be collision free

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

5. ► Quick sort always performs better than heapsort

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

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

8. ► Elements in hash_map are ordered

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

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

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

12. ► STL map is unordered