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.
DSA Full Course: https: • Data Structures and Al...
******************************************
See Complete Playlists:
C Programming Course: • Programming in C
C++ Programming: • C++ Complete Course
Python Full Course: • Python - Basic to Advance
Printing Pattern in C: • Printing Pattern Progr...
DAA Course: • Design and Analysis of...
Placement Series: • Placements Series
Dynamic Programming: • Dynamic Programming
Operating Systems: // • Operating Systems
DBMS: • DBMS (Database Managem...
********************************************
Connect & Contact Me:
Facebook: / jennys-lectures-csit-n...
Quora: www.quora.com/...
Instagram: / jayantikhatrilamba
#jennyslectures
#datastructures
#queue
#ugcnet

[@PrinceKumar-ux3qm]

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🙏🙏🙏

[@vishnupriyabalakrishnan920]

Q1qq

[@riyajaiswal2137]

I tried this code but its not working ...for linked list and array as well

[@AnkitSingh-go6qq]

@@riyajaiswal2137 yes i also check code is not working if we deque element many times

[@VivekRaj-eb6mk]

@@riyajaiswal2137 that's not code, that the algorithm .

[@urstrulymadhu6390]

At struct datatype after} semicolon is required

[@suvrajitdatta]

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

[@Varun00717]

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

[@mabenyjohnson6908]

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.

[@karthikc8992]

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

[@asmakhan541]

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

[@otetumooluwaseun3948]

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.

[@adarshjadhav8877]

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

[@veereshnaik683]

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

[@cs4u579]

I used to smoke weeds but at last when you said "bye,bye take care" I quit it,and made my 10 friends too. But joke safat it would be a more interactive if you have coded the logic live on IDE ,at last to the point , straight and simple explanation won my heart ♥️♥️

[@NishantSingh-cs2dl]

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 teaching........

[@keya.bitspilani5429]

How the hell had I not watched such good lectures on data structures..amazing explaination ma'am 😊😊

[@aalexa5504]

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

[@sharath5796]

note : while dequeue op, first we have to make temp->nxt as null and then free temp

[@justcurious1940]

Do we make a memory address NULL before or after we free it ?

[@rashidulislamrasel207]

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.

[@sivasubramani612]

@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.

[@pavanbhadane8334]

right brother

[@raghavjoshi9751]

Mam in deletion condition their should be one more condition that is else if(front==rear) { printf("deleted element is %d ",temp->data); front =rear=NULL; } cause in last else condition (front= front->next) that make the front to point to the next undefined memory

[@starkgamex4925]

Yes, I also noticed...that's why finding in comments

[@softmedun6794]

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

[@shivanshpathak9291]

1M .....Let's Go....Congo Ma'am, you deserve much more !!!!

[@rupinpatel9064]

best lectures ever on Data structures and algorithms

[@mohdehtesham8357]

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.

[@cherukurisagarteja151]

You are the most beautiful lecturer in this century

[@PankajPandeyfacts7931]

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

[@saiakshagn3553]

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.

[@jithinmv6516]

in dequeue you forgot to write the case for a single element, I mean front and rear points to same node, Which means only one element in queue, So we have to do (front=NULL and rear=NULL)

[@karamsingh7785]

That's exactly what i was going too comment

[@arvsaurav]

I think there is one other way i.e., if we will use only front==0 instead of (front==0 and rear==0) at every place.

[@qasimalikhan9692]

else if(head==tail){ std::cout

[@ankitxalxotoo5580]

@@qasimalikhan9692 thanks brother

[@user-lj6vu1os4w]

Mam I am improving my basic knowledge on coding I have so many of doubts on coding but your teaching coding is assume I am easier to learn thank you mam😊

[@vaibhavshukla6911]

Thank you jenny ma'am for this amazing lecture.

[@padalabalaji5432]

mam thanks a lot for teaching in such a simple way that can be understood by a new person to coding like me👏👏

[@LEETanjubagri]

very nice explanation mam and at last your smile is speechless.......... this motivates me to see the next lecture of u without tiredness. thank u for giving us your precious time.

[@sushmanthavala7813]

One of the best teacher in the online platform we are very lucky to have a great teacher like you TQ mam

[@mostafayounes9490]

Best Instructor Ever💯

[@user-gb4ov2lp2e]

Mam becuz of you I got the confidence to write the exam

[@sudharsands5773]

Mam, you missed discussing a case in dequeue() i.e,, when front==rear. When front and rear is point same node

[@justcurious1940]

U will have to update the rear or the whole code will break;

[@rahulsrivastava7017]

in dequeue(), there should also be a condition for when there is only 1 element in queue, that is, else if(front==rear) { Node *temp=new Node(); temp=front; front=NULL; rear=NULL; free(temp); }

[@pavanbhadane8334]

We can just write free(front) front=rear=NULL;

[@mohammadismailhossain6435]

😅

[@justcurious1940]

@@pavanbhadane8334 exactly what ChatGPT just told me.

[@darpananand9848]

Ma'am we can also check the condition for 1 element in Dequeue Function i.e if there is only 1 element in the Queue , and we want to delete it , then the code would be void dequeue() { struct node*temp=front; if(front==0 && rear==0) { printf("UnderFlow Condition "); } else if(front==rear) { printf("The element which is deleted is %d ",front->data); front=rear=0; free(temp); } else { printf("The element which is deleted is %d ",front->data); front=front->next; free(temp); } } BTW Thank you so much Ma'am for this Amazing Content ❤❤

[@justcurious1940]

No need if we don't use the rear in the past functions I think .

[@ripalnakiya]

Best teacher on YT

[@ducatidiavel9639]

Hello Ma'am, I have 2 questions, 1) Given that the video is about a LL implementation of a linear Q, are there any rules that a circular linked list cannot be used, in place of a singly linked list with 2 pointers? 2) And regarding your statement that a DLL using a head and tail pointer.. A DLL uses Nodes that only have a previous and next pointer right?

[@ayaamverma6742]

1) A circular LL can be used here tho it will also contain the head and tail pointer like the singly LL used here; thus practically we will be using only the semi-circle of the CLL since our enqueuing and dequeuing are restricted between the head and tail pointer. Hence the last pointer of our CLL (from last node to first node) won't be of any use and simply be using memory space. Otherwise using a CLL is as good as singly LL.

[@ravibisht2904]

Mam apko dekh kr apne app hi padne mai man lag jata hai.. Nice explanation

[@shehaniperera8801]

Great explanation ma'am.. Thanks to this video now I can do my home works peaceful...❤❤❤

[@AjeetKumar-mo6xt]

i can trust all your videos because your accuracy is around 100 percent

[@riyajaiswal2137]

I tried this code but its not working...linked list and array as well for queue ...both arent working.

[@babon_zia]

Thanks for letting me understand the queue concisely.

[@priyakaushik635]

Thankyou❤❤your lectures are really good

[@baraamayasa5190]

thanks for your great explanations the data structure more fun and a lot easier with your lessons in this code there is a little problem when the front and rear pointers referring to same node because front pointer will be null otherwise rear pointer will lost the node but in that situation must refer to null so we need to add that statement to the code. #include #include struct node{ int data; struct node* next; }; struct node* front=0; struct node* rear=0; void enqueue(int data){ struct node* newNode=(struct node*)malloc(sizeof(struct node)); newNode->data=data; newNode->next=0; if(front==0&&rear==0){ front=rear=newNode; } else{ rear->next=newNode; rear=newNode; } } void dequeue(){ struct node* temp=front; if(front==0&&rear==0){ //&&rear==0 printf("empty queue "); } else if(front==rear){ //peek(); front=rear=0; free(temp); } else{ //peek(); front=front->next; free(temp); } } void display(){ struct node* temp=front; if(front==0&&rear==0){ printf("empty queue "); } else{ while(temp!=0){ printf("%d\t",temp->data); temp=temp->next; } printf(" "); } } void peek(){ if(front==0&&rear==0){ printf("empty queue "); } else printf("front data: %d ",front->data); } int main() { dequeue(); enqueue(5); enqueue(0); peek(); enqueue(-3); display(); dequeue(); dequeue(); dequeue(); dequeue(); enqueue(11); peek(); display(); return 0; }

[@maherinamdar2373]

Excellent teaching ma'am👌❤

[@vaishnavijasutkar8480]

Your teaching is best. Mam plz make videos of c programming also.

[@researchayan4518]

You have a MALAYALI English accent...good lecture.

[@princeverma-or7nc]

Great mind with great beauty ✨✨✨✨ Thanks you mam ❤

[@Shubhampatil-du8ys]

Awesome explanation maam, this video help me a lot

[@surbhimishra2015]

Ma'm you are awesome I have learned many topics from your lectures. During this online classes .Online classes are of no use .Thank you ma'am for this Amazing lectures🙏

[@avirupbanerjee3253]

Mam why do we need to specify both front and rear while checking whether the list is empty or not. We can do it using rear only.

[@Mmkarts_i]

Thank god we had an online like u mam, even ur lectures in online did it but not upto the point 😂

[@satyamshukla3816]

god bless you mam.you are best teacher ever

[@bhojpuri-short34]

Thank you so much ! nice explanations

[@akasharyan6233]

Ma'am you should come to my clg coz no facaulty is like you And no 1 teach like as you teach🤗

[@maishamolepo2216]

Amazing content Jenny! Keep it up.

[@Shivaniverma24317]

Ma'am apko jitna thank you bolo utna Kam h 😊❤ but thank you so much ma'am 💝💯 you are the best ❤🎉

[@barathkumarg3461]

Thankyou for the wonderful explanation mam your lectures very helpful in this lockdown situation

[@ghumoindia8828]

to be honest I was distracted while going through the topic, its due to the beauty you hold mam.

[@specialforces4793]

Great Explanation.......

[@lks5343]

Nice explanation mam , Thank you.

[@alokshukla1223]

Thank you ma'am ! That was really very helpful.

[@prashantverma9920]

Crystal Clear.Thank You Very Much!!

[@vakhariyajay2224]

Thank you very much. You are a genius. 👍👍🔝🔝👌👌🙏🙏

[@ashishgrover4506]

Thanks mam you make this topic very easy for me

[@neerajanavya4178]

Thank for your explanation madam your teaching is very nice and clear madam

[@nitinkhilari1389]

Excellent Teaching Ma'am

[@PrabhatKumar-jl3se]

thank you ma'am!!!!!

[@saikumartamminana3530]

ur explaination is just awesome like you mam

[@polymathmeraj6750]

a small correction..... in dequeue operation, a new condition will come, if(rear==front && front!=0 && rear!=0){ front =rear =rear->next; free(temp); }

[@justcurious1940]

Yes, I agree .

[@bekind136]

mam thankyou so much literally so made data structures easy peasy

[@fun.facts_videos]

thanks to you for saving my much time! superb!

[@3ngdzgu]

Thank you so much mam ur vedios are quit easy to understand the concepts of data structures....thank you lotzzz😊😊

[@coderssknowledge8342]

awesome explanation mam,thanks....,plzz make videos on sorting of linklist.

[@truegrabbers]

Mind Blowing Explanation Maam thank you :))

[@suhailaadeeb2780]

mam super.i can understand ths ds through ur words

[@mirtanvirahmed3868]

I have implemented the logic myself first and then watching the video 😁

[@alokshukla1223]

Ma'am ! A request...Can you make a video series on data base Management system, please..?

[@thecloudterminal]

Thank you for great explanation and putting so much effort mam 🙏

[@unique_bhanu]

Thank you so much 🙏 madam

[@aryanakabra3748]

NULL and 0 are both different. Both have different meaning. "struct node* front = 0" is wrong🤷🏻‍♂️. It Should be " struct node* front = NULL ".

[@namansingh7721]

0 is type casted to NULL by compiler but might not work on all machines

[@dipesh1401]

0 is identified as address by compiler

[@kovivivek9471]

AGree with u

[@justcurious1940]

#define NULL 0

[@technicalalhan914]

NULL = 0

[@user-pn7ig7gu7r]

Thanks ma'am.

[@zenithacademy4588]

Very easily explained 👌

[@nishanty7392]

Present Mam

[@rohitborra2507]

beautiful and very clear

[@HarithaSree14]

Awesome mam....Helps a lot

[@gopavaramsaimadhuree520]

Very clear ma'am Thank you ma'am ❤️🙏

[@ritabritabasak5652]

So so thanks Ma'am... 🌻🌻🌻♥️♥️

[@saritakumari-oh8fs]

Absolutely genious mam

[@meghasinha1706]

Mam thanks for your efforts

[@Ammu-sathya]

❤

[@mukeshmanral1327]

In previous lecture we have discussed stack I guess 😁

[@StrollerEngineer]

Please upload all videos on data structures we support you

[@shirishashetty3967]

Thanks a lot

[@nishanthulwan1478]

Hello why are you assigning front and rear as 0 ? 0 can be a valid node instead of assigning it as 0 can we assign it as NULL? thanks.

[@continnum_radhe-radhe]

🔥🔥🔥

[@allbestproducts682]

Thanks Jenny Maam

[@pujakumari7474]

Plzz mam operating system concept and networking management pe video upload kijiye

[@kennongri]

Mam, i think you miss one condition in dequeue, when the data being deleted is the last element, we have to make front= rear= null; after deletion.

[@cricketuptodate4223]

if(front==rear==new node){ front=rear=0; } ????

[@thevindudilmith5343]

Thank you so much 😊♥️♥️♥️

[@shouvikdutta2825]

in dequeue , else part after upgrading front , we have to upgrade temp->next=null ;

[@JennyslecturesCSIT]

that is not compulsory to update.. u can update if u want..

[@yadnyeshrane7448]

@@JennyslecturesCSIT mam what if whenver we are deleting the element and only 1 node present that

[@yashawanthkumaryashwanthku8807]

@@yadnyeshrane7448 We have to write another if condition after checking emptiness of list like , if(temp->next==0) { printf("%d",front->data); front=0; rear=0; free(temp); }