Stack and Queue Data Structures
In this video we learn about the stack and queue data structures. This includes queue/dequeue for queue and push/pop for stack. I try to show several examples of how data is inserted/deleted/access from these data structures and then give an overview of how to implement them using linked list and arrays. This includes explaining a circular array queue implementation. In the next video I will show you C++ code of these four implementations, so for now let's learn the core concept first.
Credits where Credits are Due:
-Subscribe End Screen: Graphicki • Video
-Live Animation: Motion Chroma | Leader • Livestream Intro [Free to Use] ♥
-Music: Song: Without You, Artist: MNRVA, / ximertracks
-Streaming Software: OBS
Thank you for watching!