Single Linked List (Inserting a Node at the End)

[@vijaysinghchauhan7079]

Your way of teaching and presenting makes the subject easy to grasp ✊ and the best 🌟 thing is that you do all this under 6-8 minutes(speaking generally).

[@-saltless]

I've tried to figure this out all day. This video is straight to the point and goes thru line by line

[@isteak.0023]

for those who are confused about the part " while (ptr->link != NULL) " and (ptr!=NULL): it would't be (ptr!=NULL) cause during node 3(3000) ,it satisfies the condition (ptr!=NULL ) ,so ptr becomes ptr->link =NULL . So in next part to assign temp in ptr->link first we need ptr .but as it has become NULL (mentioned earlier) simply ptr->link doen't exist anymore. It was my understanding . pardon my english.

[@fatimaachbout9284]

but the ptr will not have NULL ever , the NULL will be just in ptr->link , I didn't get it 🥲

[@skekramak4725]

same​@@fatimaachbout9284

[@ajmalkhaniit]

Sir you explain each and everything in such a manner we go to automatically deep of the subject Amazing

[@ahmadaklakh6736]

Jindagi me pahli bar esa teacher dekha Jo enta difficult chapter ko easy bana Diya thank you so much sir ❤❤❤❤

[@iqbalahmed9128]

Im d frst student for the lecture.!! Yayyy way to go neso... very well done

[@aspiredifferent8085]

Kitna aasani se samjha diya sab kuch NESO ACADEMY ke aage koi nahi hai .

[@ecea044gauravgogoi7]

this is the best channel on youtube , please keep uploading the other data structures after linked list also

[@dhananjay9923]

great explaination since morning 8 am im not understanding this inserting and linked list now its 10 pm finally all doubts are clear and now im doing on my vs code

[@AishLovesSpaghetti]

Great Explanation. The function add_at_end can also be created without creating pointer ptr. We can just use head variable in the loop. Some might say that it's not possible because this will change the value in the head variable; however, this won't happen because address in head variable can only be changed inside main function where it was created. Only the copy of the value stored in head (in add_at_end function) is enough to traverse the list. This can be used to reduce the space complexity.

[@sallavatsal]

Amazing lectures! Thanks a lot Neso Academy and the instructors for making such good content and that too for free! :)

[@indanadeevena4597]

Isn't that sooo.....🤩😇 For your teaching...👏👏

[@lipsa-rameshsamal8097]

No 1 playlist...neso academy ❤

[@SatyaPrakash-ol9gv]

Sir plzz upload stack queue and other parts of ds videos....ur way of explianing and visualization is speechless

[@dudefx8971]

Hey neso academy! Are you guys fine? You haven't uploaded videos. Hope u guys are doing well!

[@nesoacademy]

Yes, we're fine. Thank you for asking. We will upload the next lecture today.

[@thrivewise1]

An in-depth explanation of the linked list concept. Great Work!! I hope you are going to make videos on other data structures too.

[@DatasafeWorld]

You make difficult concepts sound so easy.

[@yuechenxiao4228]

Thank you soooo much for sharing this,making learning programming in C much easier(also teaches me to understand indean accent lol

[@emperoraurangzeb4616]

From Where ur actually ?

[@Saikrishna.B]

*indian

[@Lordash234]

finally someone who explains algorithm

[@photolab6712]

superb playlist... best videos on linkedlist

[@allinonesomespecial4]

These videos make excitement to learn DSA .🎉👍

[@mikeorioles]

This video is an epiphany. Thank you so much.

[@uttamkarmakarece3534]

You and your teaching skill is awesome sir

[@alexander-ud9bs]

you are the best bro thank you for this course

[@selfyqueen2605]

You guys are giving way too good content.thank you so much these lectures are helping me a lot.🙇‍♀🙇‍♀

[@dipankar9700]

Very easy to understand Thanks sir U r best 😁😁😁😁😁😁

[@dipeshsamrawat7957]

I love Neso Academy. 💝

[@harroopsinghgala6405]

First of all, Thanks for such an easy explanation. Can you please upload video lectures on Microprocessors(8085,8086,8251,8259,etc) since we are facing problem in that subject too.

[@AbhishekSingh-cu1fe]

Awesome Teaching Sir!! Superb 😍

[@venkyssss495]

Thanks a ton team for making these videos :). In fact thanks is a small word for the kind of content you guys produce.

[@SimranjeetkaurWarwal]

Big fan of ur voice sir🥰😁

[@aniketshivhare601]

Create a variable which indicate the last node of list named "tail" tail contain adress of the last node of linked list using this approach we don't need to travsel whole list to add the node in the last.

[@codingstuff52]

love you bro

[@kacperos2720]

You are a life saver! Thanks

[@muhammadzakiahmad8069]

Thanku I was struggling doing the same in python but this made it lot easier though in C.

[@MrCEO-jw1vm]

Brilliant! Thanks so much!

[@gaboneitormiaw]

thank you so fucking much, after struggling with this for a few days, now i can easily understand what is happening

[@GousePeera-r4r]

Thanks bro 😊

[@shubhangishreya1492]

Thank you so much , for explaining very clearly. By using pictorial representation ..

[@reverbism]

Thank You 4/04/2022 2:47 am

[@johnjohn7795]

Damn good explanation ....love it ❤️❤️

[@vishalmpj9485]

thank u it's easy to understand

[@mamo100]

So great explanaition that raisded a question for me: shouldn't we use a double pointer in "add_at_end" function? The head seems to be lockal in the function.

[@monkman670]

you are amazing

[@shivanshbhardwaj5841]

amazing video sir!

[@ShivarajNallagorla]

Please show the output of codes

[@rahuldusad29]

sir please course complete pdha do sir bhut acha smjhya h apne

[@sadiaafrin2623]

Your are the best

[@roshangogu2670]

Helpful❤

[@palashchandradas3277]

Thank you so much.

[@GAaron-uc9nm]

why can we use head->link->link = temp .....?

[@mischieviousgirl]

5:21 code

[@deepalikatara6531]

Sir please provide the video lectures of design and analysis of algorithm for preparation of gate

[@deepakpandey2100]

Thank You 😊

[@nikhilsachan8598]

Thanxx sr😊

[@zichangprayingtothelord6087]

At very end of addtoend function, don't we need to mention head=ptr?

[@BREACH_X]

Im getting this error please help me with this error: 'head' undeclared (first use in the function). How to solve this i use the exact code as shown on the video but it gives me error it does not work

[@afreenpoly]

Sir Are you uploading these code somewhere? I want the code

[@tayyab.sheikh]

Takeaway for me! You cannot learn data structures without making and understanding figures.

[@Krishna-ek9jk]

Your presentation and explanation good but what about remaining topics in neso app

[@A2312GORREAARON]

can we use head->link->link = temp , no need to traverse the list....?

[@sudheerjalli4707]

When will you upload entire data structures nesoacademy plz upload soon????

[@tradertrader2520]

4:50 I didn't get why not ptr !=null???

[@akashpraveen9814]

If we use ptr!= null, when ptr points to 3000, the condition executes and ptr->link part will get assigned to ptr( i.e) [ zero will be assigned to ptr].if this happens we can't able to find the last node where new node to be inserted..so instead we are check the node link part is zero or not

[@AshokKumar-ix4nf]

@@akashpraveen9814 but it have NULL value why it wouldn't assign NULL instead of 0 can u clear my doubt

[@akashpraveen9814]

@@AshokKumar-ix4nf sorry, i didn't get you

[@vaibhavmourya65]

@@AshokKumar-ix4nf it's a same thing Null Or zero

[@rodwynnejones]

Is there a reason why your doing "ptr = head" rather than just using the "head" (that you've actually passed to the function) in the "while" loop? I've done it both ways and both work.

[@dimi5929]

if you use "head" you won't be able to access the first node as it would then point to a different node.

[@sukshithshetty8349]

This code doesnt work, how should head be defined here?

[@saiharshagurijala2066]

this program won't execute correctly because there is no printf function. am i correct?

[@JosephMokua-o5t]

It executes bro

[@punky6320]

First, thanks for your knowledge sir! For those who got error or something else, you may try this code: #include using namespace std; struct Node{ int data; struct Node *next; }; void add_at_end(Node *head, int data) { Node *ptr, *temp; ptr = head; temp = new Node; temp->data = data; temp->next = NULL; while(ptr->next != NULL) { ptr = ptr->next; } ptr->next = temp; } int main() { // Create a first node with data '45'. Node *head = new Node; head->data = 45; head->next = NULL; add_at_end(head, 98); // add second node. add_at_end(head, 3); // add third node. add_at_end(head, 67); // add forth node. Node *ptr = head; while(ptr != NULL) { cout

[@NishantSingh-br6iu]

Thanks Brother 😊

[@vaibhavborane6763]

I did not got the cout

[@istutirajeev]

Can you please tell that, are we supposed to call free( ) function for *ptr and *temp...within add_at_end( ) function?

[@chandrikaiyer9141]

Can't we do using two pointers only as we did in previous lectures

[@nakulrajkr]

What if the list is empty when we try to insert a node? We have to check that, right?

[@tulikagupta3998]

hey this program is giving ivalid conversion from void* to *node i am not able to sort this out can you help

[@patalamrithish6838]

Typecast (struct Node*) malloc(sizeof(struct Node))

[@siddharthkumar5600]

that's grate

[@HCJ-Technology]

Sir am compiler not able to call function for add node

[@alpha-vy9ej]

Sir please upload the video of graphs in dfs and bfs concept in code

[@Cat_Sterling]

What would be a good way to cover an edge case with an empty list here? What about this if statement before the while loop: if (ptr == NULL) ptr = temp;

[@kuyaq8544]

yeah i was wondering the same thing

[@pankajgopal7574]

Sir this program showing error, will please solve the problem and send program again.

[@ayeshaayesha232]

Can anyone write the same code using switch case statement ,add at begin,end and specific position.i have tried but showing error.

[@eyzhie9096]

In my case, why does my IDE say Application error when I run this code?

[@dominiquefortin5345]

The use of a caboose is another way and it simplifies all the code. struct node *createList() {struct node *nd = malloc(sizeof(struct node)); nd->link = nd; return nd;}; void insertBefore(struct node *nd, int new_data) {struct node *new_nd = malloc(sizeof(struct node)); new_nd->link = nd->link; new_nd->data = nd->data; nd->link = new_link; nd->data = new_data;}; Now all the other functions get simplified : void add_beg(struct node *head, int new_data) {insertBefore(head, new_data);}; void add_at_end(struct node *head, int new_data) {struct node *nd = head; while (nd->link != nd) {nd = nd->link;}; insertBefore(nd, new_data);}; void add_at_position(struct node *head, int new_data, in pos) {struct node *nd = head; --pos; while (nd->link != nd && pos > 0) {nd = nd->link; --pos;}; insertBefore(nd, new_data);};

[@suryatejapaili]

Give me the notes for stacks and queue with program and algorithms

[@shivam-qx2hd]

Here is the Executable Code: // how to add node at end #include #include struct node { int data; struct node *link; }; void add_at_end(struct node *head, int data) { struct node *ptr, *temp; ptr = head; temp = (struct node *)malloc(sizeof(struct node)); temp->data = 67; temp->link = NULL; while (ptr != NULL) { printf("%d ", ptr->data); ptr = ptr->link; } ptr = temp->link; printf("%d",temp->data); } int main() { struct node *head = malloc(sizeof(struct node)); head->data = 45; head->link = NULL; struct node *current = malloc(sizeof(struct node)); current->data = 98; current->link = NULL; head->link = current; current = (struct node *)malloc(sizeof(struct node)); current->data = 3; current->link = NULL; head->link->link = current; add_at_end(head, 67); return 0; }

[@harijogi1621]

tq bro

[@MdArman-f7n6j]

thanks

[@yogeshwaranraguraman9078]

Bro, ptr = temp->link; ?? How? temp->link contains NULL right, You are assigning NULL instead of a New node address we have to assign ptr = temp; because temp contains the address of the new node and ptr contains the last link address as a NULL. so you have to assign ptr = temp; is correct. and temp->link contains NULL as already you have assigned. isn't it?

[@PriyanshuRawat-db6sl]

@@yogeshwaranraguraman9078 ya it should be ptr->link=temp;

[@22saithejasrireddy16]

Sir where can I get this code ⁉️

[@Nickname1234_]

This node is visible only inside the function ....not in main then what's the use

[@kaushaljha1384]

Sir please complete the full code

[@GopikaRaja-c7k]

What is wp =hd ??

[@anyagoswami989]

Could you plzz provide cmplt code..

[@CSstudent_1001]

The best 🤍🤍🤍

[@istutirajeev]

wow!

[@harpreetvirk3308]

5 stars

[@ajoydev8876]

but I can't even understand the difference between of them while( ptr! = NULL) Vs while(ptr -> link! = NULL) Please anyone can clarify?

[@akshaya5037]

ptr stores the address of the node. Like, I think to access elements of the node (data and next address) we need to use ptr->data and ptr->link. Like, if we want to stop when the next address is NULL, we can't be using ptr==NULL right? We want to stop when ptr->link == NULL. Like, ptr == NULL means, node's address is NULL, we can't get that way.... I hope you got it 😅

[@austin2508]

You can think of it this way. we are using ptr -> link = NULL here because: we want to check if we have the address of the next node, we are over-checking (ptr becomes NULL) if we use ptr only. In contrast, for the count and print functions, we use ptr != NULL, because: we are checking the entire node. If we do ptr -> link, we are missing one node. Because the last node is always the format of data, pointer. And this pointer is always NULL)

[@karinakumari3671]

How to print a name using linked list

[@aeroabrar_31]

we can also write the code as ptr = head; while(1) { if(ptr->link == NULL) { ptr->link=temp; break; } ptr=ptr->link; } sir plz complete the play list as soon as possible.....🙏

[@nehavashishth9354]

but when i am printing it ,it is not showing anything.

[@rithikvardhanreddy349]

Yeah even same problem to me i think its a source code if you know how to do keep comment ..

[@abhishekmalviya4667]

@@rithikvardhanreddy349 i think we have to try ptr->link != NULL instead of ptr != NULL then it should work.............

[@roopaligarg792]

That might be because the list is initially empty. As soon as you add one node in the list this solution works, else this code needs to handle empty list scenario as well. @nesoacademy please correct me if i am wrong. Try adding this before while loop and it should work fine: if(head == NULL) { head = temp; return; }

[@rithikvardhanreddy349]

@@roopaligarg792 yeah i think your right once i will try it

[@tejagttggt]

@@roopaligarg792 no it doesn't work because we r creating an another copy of head in the function, therefore we should use double pointers in the function parameter to reflect any changes to our main list.

[@harmeetsingh7381]

👐

[@sukshithshetty8349]

I am gettin a zero at the start of data at node? why

[@sridevichowdary9763]

This code is not working 😔

[@Vikaskarbail]

Wow

[@SUBHANKARDEY-ji6xs]

run hi nhi kar raha

[@vamsikrish7640]

waste of time all progrrams are incomplete

[@JaisuryaPilla]

i got "Segmentation fault" ! what to do?? #include #include struct node { int data; struct node*link; }; void print_end(struct node*head,int data){ struct node*ptr,*temp; ptr=head; temp=malloc(sizeof(struct node)); temp->data= data; temp->link=NULL; while(ptr!=NULL) { printf("%d",ptr->data); ptr=ptr->link; } ptr->link=temp; } int main() { //node-1// struct node*head=malloc(sizeof(struct node*)); head->data=46; head->link=NULL; //node-2// struct node*current=malloc(sizeof(struct node*)); current->data=47; current->link=NULL; head->link=current; //node-3// current=malloc(sizeof(struct node*)); current->data=48; current->link=NULL; head->link->link=current; //node4// current=malloc(sizeof(struct node*)); current->data=55; current->link=NULL; head->link->link->link=current; print_end(head,49); return 0; }