2.4 Linked List Implementation in C/C++ | Creation and Display | DSA Tutorials
ฝัง
- เผยแพร่เมื่อ 12 ส.ค. 2019
- CORRECTION: @24:10 initialize choice variable with 1 by writing:
int choice=1;
In this video we will see implementation of basic operations like Create a Node in Linked List and traverse a Linked List.
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/profile/Jayanti...
Instagram: / jayantikhatrilamba
#linkedlist #datastructures #algorithms
CORRECTION: @24:10 initialize choice variable with 1 by writing:
int choice=1;
long time no see
@@kangmoabel still she is the best
the way she teaches,, its unique & efficient enough..
After loop which is one printed for creating list
Mam can u please provide printed code ?....plzz
@@Mohammed.1471
@SB_Roy_Vlogs
#include
#include
#include
struct node{
int data;
struct node *next;
};
int main(){
struct node *head,*newnode,*temp;
int choice=1;
head=NULL;
while(choice){
newnode=(struct node*)malloc(sizeof(struct node));
printf("Enter node:");
scanf("%d",&newnode->data);
newnode->next=NULL;
if(head==NULL){
head=newnode;
temp=newnode;
}
else{
temp->next=newnode;
temp=newnode;
}
printf("Enter 1 for continue and 0 for exit:");
scanf("%d",&choice);
}
temp=head;
while(temp!=NULL){
printf("%d->",temp->data);
temp=temp->next;
}
printf("NULL");
getch();
return 0;
}
At this point, I dropped my college classes to watch your videos. I learn so fast with you, even though english is not my first language. A big thank you from Brazil!
mi amor brasilia
Bro
@@replyingtomemeansyourstupi8996 iam stupid
Great
Which study you were doing which course
Her dedication should be really appreciated.Please do all algorithms then leetcode also. She will be a youtube education trainer star. Her videos are being viewed from all corners of the world. in short she is helping many students who lack proper lectures. Some people born to help and a bring change in world. She has long way to go.
Please explain me what is the difference between head pointer and newnode pointer and why malloc is used for only newnode but not head
@@badrip3237 the declaration "struct Node* head = NULL" reserves memory for the pointer variable 'head', it doesn't allocate memory for the 'node' structure itself at this point. the memory for the Node structure is dynamically allocated using the malloc.
Thank you ma'am.
The code taught by ma'am is :
#include
#include
void main(){
struct node{
int data;
struct node *next;
};
struct node *head;
struct node *newnode;
struct node *temp;
head=NULL;
int choice,count=0;
while(choice)
{
newnode=(struct node*)malloc(sizeof(struct node));
printf("Enter Data:
");
scanf("%d",&newnode->data);
newnode->next=0;
if(head==0)
{head=temp=newnode;}
else
{
temp->next=newnode;
temp=newnode;}
printf("Do you want to continue (0,1)?
");
scanf("%d",&choice);
}
printf("--------------------------------
");
temp=head;
while(temp!=0)
{
printf("
%d
",temp->data);
temp=temp->next;
count++;}
{
printf("
Count=%d",count);}
}
thanks
Appreciate it bro
Thanks brother
🔥💥
Doesn't run proberly
I finally understood the concept of linked list.
previously, I watched thousands of other youtubers, teaching the same thing and no body does it better than you .
Thank you so much mam.....
One of the best DS lectures i have ever seen on youtube. The tricky concept of linked list has been explained in such an interactive and crystal clear manner that i was able to think of the codes of other operations on singly linked list by end of video.
This type of content deserves millions of views. Wish you get 1 Million + subs soon.
Thanks for the awosome content.
Respect from NIT Jalandhar
Ma'am I have seen many videos of data structures but yours is best 💯thanks a lot for such a best explaination of the concept🙌👍
Mam ne wakai accha tarike se samjhaya hai
Your words are really true bro...
@@pundlikpatil2380 bhai printf scanf ki jgh cout cin ka he to diff hai itna kuch nhi hai same he to hai bro
Kitna paisa mila yeh sab likhne ke liye Bhai
Because of you I am alive ... Can't understand a single concept in my clg but after your 30 mins lecture ... Its now clear and understandable ... Proper explanations and best tutorials in TH-cam for CS students ... Keep this amazing work up !!
This is like exponential times better than my phd professor , glad to be learning from this !
Seriously she deserves Oscar in teaching profession ❤
you explain so good, there is not a lot of QUALITY videos regarding linked list, you are among the few I have ever seen, you made me understand linked list (which I am doing in C now) and I managed to success my homework after trying it for a week without success, you are amazing, I want to thank you for that!
One of the best teacher I have ever seen in my life who explained linked list in such an easy way.
Thanks mam for uploading this video.
Amazing, you didn't only explain the concept of linked lists well, you also taught how to think and construct the program along the way, adding the if else , while loops . Wish I had someone teach me concept like this 10 us back when I graduated I would have found greater joy and purpose in life with programming.
GeeksforGeeks is organising mini course of DSA that you should not miss out.
Why??
1. Live QnA sessions, you can clear all doubts related to DSA. Any doubt from LinkedList to Graph.
2. You will get practice problems after every Data structure to make you good at DSA and crystal clear concepts.
3. After completion of course you will get certificate and can access course anytime.
4. Its FREE!!! But only if you use the below code -
GFGD4Y2JR
Register here-
practice.geeksforgeeks.org/courses/Workshop-DSA?loginMode=308
Thank u so much Maam, the lecture was one of the effective and understanding DS lectures I had watched since now. I again Thank u for the effort you have taken for providing us this Wonderful Lecture.
I was so tensed with linked list.Tried paid courses,even watch other so called 80 k+ subscriber's channels no one was better than you.u explain from heart not juzz for subscribers.hoping 4ur 1 Million+ n ahead!!!! Tysm ma'am
Jenny mam your teaching skills are way better than tier 1 2 3 college teachers really grateful to consume such valuable content for free hats of to your hard work and dedication towards Teaching, every engineers programming base is created from TH-cam .... :)
Oh my, why can’t i understand anything 😢
Did you get then?
Did you pass the course?
😂😂
@@learnersacademybyhaya.345it's been 1 year 😲 , luckily I passed my exam(data structure), it was my 3rd sem subject and currently I am on my final sem(time files like a jet)
@@learnersacademybyhaya.345 yeh, I passed luckily anyway🥹. It was one of my 3rd sem subject
I am also😢😢😢😢
Thank you 😊
You have given new life to my understanding of the C program Link List.
One of the best video on linked list. I tried to learn from different sources but coudn't understand. But after watching this video my concepts are completely clear. The concept has been explained in crystal clear manner. Thank you so much ma'am for this awesome video.
Hello from the USA. Thank you for making these videos mam! I found your channel last spring as I was struggling to implement a linked list ds for a masters course. I found your channel and after watching this video everything clicked for me and I totally understood what I needed to do. I've since passed my course but I find myself still watching videos on your channel even though I don't need to for any course work bc I find your teaching style and white board approach to be so effective.
Sir ,in usa how is the scope of IT sector ? Is it has much scope?
what a explanation, you just won my heart. I got this lecture after suffering a lot from linked list. Thank you so much MAM for providing such a wonderful lecture.
You can't imagine how much you are helping some of us
I had lots of confusion .. but now I understand everything about linked list...thank you so much Jenny mam..
Students like us ..who do not understand concepts easily you teach us easily.😊
This video is so wonderful that after watching it My linked list concepts are Crystal Clear. No one shows the malloc visualization part. You are such a great teacher. Thank you so so so much. Now I'm able to visualize all other problems of Linked List so easily
Best lecture ever ma'am...u have explained every single point...
Really mam the lecture was soo understanding, i was having soo much difficulty in implementation of link list but nothing helped me out.Your lecture was soo good and excellent that i have no doubts remained please continue to teach us like this mam.Really you're a fabolous teacher
Jenny from the number of TH-cam videos on Link List in Data Structure topic you made it really simpler to understand what is actually being done with this complex concept of link list and i guess you really did a lot of hard work before delivering this lecture. Thank you very very much. I hope you will be uploading more useful videos of programming language especially of C++.
finally i undrstand things! very well explained. I'm a self taught engineer so finding a youtube video that explains the concept, answers all the why questions, and all the little details is so rare.
one of the best DS lectures i have ever seen on youtube....
this type of lecture is not present on youtube..thanks mam
Ma'am I have a doubt ,I have an error in if(head=newnode->next=0)
It seems Id returned 1 exit status.
You teach Link List completely in a very logical way and i hope you will never remove this taturail or never chang to payment site . thank you.... wish you the best .
GeeksforGeeks is organising mini course of DSA that you should not miss out.
Why??
1. Live QnA sessions, you can clear all doubts related to DSA. Any doubt from LinkedList to Graph.
2. You will get practice problems after every Data structure to make you good at DSA and crystal clear concepts.
3. After completion of course you will get certificate and can access course anytime.
4. Its FREE!!! But only if you use the below code -
GFGD4Y2JR
Register here-
practice.geeksforgeeks.org/courses/Workshop-DSA?loginMode=308
I have attended my normal lecture and also saw some other TH-cam videos but I never understood linked list implementation.
But after seeing this video everything is crystal clear.
Thanks a lot for such a great effort.
Recently started following your channel.
Good stuff on data structure and algorithms.
Almost everything is covered and explained clearly.
Being a non CS student it is difficult to understand DS but you have made it easy. Thank you.
o....mother of algorithm...💚💛🧡
i never seen such like explanation. ..only and only requist capture ever topic. .
I thank you ma'am for your whole-hearted effort! Your explanation is clear enough to understand! 😊
Thankful for such a brilliant teacher in youtube. One of the best Data Structure lecture one can find.
Who the hell has said the one way communication can't work...🙄
This is incredible mam thanku🥺🌝💗💗
the value of the choice variable must be set to 1 for the initial entry into while loop, EXCELLENT LECTURE MAM !! A great tutorial that took me to the basics !!! happy_coding_geeks !!
Just started understanding basics of linked list. Understood everything clearly. Ma'am, The way you taught the concepts was amazing. Teaching everything with the basic idea, even beginner like me can learn very quick. Thank you so much. Looking forward to watch more of your lectures :)
I'm all serious and attentive throughout the video but your "take care and bye-bye" melts my heart.
GeeksforGeeks is organising mini course of DSA that you should not miss out.
Why??
1. Live QnA sessions, you can clear all doubts related to DSA. Any doubt from LinkedList to Graph.
2. You will get practice problems after every Data structure to make you good at DSA and crystal clear concepts.
3. After completion of course you will get certificate and can access course anytime.
4. Its FREE!!! But only if you use the below code -
GFGD4Y2JR
Register here-
practice.geeksforgeeks.org/courses/Workshop-DSA?loginMode=308
Miss, i have been trying to learn linked list for last 4/5 days.. And wasted 6/7 hours. But somehow i found your video and thought 30 mins will waste again.. But everything changed when you were explain.. You made it so clear and easy.. Thanx for the great video..
The same here...bro....😉😉😉
Thankyou mam i pass the data structure exam by watching your videos😊❤.its really very very helpfull to me
Professor Jenny you are absolutely amazing, thank you so much for all your work, it's extremely helpful. I always watch your videos when I need to understand something, you are definitely the best!
The best lecture I have attended so far on implementation of LL..crystal clear explanation.. thank you so much mam ❤️🙏
Thanks mam for teaching in such an amazing way , keep giving your valuable knowledge 🤩🤩🤩🔥🔥🔥
A big round of applause from Pakistan. Great work....
But please do the same in Java coding. Thank you
Mam I'm really thankful for you ❤️. I never thought that I would understand this topic but you made this really easy to understand. This society needs more teachers like you. Thank you for your amazing help mam💜
I have gone through so many linked list implementation and explanation videos on TH-cam, but none of them helped me, if anything I got more confused. But this video literally saved me from failing my DS exam lol! Thank You so much!
#include
#include
int main(){
struct node{
int data;
struct node * next;
};
struct node *head, *newnode , *temp;
head = 0;
int choice = 1;
while(choice){
newnode =(struct node *)malloc(sizeof(struct node));
printf("Enter data");
scanf("%d", &newnode -> data);
newnode->next = 0;
if(head == 0){
head = temp = newnode;
}
else{
temp -> next = newnode;
temp = newnode;
}
printf("Do you want to continue (0 , 1)?");
scanf("%d",&choice);
}
temp = head;
while(temp != 0)
{
printf("%d",temp-> data);
temp = temp -> next;
}
}
this helped a lot to me thank you
So clean bro.
hai kis chees ka
...been struggling with this for quite some time. Thank you for the help!
Mam ke lectures padhne k baad subject me interest bhi padh jaata hai, jo koi bhi seekhna hahte hai aur achhe se seekh nahi paare bcoz of financial problems or unke clg me achhe se nahi padaya jaara, suno mam itna effort laga rahi hai jitna ho sake donation krdo guys, i know students ko mushkil hoti hai but trust me she's helping us alot more than we ever will so jitna ho sake utni help karo channel ki😄
Thank you so much for your clear and detailed explanation. Helped me to better understand linked lists but also how pointers and dynamic memory allocation really work.
Thank you teacher.
after 4 days of wandering here and there , its all clear now .
A big thanks to you ma'am,i was so frustrated on this topic but you clear all my confusion and make a clear cut concept, thanks you.❤️🤘
GeeksforGeeks is organising mini course of DSA that you should not miss out.
Why??
1. Live QnA sessions, you can clear all doubts related to DSA. Any doubt from LinkedList to Graph.
2. You will get practice problems after every Data structure to make you good at DSA and crystal clear concepts.
3. After completion of course you will get certificate and can access course anytime.
4. Its FREE!!! But only if you use the below code -
GFGD4Y2JR
Register here-
practice.geeksforgeeks.org/courses/Workshop-DSA?loginMode=308
Your way of teaching is very awesome. I feel like I am sitting in a classroom and studying in person from you. Thanks a lot for clarifying the linked list in a very simple manner.
Hands down the best video on youtube for this topic....great explanation!
Guys please watch the whole video.
Proper explanation!Amazing lecturer...Each and every point was explained briefly and she cleared almost all my doubts and confusions regarding link list within minutes.Thank you for this.😊
Your videos are very helpful during this lockdown period.
Thank You ❤
YOU HAVE NO IDEA HOW MUCH UR HELPING ME , DURING EXAMS . YOU'RE SAVIOUR
Thank you, watched it about 3-4 times because i got confused when temp was introduced but when i started drawing the diagrams it made sense, thank you Jenny, you are so brilliant, how you know all these concepts is baffling in a good way, you are incredible.
w o w she's smart, well-spoken and gorgeous?? My brain has officially broken!
I would like to owe you my genuine respect from the core of my heart....a huge amount of respect from me....n fr my friends from Vellore institute of Technology....
Jenny Mam, Your DSA tutorials are a pleasure to watch. You see, It's been 21 years (in my early 40s) since I completed Computer Engineering, and needed a resource to brush up on DSA. Didn't wish to read Cormen again :)
Your simple style of teaching really helped me absorb faster.. Good wishes to you, Mam
Amazing explanation, I was so confused about creating the linked list, but this video made everything clear. kudos.
/*Creation and display of singly linked list*/
#include
#include
#include
void main()
{
struct node{
int data;
struct node *next;
};
struct node *head,*newnode,*temp;
head=0;
int choice;
while(choice){
newnode=(struct node*)malloc(sizeof(struct node));
printf("enter data");
scanf("%d",&newnode->data);
newnode->next=0;
if(head==0)
{
head=temp=newnode;
}
else
{
temp->next = newnode;
temp=newnode;
}
printf("do you want to continue");
scanf("%d",&choice);
}
temp=head;
while(temp!=0)
{
printf("%d",temp->data);
temp=temp->next;
}
}
this code will node work because you have to assign your choice=1 before while
Thanks a lot madam. I was struggling with these for 1 week. I couldn't find any proper material or any lecture video or notes containing good explanations. But after seeing your lecture I am really feeling very comfortable with the topic. Thank you very much for such great explanation. 😊😊
Bhai ye program run hua tha
I Really thank you for your lectures and your Explanations, and the Love you show toward the Subjects.
And that is helping a lot of people who are suffering with where to start and how to start.
Lots of Love❤ from
Telangana,
Hyderabad.
Thanks alot .. i m from different field ... it's bit difficult to do all at my own..but your videos are so soo helpful that boost me to learn more n more..u r truely an inspiration...
Thanks alot once again...❤️❤️
This video made Linked List finally look so so easy, that it made me say.. "Yaar yeh toh kitna easy hai!".. Awesome lecture ma'am! :D
This lecture is so good.. I can't thnk you enough for the lectures u provide.. solid lecture 💯💯
Thank you very much ma. Its the way you spend time explaining each concept and not assume we know everything that makes me Lil your videos. Thanks to making C simple
Really interesting and conceptual,
Initially i used to feel ,to take computer as optional sub, is my worst decision but after knowing about your help, now I am feeling gallant and wishes your good day di.thanks so much....love you
I have to ignore mam in video to understand the topic
Why she 's so beautifull❤
Mam my cousin became your fan at first sight.He listens your lec by sitting with me even though he is not studying at all.
🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣suma eru da
mam you teach from the depth of heart....And this is the biggest reason of your constant energy and smile during all the lecture....."THANKS A LOT''
I think the best lecture I've ever seen on youtube and how clearly defines node concept one by one.
Love u mam😊.
Ma'am its my 17th time of watching this video though I haven't understood this concept well but Dekhna Acha Lagta hai
Awesome linked list tutorial thank you.
It's my request, if you can make video on some higher competitive problems like baktracking,highest substring palindrome pls make
Thanks🙏🙇
OMG what's a understanding level I thinks this type of teachers can clear all doubts of students thanks for this mam😊
Thank u so much ...for making us understand the concept so clearly ....so that we are able to do program by our own❤️
im still amazed on how good this whole playlist is... mam... thank you so much...
Me no hablo engles!
no one can beat you in teaching DSA!!! You are simply the BEST!!!!!!!1
this is wonderful lecture , got stuck for a week in it, now understood in a very good way. maam u r too cute , with same dedication and cuteness , teach us . thanks a lot maam .
Thnk yu...
BTW How yu said "fine" in last is funny nd cute.
Ma’am I’m getting conflicting types for head, while declaring head=0
I don't know how to thank you mam...I have watched several videos on linked list but not even a single video couldn't get into my brain and finally landed on your video...... Excellent teaching.. explained in organizable manner............ thanks a lot mam for ur effort!!!
Thank you for this lesson but I guess your example is somehow complicated compared to the ones that I've watched on TH-cam but overall, it is a GREAT video though. I did not regret watching this and I would recommend this to my blockmates. I like complicated videos like this, it helps in expanding the knowledge capacity of a person. Because of this example, it aided me to successfully create a program like this. Would still watch this again and again.
your tutorials is too helpfull , ma'am,
i am happy to say that , i have seen my sister in you ,durnig the tutorial.
i felt like , my sister is teaching me.
so will you please be my didi?
After watching 3 time i got to know little and i would like to pin point u that u should in main program.
I watched first time but something is missing in my head...should watch once more
same here bro......
This the best explaination of linked list i can ever expect all my queries has been cleared within the video itself.. thanku very much mam....
Clearly explained each and every step . Now we know the use of all the variables in linked list .
Even 1million likes are less for this lecture!!
I can't run it with while(choice), I am using Do-while instead...is that correct way to approach?
with do whille it will be executed once and the ask which doesn't affect anything in short it doesn't matter
shuru mai bhi jab ham choice declare kar rhe hai tih bhi shayad choice ki value deni padegi like int choice=1;
Can you please give me the full code?
I am also struggling to run it
Mam ur explanation is really appreciable .. one of the best DS teacher on TH-cam .My words are not enough to appreciate u
best lecture i have founded just 6 hours before exam.keep up the good work mam.
CODE :
#include
#include
int main()
{
struct node{
int data ;
struct node*next;
};
int choice =1;
struct node*head;
struct node*temp;
struct node*newNode;
head=0;
while(choice){
newNode = (struct node*) malloc(sizeof(struct node));
printf(" enter the data ");
scanf("%d",&newNode->data);
newNode->next=0;
if (head==0)
{
head= temp=newNode;
}
else {
temp->next=newNode ;
temp= newNode;
}
printf ( " do u want to continue ( type 0 or 1)?
");
fflush(stdin);
scanf("%d",&choice);
}
temp= head;
printf("items in linked list are:");
while(temp!=0)
{
printf( " %d",temp->data);
temp= temp->next;
}
return 0;
}
thank you mam
tqsm yar...
Thanks a lot brother❤
can anyone show me the complete linked list program..in same way she is teaching..same variables,functions,and datatypes
Veer Beniwal can you send me too, if someone sent you?
#include
#include
int main()
{
struct node
{
int data;
struct node *next;
};
typedef struct node NODE;
int choice=1;
NODE *head,*newnode,*temp;
head=0;
while(choice)
{
newnode=(NODE *)malloc(sizeof(NODE));
printf("Enter data item
");
scanf("%d",&newnode-> data);
newnode->next=0;
if(head==0)
{
head=temp=newnode;
}
else
{
temp->next=newnode;
temp=newnode;
}
printf("Do you want to continue:(Type 0 or 1)?
");
fflush(stdin);
scanf("%d",&choice);
}
temp=head;
printf("Linked list items: ");
while(temp!=0)
{
printf("%d ",temp->data);
temp=temp->next;
}
return 0;
}
@@aniketmishra8197 Correct, I was thinking that how will it go in while loop already but you have declared choice that is right and instead we can also use do while also , do while will also do right?
bro i have an doubt, y we using NODE.
@@fahimsharuk433 to avoid writing struct node.
What to say ! How many videos have I seen before ,but none of them worked for me ... Thank you so much. Keep going 😊😊😊
Perfect in teaching and perfect in showing every single point. I appreciate your effort my dear
"2:20" best moment
U r superb maam
I have no words to appreciate this kind of explanation.. A full conceptual way to understand the implementation of *Linklist* .. Bs maza aa gya ☺ THANK YOU SO MUCH Ma'am ...