Types of Queue Data Structures with Examples

👉 👉 Super helpful resources available here: https://nikoo28.github.io/all-my-links/

To see more videos like this, you can buy me a coffee: https://www.buymeacoffee.com/studyalgorithms

A queue is a very important data structure that finds a lot of applications in computer architectures. This video talks primarily about 4 different types of queues. A simple queue that we all know about, a circular queue that helps to save space, a priority queue that is used to assign preference to a task and a double ended queue. This video does not cover implementations of the queues, rather it focuses on the working and how do they look/behave. Watch the video to see it in action.

00:00 - Intro
00:56 - Simple Queue
02:20 - Circular Queue
04:58 - Priority Queue
08:25 - Double Ended Queue (Deque)
11:54 - Final Thoughts

📚 Links to topics I talk about in the video:
Queue Data Structure: https://youtu.be/j-lKqN_NNUE
Time Complexity of an Algorithm: https://youtu.be/hYnsWroM4kQ

📘 A text based explanation is available at: https://studyalgorithms.com/theory/types-of-queue/

📖 Reference Books:
Start Learning to Code: https://amzn.to/36pU0JO
Favorite book to learn algorithms: https://amzn.to/39w3YLS
Favorite book for data structures: https://amzn.to/3oAVBTk
Get started for interview preparation: https://amzn.to/39ysbkJ

🎥 My Recording Gear:
Recording Light: https://amzn.to/3pAqh8O
Microphone: https://amzn.to/2MCX7qU
Recording Camera: https://amzn.to/3alg9Ky
Tablet to sketch and draw: https://amzn.to/3pM6Bi4


💻 Get Social 💻
Follow on Facebook at: https://www.facebook.com/studyalgos
Follow on Twitter at: https://www.twitter.com/studyalgorithms
Follow on Tumblr at: https://studyalgos.tumblr.com/
Subscribe to RSS feeds: https://studyalgorithms.com/feed/
Join fan mail: http://eepurl.com/g9Dadv

#leetcode #programming #interview