4.3 Queue Implementation using Linked List in C | Data Structure Tutorials

In this lecture I have explained implementation of Queue using Linked List with example. I have written C program for linked list implementation of Queue data structure.

******************************************
See Complete Playlists:

********************************************

Connect & Contact Me:

#jennyslectures
#datastructures
#queue
#ugcnet

[PrinceKumar-uxqm]

The best thing is that you are making videos on algorithms and data structure, there are lots of channels in youtube they do teach programming languages but not data structure and algorithms.Thanks a lot mam🙏🙏🙏

[suvrajitdatta]

Ma'am never stop making videos....teacher like u are needed are needed more and more in our society....ur explanations are supurb

[Varun]

waking up at 5 am every day. and seeing your face has now become a habit. thank you so much for such lovely explanations and clearing my concept. mam please make two videos on 1. Reverse a circular doubly linked list & 2. Implementation of circular queue using linked list. Thank you mam you are amazing

[mabenyjohnson]

Your teaching makes it interesting to listen to you until the end... Because of the clarity and consistency of how you lay out your ideas.

[otetumooluwaseun]

Thank you very much Jenny. You saved me during my C days and now still saving me learning C#.
I see double beauties watching your videos.

[NishantSingh-csdl]

mam your way of teaching and the things you taught us I is beyond this comment section You are such a great teacher and I have been in love with you and with your

[karthikc]

jayanthi ma'am, u r simply superb...
keep helping us
best channel for learning DS

[aalexa]

Video not only is good but also teacher which teach, she is very amazing

[maniabedii]

Best video i have seen on DS ever, ty very much

[veereshnaik]

best youtube tutor mam its uniques and direct point tq :)

[sivasubramani]

@Jenny, I think at 2:50 sec, we can't consider front at the right end and rear at the left end since this is a singly linked list and after deque (which will take O(n)) we can't change the rear pointer to point the previous node. What do you think? If its right. please give a like so that it will be on top and will help others.

[asmakhan]

Mam ur lectures is awesome. To the point, No time wastage!😘😘😘😘😘

[adarshjadhav]

Pyaar ho Jaye ga mam, aise padhayenge toh...❤️❤️
.
.
.
.
.
.
.
.
DS se

[softmedun]

Wow amazing lecture
Sabse acche meri pyari ma'am
On of the best YouTube channel ❤

[saiakshagn]

Thank you so much maam.Your way of Teaching is so good that even a dull student can understand easily.Our Generation is so lucky, because We have you.

[vaibhavshukla]

Thank you jenny ma'am for this amazing lecture.

[rupinpatel]

best lectures ever on Data structures and algorithms

[rashidulislamrasel]

Incridible class madam.I have been starting to learn data structure So I was searching good teacher.finally i have gotten your class.I have also subscribed your chanel.Love From Bangladesh.

[PankajPandeyfacts]

I struggles a.lot on this topic
But I am clear right now
Thank u mam from the bottom of my heart

[mohdehtesham]

Just one note while running the code as is, the front and rear are globally initialized as NULL, so the functions dequeue(), display() and Peek() will always hit on the first condition. So, there is a need to either initialise the front and rear as local and pass those as arguments to the given functions or update the global pointers to the recent values as a whole.