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 a fundamental data structure -- the queue! Queues have two key operations, push and pop in computer science. The Queue is a FIFO (first in, first out) data structure as opposed to the stack which is a LIFO (Last in, First out) data structure. The STL organizes queue such that each operation does exactly one thing, and front, back, push,pop, and empty for example are as they sound. I'll also describe what it means to be a container adaptor, and that the qeue data structure itself enforces a policy, while the underlying data structure has impacts on performance. Finally, I'll describe to you a use case of queue as it's used for handling events. ►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.
