Can you please tell me where have you taught Heap and min heap and max heap as you said in the beginning of this video.
Heap , Max heap and Min heap tutorials
Heaps are great for implementing a priority queue because of the largest and smallest element at the root of the tree for a max-heap and a min-heap respectively. We use a max-heap for a max-priority queue and a min-heap for a min-priority queue.
Thus by learning about the STL Priority Queue you are implicitly learning about the Max and Min Heaps.