Linked List in C/C++ - Insert a node at nth position

[@manavaswani2423]

Mr. Animesh Nayan! You're gem of an instructor man, seriously. ❤️

[@yashaswani8813]

good to see another Aswani learning to code haha

[@itsmejatin2565]

brother these content was not by animesh nayan but by lord harsha suryanaryaana known as humble fool

[@MrPortraitsofpast]

this guy is so badass. Thorough, precise, not watered down, and still entertaining...dope.

[@PHYSICSGURUSANTOSHYADAV]

Best lecture on internet about programming methodology...i havent seen ever such a clear explanation about each topics..really you all are doing such a great jobs..thank u so much sir....

[@aaqif91]

Wouldn't have been able to perform as well as I am on my C programming course without your videos! You are awesome! Thank you for taking the time to do this.

[@AZihad10]

I don't usually go around praising yt tutorial makers but this visualization process is very cool. You have an unique way of teaching. Thanks and Good luck man

[@3216mohit]

one of the best tutorial on list list... good work!!!!! first time i understand whats this shit is

[@johnnychan6755]

The simulation is excellent! It definitely has helped me visualize the algorithm better. Thank you!

[@arunraj11s]

for (i=1;inext; } this would have avoided unnecessary confusions for beginner.

[@VirtualCarExotics]

thx

[@efstacrazydaisy]

I must say im not confused at all and not a beginner... by watching this video i feel like an expert! Congrats to the team behind it..love you India

[@jossboloko]

your comment helped a lot

[@bodhabhargav6709]

Actually you would get a segmentation fault (core dumped) due to not properly allocating memory.

[@kamalbhatt6041]

if i want to insert my node at second position. Then n=2, the loop wont work for this since n-1=1 here. Please help

[@georgemacintyre3333]

I just want to say thank you so much. These videos are amazing. I understand linked lists so well thanks to these, and I've never seen a programming concept explained so well, not even from my teachers. You are the best!

[@leenanaik3894]

You have explained things very well. I had to watch it 4 to 5 times but it really worth it. Thank you so much.....!

[@yichizhang795]

It is arguably one of the best quality programming video I have ever seen. Thank you so much for making this video. It really helped me out from link list! God bless you sir :)

[@TheVictorEffect]

I'm studying for my finals right now and I'm just now learning my professor literally copied most of your videos to teach us C. Like the code in his slides are IDENTICAL from this tutorial. So funny yet sad I'm paying thousands of dollars when its free here

[@sramaiah110784]

You guys are amazing. Very detailed and clear in explaining. Keep up the good work.

[@ChildofDestiny22]

Big thanks from Indonesia, this is no doubt one of the best programming tutorial in youtube, you explained things clearly! You deserve more subscribers!

[@sakinebarati7448]

it's very helpful and amazing for me,thank you so much,GOOD LUCK

[@davidhasovic]

// Code in C with slightly clearer variable names in the main part of the program // To compile with gcc run this: "gcc -o linked_list2 linked_list2.c ; ./linked_list2" assuming that your file name is named: "linked_list2.c" #include #include struct Node { int data; struct Node* next; }; struct Node* head; void Print () { struct Node* temp = head; while (temp != NULL){ printf ("%d", temp->data); temp = temp->next; } printf(" "); } // The meat of the program void Insert (int data, int position) { struct Node* newNode = malloc(sizeof(struct Node)); newNode->data = data; newNode->next = NULL; if (position == 1) { newNode->next = head; head = newNode; return; } struct Node* previousNode = head; for (int i = 0; i < position - 2; i++) { previousNode = previousNode->next; } newNode->next = previousNode->next; previousNode->next = newNode; } int main () { head = NULL; Insert (2, 1); Insert (3, 2); Insert (4, 1); Insert (5, 2); Print (); }

[@RownitaTasneem-qf5sr]

Thanks a million for your code.

[@shubhambhardwaj2853]

@@shyamsundarjha5913 Because We have Started taking Node 1 as position 1 not Position 0 and we have started for loop from i=0 and at When i will be at Position-2 Our temp2 will be at position-1 Which we need.If You will take i=1 then it will be upto pos-1.

[@parthaprateempatra4278]

@@shyamsundarjha5913 because you always start on the head node and not before it. So if we do n-2 then we are eliminating a iteration to arrive at the n-1 node

[@suryadiptomukherjee7401]

you did not typecast the malloc part buddy

[@sainath7909]

one of the best explained

[@AmanKumar-nj5sz]

Literally the best

[@priyankaradhakrishnan894]

thank you sir.initially felt data structures very difficult but gained more confidence after watching these videos.

[@mycodeschool]

Well, in that case - you will not have to traverse the list from head. You will only adjust some links in constant time.

[@sarveshdhar7213]

you are like a god for me I have never seen this type explanation very nice

[@vijaykumarkari]

wow! really amazing i learned inserting a node in linked list.thank you:)

[@mycodeschool]

Thanks Prashant :)

[@shrichede3463]

for those who are confused about "n-2", just start your loop with i=1 (which means head n=1) then you can run your loop until "n-1" to avoid confusion.

[@bhaswardutta8493]

Thank you!! 🙏🙏🙏🙌

[@convolutionalnn2582]

@@bhaswardutta8493 if we wanna insert in 2 position n=2,so i

[@archit1939]

@@convolutionalnn2582 IN THAT CASE the loop will not run because we require temp2 to be at head position which it already is

[@krushnnabaviskar2170]

THank you for making this gem videos , i will definitely reach to my destination by watching this playlist.

[@rahuldevlenka505]

here's the source code for c: #include #include void Insert(int, int); void print(); struct Node { int data; struct Node* next; }; struct Node* head; void main() { head=NULL; Insert(3,1); Insert(2,2); Insert(4,2); print(); } void Insert(int data, int n) { struct Node* temp1=(struct Node*)malloc(sizeof(struct Node*)); int i; temp1->data=data; temp1->next=NULL; if(n==1)//empty list { temp1->next=head; head=temp1; return; } struct Node* temp2=head; for(i=0;inext;//to point temp2 to (n-1)th node after loop } temp1->next=temp2->next;// point new (nth)node to next node temp2->next=temp1;// to point the previous( n-1 th) node to new node } void print() { struct Node* temp=head; while(temp!=NULL) { printf("%d\t",temp->data); temp=temp->next; } puts(""); }

[@ankanmaiti9864]

The same logic in c++ is not working

[@МаоЦзэдун-б5с]

I have a question. About changing 1st item second time! Clearly that code is wrong, if i want to insert something at first position, this code will point my new node to head "temp1=>Next = head" and then assign head to my new node "head = temp1", which means that "head=>Next == head"(head points to itself), and if we had a data in our list then we would lose it and also have a unnecessary occupied space in our memory, cause C/C++ do not have something like garbage collector. Why do this pal? Something like "//empty list" means nothing in logic, you make your program work properly and you do not make comments asking to not do that second time,while in your example you do that for second time and show that code is working just fine. (i mean in this comment he didn't made that mistake but video author did)

[@МаоЦзэдун-б5с]

​@@ankanmaiti9864​ do you face the same problem as i described? ^

[@mingx009]

Very very clear lecturing. Thanks a lot.

[@01aniruddhaislam26]

Very good tutorial. I wish he continued teaching like this.

[@Sneaky1ne]

I'm very grateful for all these videos and I think it's hilarious that you put subtitles, even tho honestly I think it's better they are there. cheers :)

[@sr5726]

Thank you for the video. We should also take care of invalid position scenario... Eg.if list has just 3 nodes and user does insert( data=1 , n= 65 ), Inside for(i=0;inext; } will crash.. correct way is for(i=0;inext!=NULL ;i++) and node can be inserted at end. Similarly for empty list and invalid position , code can be changed to if (pos == 1 || (head == NULL && pos != 1) ) { newNode->next = head; head = newNode; return; }

[@nikunjchapagain5654]

if(temp2->link == NULL) { cout

[@tembelihlemoyo3566]

I got an exam in a weeks time but the way this guy is explaining,it has given me confidence that i can take the exam today,,,,,thumps high & fuck haters

[@usama57926]

thanks for such an amazing playlist

[@ADNANAHMED-eo5xx]

wow this was confusing, but it was fun, because when u understand after confusion, it is understood better, thanxxxxxxxxxx

[@Naveen-ef2dg]

Best possible way to learn datastructure is through this playlist... Well done sir

[@arkapravadutta8319]

First of all , amazing explanation. Doubt: 1. Why use the if statement at all when n=1, why not just use a while loop and do n--; 2. I am aware that it has something to do with not giving a position that does not exist in the list but i am still not clear as to why we are giving only 1 and 2 as the positions where we want to enter the numbers

[@studentsolution674]

Should i share my code about linklist in C++. So i like the way you explain the things and i want to learn more from you.

[@vijaykumarkari]

This video made my day..really awesome video to understand

[@kandras]

THAT👉 temp2 = head 👈IS MY SAVIOR, THE REASON WHY IT ALWAYS "SEGMENTATION FAULT" great thanks to you man 👍

[@abdulkayuem3247]

Best lecture i have ever seen

[@paulwatkin6360]

My favouite quote in this video is "Head will not be accessible everywhere!", such is life lol! Great work though, really good video.

[@vukstefanovic6275]

your videos are great !!!!! its a shame u don;t make them any more :(

[@md.mujtabaraza1919]

Yeah, he died before completing his playlist :(

[@jitu_jackjp9552]

wonderful ......this is some special type of lacture......

[@Otkucaji1]

Sir, thank you very much for your help, i really appreciate it

[@sukruthipattabi3004]

Your videos are so clear ...thanks !! Which is that software u r using to run the code ? Can u link it or tel abt it ?

[@ajit0rocks]

if your program is going to infinity loop or not working. Just make these Changes in the for loop in the insert function : for (int i = 1; i < n - 1; i++) { temp2=temp2->next; }

[@MrLaggerjack]

still not working

[@srikargajawada3472]

me too facing issue here,can any one help me?

[@aasimbaig01]

this is easy to understand and explain :) void insert(int pos,int val) { //declaration Node *temp1=head; Node *temp=new Node; //inserting value temp->data=val; temp->next=NULL; if(pos==1){ temp->next=head; head=temp; return; } else{ for (int i=2;inext; } temp->next=temp1->next; temp1->next=temp; }

[@itsmejatin2565]

salute lord harsha suryanaryana you will always remembered

[@rohanprak]

WHO IS THE GUY BEHIND THIS AMAZING CHANNEL ?? (voice seems to be from) Indian English accent ) thanks a lot brother for making this channel and for explaining each and every possible query in detail

[@alenp6335]

great video, extremely helpful and understandable

[@sabbirahmed865]

really very nice explanation.

[@mashable8759]

BEST LECTURE EVER

[@abhinavthakur2065]

Great explanation. Just one thing about process layout - It is ".code -> .data/.bss -> heap -> stack" rather than ".code -> .data/.bss -> stack -> heap" :)

[@aswathyjagadeesh]

Thank You Sir!!!! superb explanation :))

[@SahilAnsari-ix6mu]

Sir can i ask a personal question from where u have studied computer because your lectures are too good i want to download each and every lectures but it is taking much time so i m downloading one by one it is helping me a lot I am a first year btech Computer science student...

[@himanshu6489]

he has done his engineering from Netaji Subhash Institute of Technology, New Delhi.

[@anshuman17025]

@@himanshu6489 no. He has studied from IIIT, Allahabad.

[@SpencerDean14]

Very helpful. Thanks for the video

[@backgroundnoiselistener3599]

great explaination dude.

[@chilinouillesdepommesdeter819]

very good explanation!

[@iwayanbagus2271]

great explanation, thank you so much

[@Hello_world807]

Thank you my friend ❤❤❤

[@reeshav994]

will this code work if try to insert at 3 rd position cause u have only done insertions at first and last node

[@goreeska5014]

Great series. I love your page. In the end however the value of head should be the address of 4 (which is 50 not 150) since head has changed.

[@MahendraSingh-te3fm]

Excellent Buddy... Very Helpful.

[@seewhatseeabc]

This guy is good!

[@gauravkumarpandit7022]

best tutorial.Thanks for this.I want to know the ide u r using

[@shubhamgoswami8751]

no any teachers explains in such a simple way...

[@suyashschmidt6985]

Explanation is great. Could you tell how are you writing this code? I mean what compiler? Xcode ?

[@prashantrathi99]

Perfect !!!! awesome explanation ... keep it up !

[@usama57926]

amazing video amazing explanation

[@piyushsharma1638]

very well explained.

[@SaadKhan-xd9yp]

Your videos are really helpful bro. Keep up the good work i m not sure that if you have another you tube channel called "NESO Academy" because last semester i was taking logic design and the videos really helped me to get the grade i wanted. But you guys sound alike. Let me know if that's your channel.

[@deepankdixit7541]

This is an excellent video. At least for me. Thank you very much. Someone please explain to me the difference between temp and (*temp).next .

[@joshmagana3902]

temp contain the adress of the node but temp->next contains the adress of the next one if we only have one node that means node = head so that node will take head adress and node->next = NULL since its pointing at nothing next

[@deepankdixit7541]

Thank you very much Josh Magana.

[@mycodeschool]

Your code is not even compiling. Do not use conio.h and getch().. its not needed. And you have not written the case n==1 correctly. Check the code again.

[@mrbam8]

this is bad example for n-2 for loop... the next video explains it better. Rather than inserting at position 2 this video should have shown inserting at position 3. It would be more clear.

[@rounabhsahu9024]

It would be awsome if u answer or just reply to your kind youtubers watching ur video and asking doubts! BTW great video ___A bit confusion in loop part but otherwise all good!!

[@ayushyadav4076]

we will write struct Node* temp1 = (struct Node*)malloc(sizeof(struct Node*)) or struct Node* temp1 = (struct Node*)malloc(sizeof(struct Node))

[@MaiPham-js2hq]

thanks for your help. I finally find out why the code doesn't run. phewww!!!

[@h_2577]

Great tutorial👍. Doubt: why didn't you deallocate memory..from heap..???

[@harerimanaradjab4568]

dude you are awesome!

[@vikrant4666]

gud job animesh

[@adarshtodi1158]

who animesh?

[@girishchandrakuniyal]

which compiler are used in above videos?? it looks pretty good than turbo c..

[@OscarElnecave]

What about using a typedef to declare the structure? thanks

[@mustafagamal8818]

First Thank you so much for this great explaining , second I'd like to ask some question please, why this program can't deal when n > 2 ? I've tried to deal with third or force place or any place greater than 2 it doesn't work still put the data in the second place ??

[@shubhambhardwaj2853]

It will work Just add temp1->next=NULL; in the last line of insertNode.For Some Reason this Program Was Going in Infinite Loop but it is okay with this addition.

[@manishjoshi539]

why not (n-1) instead of (n-2) there ? struct Node* temp2 = (struct Node*)malloc(sizeof(struct Node*)); for(i=0;inext; }

[@jaspreetpawa]

because i=0 corresponds to node1, i=1 to node2....... i=n-3 to node n-2. within the for loop, node n-2 carries address of node n-1. hence , at the end of the execution, temp2 stores address of node n-1. cheers!

[@kanishkjain2767]

how???? for n = 1 there is a separate condition but for n = 2 the loop will not work because i

[@himanshuladia9099]

You actually don't want to run the loop for n=2. Because the pointer is already at n-1 that is, 1st position.,

[@bhaveshgupta3846]

this confusion is because he is counting the first node as 1 instead of 0. so if you start counting from 1 and do : for(i=1;inext; } you should be fine :)

[@toxiklogic]

Do you think this is odd? For a series on data structures in C, shouldn't we start counting at 0 for an Insert implementation?

[@01aniruddhaislam26]

I think the heap illustration in 14:53 is incorrect . 150 is written under head but it shown to point to 50.

[@parasmani8514]

superb sir !!!

[@HemantKumar-dl9wh]

why you take i=n-2 ?

[@backgroundnoiselistener3599]

the explanation was good. But I did not fully understand the part of insertion function. please explain the part in function insert() where you make a loop and set temp=temp->next.

[@kyssl]

action ka'men that's a step to traverse a linked list.. Watch previous lectures or trace the whole loop yourself

[@MrAkshatmahajan]

You gotta display the whole linked list right? What that line does is traverse thorough the list,it changes the address stored in temp and then in the next line you print temp -> data (whatever data that new address stored in temp is pointing to) for example if next address of temp or node is 100 temp = temp->next will set it to that address and then you can print that data via simple cout statment

[@AnkushPareOfficial]

Sir,if we ask user to enter position for data and initially user enter position greater than 1 lets say 10. so how can we handle this situation???

[@sandhyathugutla4228]

how does for loop works in insertion???please explain

[@foruvasanth]

awesome, what tool you are using for whiteboarding?

[@mohitsharmagarg]

Days to complete Full DSA learning, Average?

[@praveenmarandi6372]

one of the best>>>>

[@dominicvarghese7993]

I could not understand the for loop used. can you explain it

[@codewithruds7452]

why is temp != NULL required?

[@hailongzhao2887]

Posting an implementation which uses the while loop as well as checks boundary conditions: /* Insert Node at a given position in a linked list head can be NULL First element in the linked list is at position 0 Node is defined as struct Node { int data; struct Node *next; } */ Node* InsertNth(Node *head, int data, int position) { Node *node = new Node; node->data = data; node->next = NULL; Node *prev = NULL; Node *current = head; int n = 0; while (n < position && current != NULL) { prev = current; current = current->next; n++; } if (prev == NULL) { node->next = head; return node; } prev->next = node; node->next = current; return head; }

[@amaytrivedi]

Liked your video but can u tell me if we assign address of head node to the node we want in d place of head why are we doin temp->next=head and not simply temp=head;..Thankyou:)

[@danimanabat5791]

thanks a lot!!

[@ahmedsafwat1460]

Thanks for the great explanation ! but the code doesn't work although it compiles...have you tried it yourself?

[@koulicksadhu7679]

What you faced? It works pretty fine

[@sumitbisht4161]

Iam doing... for(int i=8/9/10...(any value); i

[@mannambhavani4266]

Sir u could go little slow, yet great explanation.

[@kandy1249]

before IF condition in insert function ... do we really need that " temp1->next =null "? because it's just an extra step we don't need to perform I think.

[@mrbilalkhan]

If condition checks if the new entry is in the first position of the linked list. whereas temp1->next =null is placed outside the if block if in case the list is empty.

[@AtulSharma-hy9yo]

yes we do need it in case if list is empty!