Summary
Full Transcript
►Full C++ Series Playlist: https://www.youtube.com/playlist?list=PLvv0ScY6vfd8j-tlhYVPYgiIyXduu6m-L ►Find full courses on: https://courses.mshah.io/ ►Join as Member to Support the channel: https://www.youtube.com/channel/UCA64pZbN5Mz5NxC3SO4qpDg/join ►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: https://www.youtube.com/c/MikeShah ►Please like and subscribe to help the channel! ►Join our free community: https://courses.mshah.io/communities/Q29tbXVuaXR5LTI3MzAz
Continue this lesson in the app
Install CourseHive on Android or iOS to keep learning while you move.
