1. ► In a min-heap, value at a node is always less than that of its children
2. ► Hash map guarantees constant time value access
3. ► hash_map is also part of the standard C++
4. ► Quick sort always performs better than heapsort
5. ► Heapify operation just takes O(lg(n)) steps
6. ► Elements in hash_map are ordered
7. ► Merging two heaps is a O(lg(n)) operation
8. ► Heapsort relies on heap to pick the minimum or maximum element
9. ► A good hash function will be collision free
10. ► A pointer map ordering varies from one run to another
11. ► STL map provides access in lg(n) time
12. ► STL map is unordered