C++ STL std::priority_queue (a container adaptor) | Modern Cpp Series Ep. 133

►Full C++ Series Playlist:    • The C++ Programming Language  
►Find full courses on: https://courses.mshah.io/
►Join as Member to Support the channel:    / @mikeshah  

►Lesson Description: In this lesson I will show you the last of the container adaptors, the priority_queue data structure! Priority queues follow a different ordering than queues, by taking the 'highest' (by default) element and that is the first element to be removed. I'll show you in this lesson how to use a different comparator function for custom data structures, as well as talk about the complexity of the priority queue.

►YouTube Channel:    / mikeshah  
►Please like and subscribe to help the channel!
►Join our free community: https://courses.mshah.io/communities/...