Circular Queue Implementation - Linked List

preview_player
Показать описание
Hey Everyone, in this video, I implement a Circular Queue using a Circular Linked List. I cover operations such as enqueue, dequeue, peek, and isEmpty. I also cover the time and space complexity for these operations.
Рекомендации по теме
Комментарии
Автор

Great quality. I don't understand why this channel is underrated.

mathialagant
Автор

Hey Everyone! Thanks for checking out my video! Don't forget to Like, Subscribe, and MOST IMPORTANTLY click that Notification Bell for updates! :)

BlueTreeCode
Автор

Thanks bro I would’ve failed my data structure course if it wasn’t for your videos

Haifa
Автор

Great animations, clear and understandable! thanks! Also:

Any way to not have to throw the Exception when rear == null? because then get "cannot find symbol" on this exception which means I have to create my own exception which is annoying. thanks!

Pedroispro
Автор

this is easy unlike circular queue in array

themonster
Автор

Can we build a Queue using the regular linked list instead of a circular one?
We can implement addLast and removefirst methods in a regular linked list. Correct me if I'm wrong.

haricharan
Автор

how do I omplement double linked list circular queue?

philipT
Автор

can u show me a toString method for this

areshaider
Автор

how do i make a method to print this queue

areshaider