Inserting the Data at the Beginning of Single Linked Lists (Possible Mistake)

[@rohans2002]

Before watching the solution in the previous video, I'd tried the EXACT same thing and was confused why it didn't work. Glad I got the explanation here.

[@swrjidaimary3871]

I love neso academy. I am fully support neso academy by heart and soul.

[@RaviShankar-ow9pu]

Sir plzzz increase the frequency of lectures!! 💗💝💗💝

[@srivallimadduri1489]

Good evening sir!
I usually use my Lappy to learn but l opened the playlist in my mobile just to like and support ur channel which helped me to understand DS in a better way 😊.... Waiting for ur next topics of ds sir... Lover for neso academy from Andhrapradesh

[@srivallimadduri1489]

@Dipen Rana l didn't get if l should consider it as a compliment or a comment....

[@karthik9354]

What do you mean by support?

[@srivallimadduri1489]

@@karthik9354 support may mean suggesting to few of my frnds which in turn increase the no. Of views to the channel

[@nisha..sharma..8554]

@@srivallimadduri1489 support from vizag

[@Zero-ss6pn]

You're just awesome. I made this mistake and wasn't aware of this possibility. Kudos to you brother!! Keep producing good content. Thanks a lot

[@shivanidalal2860]

Best material so far I came across for link list

[@rishikeshraj3252]

Sir I was also confuse about that i was thinking if I'm passing pointer to add_beg() then it is call by reference then why we should update the head.
Thank your sir

[@lawrencemuthui]

True and in the main function we are able to print the data of the now first node which is 3.
Malloc in the add_beg() function allocate memory in the heap section which is available even after the function terminates.
Should we free all the memory allocated at the end of the code?

[@FaizanKhan-kn7op]

i did this mistake and stuck for 30 min in the code then i decide to
continue the lecture and BOOM i got the solution😂

[@daverussell4052]

totaly clear my doubt in the last lecture

[@aashishbhatt4888]

Please be consistent sir 🙏🙏🙏🙏🙏🙏

[@divyamarora777]

good evening sir,
I am from tech background and I love it
thank you love you

[@ambrishabhijatya7842]

We could pass &head as a parameter to add_beg changing the type of the first argument to struct node** pointerToHead.
Easier solution (perhaps a bad one?) would be to just put head in the global scope.

[@prabhaskoya]

Really really loved your content 💖💖💖💖

[@saurabhkolapkar6277]

Sir your lectures are awsomes
Plz add the lectures of doubly linked list

[@Harshit-ju2iz]

That's exactly the mistake I was making ;-; THANKS ALOT NESO!

[@pratik__r__patil8838]

Damn Good yarr !
Fantastic representation and Expalnation..
Sir , you are Great..
We support you sir ..we love THE NESO ACADEMY ...
LOVE FROM the whole Maharashtra....

[@beeanonymous5032]

Linked stacks and queues application of linked list. Bro needed this. Can u make a video?

[@dipeshsamrawat7957]

I love Neso Academy. 💝

[@sarcasticboy4507]

oh my god you are legend. i exactly though of this when i watched just previous video. thank you for saving my life !!! now i am clear otherwise i also though its not necessay to do head =

[@swrjidaimary3871]

Sir Can you teach about system call using C like fork(), exec() etc on unix and for Windows CreateProcess (), WaitForSingleObject()

[@prashantbhardwaj2675]

hi neso academy...want to ask a question..we have allocated heap memory to head at the starting so it will not vanish out once the function will call of so how it could be pass by value..i m confused please explain.

[@souradipkumarsaha9267]

Sir you are great...hoping next videos soon ..stay safe sir🙏

[@swrjidaimary3871]

Please sir include some basic idea about system call using c or c++

[@brianfinch0]

sir, please add subtitle for your videos it really helps, thanks

[@Manimeghanath]

Thats the exact mistake i made b4 cing this video ........thanx buddy

[@orijeetmukherjee9392]

amazing work!!!

[@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);};

[@evssaini]

what if we declare head as global variable?
wont it be easy?

[@rugved4503]

plzzz Plz add the lectures of doubly linked list

[@abiadhimoolam1391]

Sir pls provide english subtitles also sir

[@killerqueen6023]

I made same mistake, when performing this myself

[@RohitRoy-cz2lo]

Can we use functions of both adding_node_at_end and adding_node_at_beginning to create our linked list,I have tried this and i am getting some error , can anyone guide me in this

[@DaiMoscv]

then how about we just return ptr instead of head

[@A_sudden_stranger]

I was doing this same mistakes 😢

[@aditidana6159]

just wow

[@squidward7421]

Instead of returning head, you could give head to the "add_beg(&head)" as a double pointer, this way you don't give the value inside of head, but the actually reference to head. In this case the code inside the function add_beg does need accordingly.
For readability your way is certainly better.
-edit
nvm, you talk about this in the next video of the playlist.

[@Bhumikabhagat05]

wrrongg

[@__Kuch_Bhi___]

👍🙂

[@snatamkamila8821]

grate

[@AbcnaihauHnahUznnz]

While writing the code i made this mistake🤣🤣

[@mohdmuqeem9291]

Sir please increase time also.videos are too short

[@leenasharma4809]

Purse